Subgrid-scale representations for neural network based closure models for turbulent flows

Keywords: computational fluid mechanics, turbulence modelling, partial differential equations, machine learning, energy conservation.

1. Problem

In turbulence modelling, and more particularly in the LES framework, we are concerned with finding a suitable closure model to represent the effect of the unresolved subgrid-scales on the larger/resolved scales. In recent years, the scientific computing community has started to gravitate towards machine learning techniques to attempt to solve this issue. However, stability and abidance by physical structure of the resulting closure models is still an open problem.

2. Preliminaries

2.1 Discretizing PDEs

In this project we deal with PDEs of the following type:

\[ \frac{\partial u}{\partial t} = f(u) \]

which describe the evolution of some initial fluid velocity field u(x, t = 0) = u0 in space x ∈ Ω and time t. The right-hand side (RHS) f is typically derived from underlying physical conservation laws. In order to solve such a PDE on a computer we discretize in space to obtain a set of ODEs

\[ \frac{du}{dt} = f_h(u) \]

where u ∈ RN approximates u on a grid (with grid-spacing h) and fh is an approximation of the continuous operators in f . The problem is that in the case of turbulent flows we require N to be large, resulting in high computational costs [1].

2.2 Filtering

To resolve this issue we apply a spatial averaging filter to the solution:

\[ \bar{u} = Wu \]

where multiplication by W ∈ RI×N reduces the degrees of freedom in the system from N to I. However, we still require knowledge of the high-resolution approximation u to evolve the averaged system in time [1]:

\[ \frac{d\bar{u}}{dt} = W f_h(u) \]

To circumvent this we rewrite this to

\[ \frac{d\bar{u}}{dt} = f_H(\bar{u}) + \underbrace{\left(W f_h(u) - f_H(\bar{u})\right)}_{:=c} \]
Figure 1: Decomposition of kinetic energy E into Ē and E′.

where fH represents a coarse discretization of the PDE. The commutator error c(u) is referred to as the closure term. The goal is now to model this closure term by some approximation c̃(ū) s.t.

\[ \tilde{c}(\bar{u}) \approx c(u) \]

In this way we do not require knowledge of the high-resolution approximation to ”close” the averaged system of ODEs s.t. we lower the degrees of freedom and in turn alleviate the computional burden.

2.3 Machine learning solution

Machine learning algorithms, more specifically neural networks, can readily be applied to model this closure term [2–6] which transform the set of ODEs to

\[ \frac{d\bar{u}}{dt} = f_H(\bar{u}) + NN(\bar{u}) \]

with NN(ū) being the output of a neural network. The neural network is trained by minimizing the error w.r.t. high-resolution reference data. However, these hybrid classical + neural network approaches can lead to unstable simulations, as the neural network is unaware of physical conservation laws. In ongoing work attempt resolve by building kinetic energy conservation into the neural network.

2.4 Energy conservation

To achieve this, we first show that we can split the kinetic energy into a resolved Ē and unresolved E′ part:

\[ E = \bar{E}(\bar{u}) + E'(u') \]

where u′ ∈ RN is everything that is filtered out by multiplying u with W. We refer to u′ as the subgrid-scale (SGS) content and to E′ as the SGS energy. This changes the energy-conservation condition to

\[ \frac{dE}{dt} = \frac{d\bar{E}}{dt} + \frac{dE'}{dt} = 0 \]

This decomposition is shown in Figure 1 for a high-resolution simulation of the Korteweg-de Vries equation [7]. To circumvent the need for the full u′ in this conservation law we introduce a set of SGS variables s ∈ RI which approximate the SGS energy on the coarse grid as

\[ E' \approx \frac{H}{2}s^T s \]

where H is the grid-spacing for the uniform coarse grid. The result is an approximated kinetic energy conservation condition

\[ \frac{d\bar{E}}{dt} + \frac{H}{2} \frac{d s^T s}{dt} = 0 \]

Both ū and s are evolved in time using our newly developed skew-symmetric neural network architecture that ensures that this condition is satisfied, yielding stability. Currently, these SGS variables are constructed by applying a linear filter, learned from highresolution simulations, to u′ which compresses the SGS content onto the coarse grid reducing the degrees of freedom of the system from N to 2I.

3. Objectives & project outline

For this project we are mainly interested in gaining more understanding of both the theoretical and practical aspects of the SGS variables. We therefore propose the following outline of the project:

  • Literature study on: partial differential equations, computational fluid mechanics, closure modelling, machine learning [2–5, 8, 9].
  • Theoretical study on the SGS variables: What do they represent?
  • Suggest new forms for the SGS variables, e.g. neural networks.
  • Possibly suggest new neural network architectures (or non-data-driven approaches, linear models etc.) for the closure model, derived from energy arguments.
  • Implement SGS variables and compare performance for the convection-diffusion equation.
  • If everything goes well: Burgers equation, Korteweg-de Vries equation, possibly Navier-Stokes.

References

[1] P. Sagaut and C. Meneveau. Large Eddy Simulation for Incompressible Flows: An Introduction. Scientific Computation. Springer, 2006. ISBN 9783540263449. URL https://books.google.nl/ books?id=ODYiH6RNyoQC.

[2] Syver Døving Agdestein and Benjamin Sanderse. Learning filtered discretization operators: non- intrusive versus intrusive approaches, 2022. URL https://arxiv.org/abs/2208.09363.

[3] Hugo Melchers. Machine learning for closure models. Master’s thesis, June 2022.

[4] Yohai Bar-Sinai, Stephan Hoyer, Jason Hickey, and Michael P. Brenner. Learning data-driven discretizations for partial differential equations. Proceedings of the National Academy of Sciences, 116(31):15344–15349, 2019. doi: 10.1073/pnas.1814058116. URL https://www.pnas.org/doi/ abs/10.1073/pnas.1814058116.

[5] Andrea Beck, David Flad, and Claus-Dieter Munz. Deep neural networks for data-driven les closure models. Journal of Computational Physics, 398:108910, 2019. ISSN 0021-9991. doi: https: //doi.org/10.1016/j.jcp.2019.108910. URL https://www.sciencedirect.com/science/article/ pii/S0021999119306151.

[6] Jonghwan Park and Haecheon Choi. Toward neural-network-based large eddy simulation: applica- tion to turbulent channel flow. Journal of Fluid Mechanics, 914:A16, 2021. doi: 10.1017/jfm.2020. 931.

[7] Jin-Liang Yan and Liang-Hong Zheng. A class of momentum-preserving finite difference schemes for the korteweg-de vries equation. Computational Mathematics and Mathematical Physics, 59(10): 1582–1596, Oct 2019. ISSN 1555-6662. doi: 10.1134/S0965542519100154. URL https://doi.org/ 10.1134/S0965542519100154. 3

[8] Antony Jameson. The construction of discretely conservative finite volume schemes that also globally conserve energy or entropy. J. Sci. Comput., 34:152–187, 02 2008. doi: 10.1007/ s10915-007-9171-7.

[9] Marius Kurz and Andrea Beck. Investigating model-data inconsistency in data-informed turbulence closure terms. 02 2021. doi: 10.23967/wccm-eccomas.2020.115.

Toby van Gastelen, Benjamin Sanderse (group leader).
November 8, 2022