Variational Multiscale Closures for Finite Element Discretizations Using the Mori-Zwanzig Approach
Aniruddhe Pradhan, Karthik Duraisamy

TL;DR
This paper introduces a novel coarse-grained modeling approach combining Variational Multiscale decomposition with the Mori-Zwanzig formalism to improve finite element simulations of multiscale problems, adaptively determining memory effects.
Contribution
It develops a parameter-free, adaptive sub-scale model for multiscale finite element discretizations using Mori-Zwanzig formalism, applicable to turbulence and Burgers equation.
Findings
Model effectively captures unresolved scale effects.
Adaptive memory length improves simulation accuracy.
Applicable to turbulence and nonlinear problems.
Abstract
Simulation of multiscale problems remains a challenge due to the disparate range of spatial and temporal scales and the complex interaction between the resolved and unresolved scales. This work develops a coarse-grained modeling approach for the Continuous Galerkin discretizations by combining the Variational Multiscale decomposition and the Mori-Zwanzig (M-Z) formalism. An appeal of the M-Z formalism is that - akin to Greens functions for linear problems - the impact of unresolved dynamics on resolved scales can be formally represented as a convolution (or memory) integral in a non-linear setting. To ensure tractable and efficient models, Markovian closures are developed for the M-Z memory integral. The resulting sub-scale model has some similarities to adjoint stabilization and orthogonal subscale models. The model is made parameter free by adaptively determining the memory length…
| Case | Domain Size | Degrees of Freedom | Grid Size | Time Step | Viscosity | Memory Length |
|---|---|---|---|---|---|---|
| DNS (Spectral) | 4096 modes | - | ||||
| Dynamic | 32 elements | Dynamic | ||||
| FM =0.01 | 32 elements | 0.01 | ||||
| FM =0.11 | 32 elements | 0.11 | ||||
| FM =0.23 | 32 elements | 0.23 | ||||
| OSS [15] | 32 elements | - | ||||
| No-Model | 32 elements | 0 |
| Case | FM ’s | |||||||
|---|---|---|---|---|---|---|---|---|
| Case A (DNS) | 1024 modes | 1 | 8 | - | ||||
| Case A (LES) | 32 elements | 1 | 8 | 0.01, 0.1 and 0.4 | ||||
| Case B (DNS) | 4096 modes | 10 | 32 | - | ||||
| Case B (LES) | 64 elements | 10 | 32 | 0.0001, 0.001 and 0.01 |
| Case | FM ’s | ||||||
|---|---|---|---|---|---|---|---|
| DNS-400 | 1 | 1 | - | ||||
| LES-FM-400 | 1 | 1 | 0.01 and 0.002 | ||||
| LES-DY-400 | 1 | 1 | Dynamic | ||||
| DNS-800 | 1 | 1 | - | ||||
| LES-FM-800 | , | 1 | 1 | 0.01 and 0.002 | |||
| LES-DY-800 | , | 1 | 1 | Dynamic | |||
| DNS-1600 | 1 | 1 | - | ||||
| LES-FM-1600 | , | , | 1 | 1 | 0.01 and 0.002 | ||
| LES-DY-1600 | , | 1 | 1 | Dynamic |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Variational Multiscale Closures for Finite Element Discretizations Using the Mori-Zwanzig Approach
Aniruddhe Pradhan
Karthik Duraisamy
Department of Aerospace Engineering, University of Michigan, Ann Arbor, MI 48109, USA
Abstract
The simulation of multiscale problems remains a challenge due to the disparate range of spatial and temporal scales and the complex interaction between the resolved and unresolved scales. This work develops a coarse-grained modeling approach for Galerkin discretizations by combining the Variational Multiscale decomposition and the Mori-Zwanzig (M-Z) formalism. An appeal of the M-Z formalism is that - akin to Greens functions for linear problems - the impact of unresolved dynamics on resolved scales can be formally represented as a convolution (or memory) integral in a non-linear setting. To ensure tractable and efficient models, Markovian closures are developed for the M-Z memory integral. The resulting sub-scale model has some similarities to adjoint stabilization and orthogonal sub-scale models. The model is made parameter free by adaptively determining the memory length during the simulation. To illustrate the generalizablity of this model, it is employed in coarse-grained simulations for the one-dimensional Burgers equation and in incompressible turbulence problems.
keywords:
Mori-Zwanzig, Continuous Galerkin, Variational Multiscale Method, Coarse-grained Modeling
††journal: Computer Methods in Applied Mechanics and Engineering
1 Introduction
Numerical simulation of multi-scale phenomena requires the development of coarse-grained models, which attempts to resolve a sub-set of the scales while providing a model for unresolved features. As an example, a popular approach employed in the simulation of turbulent flows is large-eddy simulation [1, 2, 3, 4, 5, 6], which filters the flow field to resolve the largest energy containing scales and providing a model for the scales smaller than the filter length referred to as the sub-grid scales (SGS). The success of these sub-scale models largely depends on the validity of assumptions at simulated flow conditions. For example, the Smagorinsky model [1], which is one of the most commonly employed SGS models, is based on the assumption that modeled rate for turbulence kinetic energy transfer from large to small scale balances dissipation [7]. This assumption is clearly not valid for all turbulent flows. An alternate approach to SGS modeling without employing phenomenological assumption, which we pursue, is to derive sub-grid models directly from the structure of the PDE and the numerical discretization.
In addition to physics-based sub-grid scale models [1, 3, 2, 8] presented above, models based on the variational multiscale method have proven to be quite successful for both linear [9, 10, 11, 12, 13] and non-linear problems [14, 15, 16, 17, 18, 19]. The variational multiscale method is based on a similar idea of decomposing the flow field into resolved (coarse-scale) and un-resolved (fine-scale) variables. The fine-scales are then approximated using simple algebraic operators acting on the residual of the coarse scales which give rise to additional stabilization terms in the standard Galerkin procedure [10, 11, 12]. A link between the stabilization terms and implicit sub-grid models [9] has been established. Different stabilization techniques such as the Galerkin least square (GLS) [10], the streamwise upwind Petrov Galerkin (SUPG) [11, 13], the adjoint-stabilized methods [12, 20, 15], and the orthogonal sub-scale stabilization [15] can be derived based on the type of algebraic model for the fine-scales. In the early days of the development of the VMS techniques, these methods were formulated for linear problems, and their application to the non-linear multiscale problems such as the Navier-Stokes equations though successful, depended on constructs such as transformations to linear problems such as the Oseen equations at every non-linear iteration. Recently, however, several attempts have been extended to develop non-linear VMS closure models by Codina et al. [14, 15], Bazilevs et al. [16] and many others [17, 18, 19]. These methods utilize a stabilization parameter which is an approximation to the inverse of the differential operator of the governing equation. This model parameter is typically defined in terms of a local length-scale, elemental Reynolds and Courant numbers [20] or derived from the Fourier analysis of the fine scale equation [15]. Further, it is chosen to aid optimal convergence and stability of the method.
In this work, we aim to develop a general coarse-graining approach in the context of the continuous Galerkin method, that is: (i) built using a non-linear model reduction strategy akin to Greens functions for linear problems; (ii) capable of generating a fine-scale description directly from the structure of the PDE and the underlying numerics; and (iii) model parameters are adaptive to the resolution, and are dynamically determined.
The VMS decomposition of a PDE leads to a set of coupled equations which govern the coarse-scales (resolved) and the fine-scales (un-resolved) respectively. However, the fine-scale closure problem still persists. In our approach, the dependence of the fine-scale variables on the coarse-scale variable is removed by using the optimal prediction framework developed by Chorin [21, 22]. This framework, originally developed in the context of non-equilibrium statistical mechanics, enables the higher dimensional non-linear Markovian dynamical system to be written into an exactly equivalent lower dimensional non-Markovian dynamical system [23, 24, 25]. The advantage is that the evolution of any observable in time can be represented solely in terms of the resolved variables. The cost of evaluating the resulting closure term, however, is enormous. The possible simplifications will be discussed later in the paper. Similar ideas have been put forward by Stinis [26], Parish and Duraisamy [23, 24] in context of spectral methods and discontinuous Galerkin (DG) [27] methods. The MZ-VMS philosophy presented herein closely follows the approach presented in [27, 28]. However, the derivation of the closure terms in a continuous Galerkin setting requires specific approximations. As will be discussed in this article, the contributing term to the final closure model in CG is different from that in DG. The main contribution of this work is to extend these dynamic closure models to the continuous Galerkin (CG) method previously not explored by Parish and Duraisamy [27, 28] and testing them on canonical turbulent flow problems.
The outline of the paper is as follows: We introduce the M-Z formalism in Section 2 and the VMS method in Section 3. In Section 4, we develop the VMS-MZ method in the context of a continuous Galerkin (CG) discretization. In Section 4, we derive a dynamic model for the estimation of the memory length of the convolution integral to provide a parameter free closure to the model. In the final part, we discuss results for canonical turbulence cases in Section 5. Finally, we conclude our work in Section 6.
2 The Mori-Zwanzig (M-Z) formalism
In this section, we introduce the general principles of the M-Z formalism [21]. The concept of M-Z was first introduced in the context of statistical mechanics [29, 30] but was later extended by Chorin [21] to more generalized systems. To demonstrate the basic idea of M-Z, we introduce it in a simple linear dynamical system with two degrees of freedom. Following this, we present the generalization of this concept to non-linear systems via the Generalized Langevin Equations (GLEs).
2.1 Linear Dynamical System - An Example
Consider a dynamical system with two degrees of freedom given by
[TABLE]
[TABLE]
where and are the state space, and time with initial conditions: and provided. Our aim is to write an exact evolution equation for just one variables, say , i.e.
[TABLE]
Using the appropriate integration factor and integrating Equation (2) we have the following equation in :
[TABLE]
Equation (4) has three terms: (i.) the first term represents the Markovian term containing the resolved variable; (ii.) the second term is the memory integral; and (iii.) the third term represents the dependence on the initial condition of on . Although Equation (4) represents the evolution of without any dependence on the second variable , the flow of at any point of time not only depends on the current values of but also on its history weighted by an exponential factor. The two variable Markovian system is now converted to a one variable non-Markovian system without loss of accuracy. For coarse-grained model development for , Equation (4) requires the inclusion of closure for the memory integral term.
2.2 The Generalized Langevin Equation
Although the discussion in the previous section was limited to a linear system, the M-Z formalism can be generalized to non-linear problems as well. To this end, consider the spatial discretization of a space-time problem leading to the following set of coupled ODEs in time:
[TABLE]
where , and are the modes we want to resolve and model respectively. The choice of spatial discretization can be of non-tailored basis such as spectral methods [23, 24], continuous, and the discontinuous Finite Element (FE) basis functions [27] or tailored basis obtained from purely data driven techniques such as the proper orthogonal decomposition (POD) [31]. By assuming the initial condition of the problem to be , we aim to solve for without solving for the un-resolved modes to reduce the computation and cost. However, unlike the linear problem discussed in the previous section, non-linearity restricts us from using the integration factor approach. The Mori-Zwanzig approach [21, 22, 32] allows us to cast the above non-linear problem (Equation (5)) in the form of a linear PDE in the space of initial condition variables and time as follows
[TABLE]
where the Liouville operator corresponding to Equation (5) is defined as
[TABLE]
and initial conditions , where is a scalar valued observable. Equation (6) can be shown to have the following solution [21, 22]:
[TABLE]
Next, the semi-group notation is introduced:
[TABLE]
where is called the Koopman operator, which is an infinite dimensional linear operator which when applied to an observable evolves it in time . As a special case, the observables are chosen to be the same as the initial states . As a consequence, Equation (6) along with Equation (9) results in the following
[TABLE]
where the last equality is a result of commutative property [22] between and . We decompose the right hand side of Equation (10) into spaces of resolved initial conditions and un-resolved initial conditions as follows:
[TABLE]
where is the projection operator, where the spaces formed by all initial conditions and resolved initial conditions are denoted by and respectively and . Different forms of projectors can be used [23, 24, 25]. In the present work, we use a truncation projector [22, 27], i.e. the application of the projector to the function results in the truncation of the unresolved initial conditions . The projector acts on the space formed by initial conditions and is different from the -projectors commonly used to project onto finite dimensional spaces. By applying Duhamel’s formula [22],
[TABLE]
in Equation (11), which is equivalent to the integration factor approach for linear systems, we obtain the generalized Langevin equation (GLE) [21, 22, 32] also known as the Mori-Zwanzig identity:
[TABLE]
An important observation is that Equation (13) has a similar structure to Equation (4). The first term is the Markovian term, the second term is the noise due to uncertainty in the initial condition and the last term is called the memory integral. The noise term given by is precisely the solution to the orthogonal dynamics [21, 33] equation given by
[TABLE]
It can also be shown [22] that lies in the null space of the projector i.e. . As a result, application of on Equation (13) results in the following simplification
[TABLE]
Equation (15) is exact and governs the evolution of the resolved modes without any dependence on the unresolved modes. However, it does not lead to reduction in the overall computational cost as it requires the solution of the orthogonal dynamics equation (Equation (14)) which is a high-dimensional PDE and solving it is intractable. However, this marks the starting point for deriving coarse-grained models based on different approximations [22, 32, 34, 35, 24, 33] to the memory term. In this paper, we use the fixed memory type model which assumes that the memory integral is correlated to its integrand at and has finite support in time i.e.
[TABLE]
where is called the memory length. Examples on application of this formalism for non-linear model reduction of toy problems can be found in [21].
3 The Variational Multiscale Method
We now present a brief overview of the variational multiscale (VMS) method, which was originally formalized by Hughes et al. [9] . Consider the following PDE on an open and bounded domain , where is the dimension of the problem, with a smooth boundary :
[TABLE]
where the operator can be both linear or non-linear, the function and the time varying from . Let, denote the Sobolev space containing square integral functions with square integral derivatives. We define the variational problem as follows:
[TABLE]
find for all , where denotes the inner product. The solution and weighting space are decomposed as follows:
[TABLE]
where represents a direct sum of and . From the perspective of a numerical method, is the resolved finite dimensional space and represents the space of functions which is not resolved. This leads to a decomposition for and :
[TABLE]
[TABLE]
where and . By substituting Equations (20) and (21) into the variational problem given by equation (18) the following is obtained,
[TABLE]
Due to the linear independency of and , equation (22) is separated into the coarse scale and fine-scale equations, respectively:
[TABLE]
[TABLE]
When the coarse-scale Equation (23) is rearranged, the following is obtained,
[TABLE]
The LHS of Equation (25) contains terms present in the standard Galerkin procedure. However, it is also depends on the solution to the fine-scale equation which can be considered as the error in the coarse scale approximation. The goal of VMS sub-grid modelling is to approximate the fine-scale solution using Equation (24) and substitute it in Equation (23). Different closures can be obtained for the fine-scales depending on the type of approximation, especially when the problem is non-linear [14, 15, 16, 17, 18, 19]. However, for linear problems Hughes et al. [9] demonstrated that the fine scale solution is related to the Green’s function of the adjoint operator and the coarse scale residual as follows:
[TABLE]
The simplest approximation to which is given by
[TABLE]
Although, Equation (27) and Equation (26) have been derived for linear problems, the idea that the coarse-scale residual can be linked to the fine-scale solution, remains the basis for developing non-linear VMS models [14, 15, 16, 17, 18, 19] as well.
4 The CG-MZ-VMS Framework
In this section, we combine methods from sections 2 and 3 to derive a coarse grained model. Figure 1 shows two kinds of errors in coarse grain modeling: (i) projection; and (ii) model error. A perfect model will give us the exact projection (green line), based on some optimality condition, of the full order solution on the subspace we are approximating our solution in. For a given set of FE basis functions, the projection error can never be reduced i.e. the high-dimensional full order solution cannot be represented using a small number of FE basis functions. In the present work, we seek to develop a model to accurately predict a low-dimensional projected solution rather than the high-dimensional solution itself. We begin with the governing equation in the domain with the boundary , where is the dimension of the problem as follows,
[TABLE]
where at the boundary and time . The weak form of the above PDE, obtained after integration by parts, can be written as follows,
[TABLE]
where . The Sobolev space of functions and first derivatives are square integrable. The functional space is an infinite dimensional and must be approximated by a finite dimensional approximation . We consider the tessellation of into non-overlapping finite elements. The domain and boundary of an element marked by and respectively. Also consider the following notations:
[TABLE]
[TABLE]
where , denote the interior and boundaries of all the elements respectively. Let denote our finite dimensional FE approximation space containing basis functions having continuity everywhere including element boundaries. Approximating by and by in Equation (29), leads to the standard Galerkin procedure given by
[TABLE]
where . The above method, although directly applicable to diffusion dominated problems, encounters stability issues when applied to convection dominated problems. The VMS procedure provides a solution to this problem by elegantly accounting for the sub-grid scale effects. By splitting the space of the solution and the weighting function , and substituting it into Equation (32), we obtain the following integral equations for the coarse and fine scales, respectively,
[TABLE]
[TABLE]
where and lie in a space orthogonal to and i.e. and . This idea of decomposing the full space into orthogonal spaces has previously been pursued, for instance the Orthogonal Sub-Scale (OSS) method by Codina [15] and Parish and Duraisamy [28, 24]. By substituting the resolved and un-resolved variables in terms of their modal coefficients and their basis function as follows,
[TABLE]
[TABLE]
we get the following ODE systems for modal coefficients of the coarse and fine scales,
[TABLE]
[TABLE]
where the mass matrices for resolved scales and un-resolved orthogonal scales can be written as
[TABLE]
[TABLE]
The RHS of equation By utilizing the Mori-Zwanzig procedure to integrate out variables in Equation (38) from (37), we get the following system:
[TABLE]
where the additional term to the RHS is due to the memory effects. Different ways to model the memory term have been explored in the literature [22, 32, 34, 35, 24, 33]. In the present formulation, we will use the fixed memory model which results in the following simplification:
[TABLE]
where is the memory length. The memory kernel at is given by
[TABLE]
First, we apply on , resulting in the RHS of Equation (37) given by
[TABLE]
Second, we apply the projection to Equation (44) which results in the following expression,
[TABLE]
Third, we apply the Liouville operator to obtain . The effect of application of the Liouville operator to any scalar function results in the Frechet derivative evaluated in the direction of the RHS i.e. . For example, for a scalar function g we have the following:
[TABLE]
Recognising that and applying chain rules we get
[TABLE]
Finally is obtained by linearising w.r.t to and evaluating the result model at RHS of Equation (37) and (38) as follows:
[TABLE]
Finally, we apply the projector which removes the dependence on un-resolved variables and results in
[TABLE]
Equation (49) can be compactly written as,
[TABLE]
where is the orthogonal projector onto the space of the the fine scales i.e,
[TABLE]
An important aspect of the sub-scales is that it is dynamic [15, 14] in nature. When these sub-scales are approximated with the inverse of the spatial operator, the resulting VMS models are non-Markovian [15, 14] and the sub-scales have to be tracked in time. The M-Z formalism on the other hand, precisely integrates out the time dependency of these sub-scales, making the final formulation Markovian on the resolved variables only. To make this formulation computationally tractable, we assume that the memory integral is correlated to its integrand at and has finite support in time. This is the main reason an approximation to the inverse of the differential operator - as is popularly used to derive VMS models - is not required here.
The final form of closure given by Equation (50) is valid for both CG and DG methods. For a simpler derivation in case of smooth orthogonal basis, readers are encouraged to read Appendix A of [27]. As shown by Parish and Duraisamy [27, 28], the main contributing term in Equation (50) to the final closure model in DG is Term 4. However, in this formulation, we assume that the fine-scales vanish at the element boundaries analogous to the concept of bubble functions [36, 37, 38, 39]. This approximation has also been used in the OSS model [15, 14]. By using this approximation, Term 2 and Term 4 in Equation (50) are neglected, resulting in the following equation:
[TABLE]
The scale separation by projection of the residual on the fine scale can be computed as follows,
[TABLE]
where is again the projector on the finite dimensional space spanned by . This concludes the derivation of CG-MZ-VMS framework for the fixed memory type model.
5 Dynamic Memory Estimation
While the constant memory length model provides a closure to the memory term in the M-Z expression, the parameter should adapt to the evolving resolution and not necessarily remain constant. Another approach is to allow the parameter to dynamically vary in time to attempt to represent the variations of the effects of the fine-scale quantities on the coarse scales. To facilitate the stabilization of our method with fewer parameters and account for the temporal variations of the memory length, we seek a dynamic memory length model using the variational counterpart of the Germano’s identity [4, 40, 41, 42]. A similar dynamic procedure has been previously used by Oberai et al. [41] and Akkerman et al. [42] to estimate model coefficients. We begin by applying a zero-variance phase space projector with a fully resolved initial condition with the large-scale equation (Eqn (33)) to obtain an exact solution to the closure problem as following:
[TABLE]
By assuming that the memory term has a finite support we obtain
[TABLE]
Similarly, for a separate coarser mesh with weighting function , where signifies a coarser mesh than , the memory terms can be written as
[TABLE]
We choose such that it spans the weighting function on the coarser mesh i.e. , which results in the following equation:
[TABLE]
where is a matrix which transforms to given by
[TABLE]
If the finer grid is obtained by element wise refinement of the coarse grid, the fine grid basis functions span all the weighting functions on the coarser mesh . By subtracting Equations (56) and (57) we obtain
[TABLE]
To obtain project the
[TABLE]
where is the projector on the coarse grid. Figure 2 shows the projection of a fully-resolved simulation onto and . This is similar to test filtering in the dynamic Smagorinsky model [4] employed in LES. Here, we assume a scaling law similar to the one proposed by Parish and Duraisamy [24] relating the memory lengths at two different levels of coarsening as following
[TABLE]
where and denote the element sizes at the fine and coarse mesh. An important observation is Equation (50) cannot be satisfied for all with a single value of , but is true only in the average sense. To satisfy this condition, three different possibilities are considered here:
Dynamic--AVG: Scale the modes with their respective modal values
[TABLE]
which gives the following final form for the dynamic memory length,
[TABLE] 2. 2.
Dynamic--LS: Solve the overdetermined system based on some optimality condition,
[TABLE]
where L and R are given by
[TABLE]
[TABLE]
The above system can be solved using the least-squares approach which is commonly used with the DSM [4] LES model, resulting in the following expression:
[TABLE] 3. 3.
Dynamic--: Approximate based on the following equation:
[TABLE]
where denotes any kind of norm. In the present work, we have used or Euclidean norm for all our calculations. By using this averaging procedure, we obtain a value of that is (i) always positive; and (ii) free from division errors.
Although the steps involved in derivation of the above formulation closely follow that of the DSM [4, 5], our approach is valid for general PDEs in that the functional form of the model is not chosen based on the underlying physical phenomena. Unlike other traditional LES SGS models such as DSM [4, 6, 5], WALE [3], VREMEN [2], and Sigma [8] which are derived exclusively for the Navier-Stokes equation or other scalar transport equations, our model is not equation specific.
6 One-dimensional viscous Burgers equation
As a first step towards deriving coarse-grained models for the Navier-Stokes equation, we apply our framework to a 1-D non-linear PDE exhibiting multiscale features. To this end, let denote the Sobolev space where our solution and weighting functions exist. The viscous Burgers equation in the domain is given by the following equation:
[TABLE]
with periodic boundary conditions and the time varying from . The weak form of Equation (69) translates into a problem of finding such that
[TABLE]
Using integration by parts we obtain [43],
[TABLE]
where, and (where subscripts 1 and 2 denote adjacent elements sharing a boundary). By utilizing the present coarse graining procedure to Equation 70 we get
[TABLE]
where the memory term is given by,
[TABLE]
and denotes the linearization of the non-linear operator about . Using integration by parts and neglecting the sub-scale contributions at the elemental boundaries we have
[TABLE]
where is the adjoint of the linearized operator . The integrand is computed as follows:
[TABLE]
The resulting closure is very similar to the adjoint stabilization method [12, 9, 20] except is present instead of . Here, denotes the adjoint of the linearized operator and not the operator itself. The adjoint operator is given by
[TABLE]
Substitution of Equation (74) into Equation (72) results in the following problem for the coarse scales :
[TABLE]
Similarly the following coarse grained model can be derived for the linear advection-diffusion equation:
[TABLE]
Equations (77) and (78) are first discretized in time using the family of methods [44]. Equation (77) is then linearized using the standard Picard algorithm.
6.1 Steepening of sine wave
To benchmark our coarse-grained model, the solution to the viscous Burgers equation is computed at for an initial sine profile [17, 28] on a periodic domain of length . To discretize in time, we use the family of methods [44] with (Crank-Nicolson). The simulation parameters for DNS and coarse grained simulations are summarized in Table 1. When sufficient resolution is available (i.e. DNS limit), the viscosity is responsible for dissipating energy at the shock. However, when the resolution is insufficient, sub-grid models are responsible for dissipating the energy. To ensure that the viscous dissipation due to large scales is negligible, viscosity has been set to a small value of . As a consequence, the primary contribution to the total dissipation comes from the sub-grid model.
It can be observed in Figure 3, the coarse-grained model solution approaches the projected DNS. Figures 4 and 5 show the time evolution of resolved KE and its rate of dissipation. These results indicate that the performance of all the models are comparable except the case when no sub-grid model was used or a fixed was used. A comparison between the solutions on the space-time diagram obtained using our dynamic- model, OSS, no-model and projected DNS has been presented in Figure 7. Among our Finite Memory (FM) models, the case with performs the worst, as can be seen in Figures 3, 4 and 5. The solution at improves when is increased to and becomes worse when further increased to , which suggests the existence of an optimum value. The uncertainty in choosing the value of close to its optimum value can be reduced with a dynamic model. To this end, methods described in Section 5 are used to compute dynamically in Figure 6. Results indicate that the Dynamic--AVG, the Dynamic--LS and the Dynamic-- models predict a similar magnitude of for the period of time considered. However, the Dynamic-- model, which ensures positivity of the , was found to be most stable and was used for all the following calculations in the paper. Although it is possible to use Method 1 and Method 2 by clipping above zero, they were found to be unstable for the TGV problem which will be discussed later in Section 7.
At , the Dynamic-- predicts , which supports our argument that an optimum exists in the range of and . The -model which assumes predicts a which does not perform well in this case and becomes unstable. However, as noted by Stinis [45], the t-model needs to be re-normalized with a coefficient for the correct prediction of the memory length i.e. . When renormalization is used, is the correct representative of the memory length with as shown in Figure 6.
6.2 Burgers turbulence
To further assess the performance of our coarse-grained model for turbulence, we use it to study the Burgers turbulence problem [23, 25]. The solution to the Burgers equations exhibits some similarities to realistic turbulence, both having an inertial and a dissipation range [17]. However, the solution to Burgers turbulence is non-chaotic, unlike physically realistic turbulence obtained though the Navier-Stokes equations. To obtain the initial flow field satisfying a given energy spectrum, the following initial condition has been used
[TABLE]
where, the phase is randomly set from and the energy spectra is set to for = 1 to 5 and thereafter. Two different test cases are considered here: (i.) a high viscosity case A with , and , and (ii.) a low viscosity case B with , and . Simulation parameters are summarized in Table 2. The two cases are considered to demonstrate the effect of the sub-grid model on moderately and highly under-resolved simulations respectively.
In the first case, when no sub-grid model is employed, the time variation of resolved kinetic energy is close to the DNS solution. However, for the low viscosity case, a sub-grid model becomes necessary. For comparison, DNS using the Fourier-Galerkin method is performed using 1024 and 4096 modes for case A and case B, respectively. The de-aliasing of the non-linear terms for the Fourier-Galerkin method is conducted by zero-padding (3/2-rule). The LES is conducted using the present coarse grained model with just 32 and 64 linear elements, respectively. For each case, results from the FM model and dynamic- are compared to results obtained without using a sub-grid model, the OSS model and the DNS. For the FM model, different values of are considered in the range where our simulations are stable. Figure 8 and 9 show the time evolution of resolved KE and its rate of dissipation for all these cases. Both these figures indicate that both the dynamic- model and OSS model accurately predict the time-evolution of the resolved kinetic energy in comparison DNS. Figure 10 shows the variation of obtained from our dynamic model which for both case A and B, predict a large variation of in time, suggesting the importance of the adaptive selection of . Figure 11 also shows the energy spectra at the final time. It can be observed for Case A, that all the models perform similarly and the resolved modes are able to capture most of energy. For Case B, the present dynamic- model performs better than other models especially at lower wavenumbers (large scales).
7 Application to the Navier-Stokes Equations
In this section, the coarse grained model is extended to the incompressible Navier-Stokes equations. Let and denote the Sobolev and Lebesque spaces where our solution and weighting functions exist and in general. The weak form of the Navier-Stokes equations consists of finding , such that
[TABLE]
[TABLE]
for all .
We start by assessing how our coarse-grained model stabilizes the forced viscous Burgers equation in higher dimensions. The weak form for the Burgers equations in higher dimensions can be written as
[TABLE]
By applying integration by parts to the viscous term we get
[TABLE]
where is the diffusive flux from adjacent elements sharing a boundary. Equations (82) and (83) can be equivalently written as,
[TABLE]
By decomposing the spaces into and , and applying our finite memory based framework leads to the following formulation for the coarse scales :
[TABLE]
where is our FE approximation space, and and represent the linearizations of and with respect to . The fine-scale variable involving projection of the residuals on the fine-scales is given by
[TABLE]
In the above equation, we assume that the fine-scales vanish at elemental boundaries [36, 37, 38, 39], a thus neglect the second term. The quantity is approximated as follows
[TABLE]
By further simplifying the memory term we obtain the following:
[TABLE]
Where the second term is simplified using the Green’s identity and calculated as follows
[TABLE]
From an implementation perspective, all the above terms are computed using numerical integration at the quadrature points. This results in the following problem for the coarse scales :
[TABLE]
[TABLE]
The role of pressure herein is to impose the divergence free condition on the velocity field. In this formulation, only the velocity sub-scales have been accounted for, and the pressure terms arising from standard Galerkin procedure are retained and treated like a forcing function. This leads to additional stabilization terms to the standard Galerkin procedure given by,
[TABLE]
[TABLE]
Although closure terms were obtained for the momentum equations in Equation (92), the effect of the velocity sub-scales on the continuity equation should also be accounted for. Hence, an approximate form of the velocity sub-scales is required. To this end, consider Equation (85) in a re-arranged form:
[TABLE]
where the operators and are non-linear and linear respectively and is the linearization of about . For small sub-scale [16] approximation, we have,
[TABLE]
Consequently, we can express velocity sub-scales approximately as
[TABLE]
A similar form of sub-scales was also obtained by Wang et al. [17] by writing an asymptotic series in terms of residual [16]. Finally, the effect of the sub-scales on the continuity equation is taken into consideration as follows:
[TABLE]
[TABLE]
By applying integration by parts and using the fact that sub-scales vanish at the elemental boundaries, we have the following formulation for the continuity equation:
[TABLE]
The next step is to discretize the above equation in time using the family of methods. This resulting variational problem at each time step is to find and such that
[TABLE]
[TABLE]
[TABLE]
One way to linearize the above set of non-linear equations is by using Picard iteration based technique given by
[TABLE]
where and denote the present and previous iteration respectively. It can be noted that and are defined differently. This has been done so that and can be merged together. This is possible because is calculated from previous iteration variables. This is similar to Codina’s procedure [15] of adding sub-scales to the convective velocity, and a direct consequence of retaining the non-linearity in the VMS formulation [14]. Defining in this manner allows for an implicit calculation of the memory terms which is similar to the stabilization term in [15, 11, 10, 13] as follows:
[TABLE]
[TABLE]
Equations (102), (103), (104) and (105) are iterated until convergence of the relative norm of the solution vector between two consecutive iterations is achieved.
7.1 Homogeneous Isotropic Turbulence (HIT)
In this section, we present results for decaying homogeneous isotropic turbulence (HIT) and compare it to DNS. We choose the OSS model as a reference, as it has been shown to be a good VMS closure for turbulence [46]. The HIT problem has been extensively studied in literature both numerically [47, 48, 49] and experimentally [50]. This problem is well defined in a 3-D periodic box and the initialization of the initial velocity field for DNS is done using Rogallo’s procedure [51] which assumes the following energy spectrum at initial time:
[TABLE]
where is the wavenumber at which the energy spectra peaks and A is defined as . The velocity in spectral space is given by
[TABLE]
where denotes the magnitude of the wavenumber vector and and are defined as follows:
[TABLE]
where , , are uniformly distributed random numbers from 0 to . In all the simulations, , and . Although, the initial velocity field satisfies the divergence free condition, it does not represent a physical homogeneous isotropic turbulent velocity field. To achieve this state, the field is allowed to decay to a lower where the field will resemble a more realistic velocity field due to redistribution of energy [47]. Three different initial have been considered here: 65, 75 and 164 where is defined as the Reynolds number based on the Taylor microscale as follows:
[TABLE]
where is the velocity fluctuation/root mean square (rms) of the velocity field defined as . The initial conditions for all these cases are generated from DNS simulations by starting at a higher and allowing it to reach our target of 65, 75 and 164 respectively. The kinematic viscosity for the three different cases are set to 0.001, 0.0005 and 0.0001 respectively. The LES simulations utilize linear elements for all the three cases, the results of which are presented in Figures 12,13 and 14 respectively. This allows us to study the effects of increasing by retaining the same resolution.
At a relatively lower Reynolds number of 65, all the models perform fairly well in predicting the time history of the resolved kinetic energy except the fixed memory models where an arbitrary choice of is used. As can be seen from the kinetic energy decay plots in Figures 12(b), 13(b) and 14(b), for all the three different Reynolds numbers, the OSS model is not stable and can be seen to oscillate initially. This indicates that for the initial time period, the OSS model incorrectly forces the turbulence. We compare the energy spectra at two different times of T=2.0 and T=4.0 in Figure 13(c) and 13(d) respectively and observe that all models perform very well at the lower wavenumber modes. However, the OSS is clearly more dissipative at higher wave-numbers where it predicts a lower energy content compared to the present model and DNS. At the higher = 75 case, we find that both the Dynamic- and the OSS model predict reasonably the evolution of kinetic energy and rate of kinetic energy decay. If we compare the energy spectra at T=2.0 in Figure 13(c), all the models predict a higher energy content across different wave-numbers compared to the DNS solution with the dynamic- again performing better at higher wave-numbers again. However, at T=4.0, when it decays to a lower , the performance of all the models improve, as can be seen in Figure 13(d). At the highest case, = 174, we find that the performance of all the model becomes worse compared to the DNS results. The energy spectra for this case in presented is Figure 14(c) where only the lower wavenumber modes are resolved accurately in comparison to DNS. One possible reason for the deterioration of performance at high cases is that the current VMS models are efficient in modeling the cross-stress terms and not the Reynolds stress terms [17] which dominate at higher values.
The time variation of the predicted dynamic memory length for all the three cases is shown in Figure 15. From the plots, it can be observed that the memory length increases almost linearly with time similar to the viscous Burgers equation. This is consistent with Stinis [45] of re-normalizing the t-model for stability and accuracy. Also, the predicted value for by our dynamic model is higher in comparison to the randomly chosen values for our fixed memory model. The differences in the temporal evolution between the dynamically-selected and the imposed is a further indicate that the dynamic model is necessary for calculating the memory length.
7.2 Taylor Green Vortex (TGV)
The next step in understanding the applicability of the proposed method is to employ the model on a turbulent flow that undergoes complex dynamics such the Taylor-Green vortex. This problem involves transition to turbulence-like flow, as well as decay. Models such as the Smagorinsky which have been derived based on assumptions of homogeneity, isotropy and balance between sub-grid production and dissipation [7] might not optimally preform in such flows where there is non-homogenity and transition to turbulence. Similar to HIT, this problem is well-defined on a 3-D periodic box with smooth initial conditions which are given as follows:
[TABLE]
where denote the velocity in and directions respectively and . To study this problem, three different Reynolds numbers are considered: 400, 800 and 1600. The values for and are unity and the Re is changed solely by varying the kinematic viscosity . The initial conditions for the velocity field are kept the same for all the cases.
The profiles for the resolved kinetic energy for 400, 800 and 1600 are shown in Figures 16(a), 17(a) and 18(a) respectively. The evolution of the kinetic energy indicates that both the OSS and Dynamic- perform well with only degrees of freedom. Similar trends are also observed for the rate of KE energy decay for 400, 800 and 1600 in Figures 16(b),17(b) and 18(b) respectively, where the fixed models fail to accurately predict the correct results in comparison to DNS. When and degrees of freedoms are used for 800 and 1600 respectively, there is an overall improvement in the results for the fixed memory model. The present dynamic model and the OSS model perform well at finer resolutions.
Figures 16(c), 17(c) and 18(c), and Figures 16(d), 17(d) and 18(d) show the energy spectra of the resolved velocity fields at two time instants and respectively. At , all the models are in agreement with DNS at the low wavenumber modes even with just degrees of freedom. However, the constant models produces a build-up of energy which grows with at high-wavenumber modes. This suggests that either an incorrect value of is used for the FM models or the assumption of constant memory length throughout the simulation is not very accurate. As a result, model with constant memory length is not capable of producing enough dissipation and the energy increases at the high wavenumber modes. At a later time , a similar trend is also observed with the constant model where energy increases at high-wave numbers. On the other hand, the dynamic -model and OSS do not result in energy increase at high wavenumbers. Although our dynamic model and OSS model perform closely for the cases, at higher resolutions OSS is clearly more dissipative wherein lower energy is present at high wavenumber especially for the high Reynolds number case. In spite of the OSS model and the dynamic- model performing closely, the stabilization parameter in OSS and the memory length in dynamic- is computed differently.
8 Conclusion
The Variational Multiscale method and the Mori-Zwanzig formalism are combined within the Continuous Galerkin method to develop coarse grained models for multiscale PDEs. This approach utilizes the Variational Multiscale method to separate scales with the capability of the Mori-Zwanzig formalism to represent the impact of unresolved dynamics on the resolved dynamics. This approach - in a similar spirit to existing non-linear VMS models [14, 15, 16, 17, 18, 19] - is developed to provide sub-grid scale models without phenomenological assumptions. This procedure is generalizable and can potentially be applied to arbitrarily complex non-linear multiscale PDEs. In context of turbulent flows, this approach provides a general framework for large-eddy simulation that eschews assumptions such as those based on energy balance between scale. Sub-grid scale models are developed for the Burgers equation and the Navier-Stokes using the proposed approach. The sub-grid scale models include a parameter called the memory length, , which represents the the time correlation of unresolved dynamics, and controls the stabilization. We impose different memory lengths and observe that there is an optimum memory length which provides results comparable to the full order solution [28]. To avoid the imposition of an adhoc memory length, and recognizing that the model should adapt to the instantaneous level of resolution, we derived a dynamic- model and found that it can accurately predict the temporal evolution of . The predicted value of was observed to be generally linear in time, as conceptualized by the renormalized t-model [45]. In general, for the range of problems that were investigated, the proposed technique performs favorably in comparison to existing counterparts.
This work was focused on fixed memory type models leading to Markovian closures, however, other approaches leading to non-Markovian type closures can be implemented [28]. Alternatively, different approximations to the orthogonal dynamics [33, 25] can be used to construct models. The single memory length model was - in part - successful because of the nature of the problems investigated herein. Future extensions to highly anisotropic and inhomogeneous problems will require the development of local definitions for the memory length.
Acknowledgement
This research was funded by the AFOSR under the project LES Modeling of Non-local effects using Statistical Coarse-graining, grant number FA9550-16-1-0309. The authors also thank Dr. Eric Parish for providing DNS results for comparison for the HIT and TGV cases, and Dr. Daniel Foti for his valuable suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Smagorinsky [1963] J. Smagorinsky, General circulation experiments with the primitive equations: I. the basic experiment, Monthly weather review 91 (1963) 99–164.
- 2Vreman [2004] A. Vreman, An eddy-viscosity subgrid-scale model for turbulent shear flow: Algebraic theory and applications, Physics of fluids 16 (2004) 3670–3681.
- 3Nicoud and Ducros [1999] F. Nicoud, F. Ducros, Subgrid-scale stress modelling based on the square of the velocity gradient tensor, Flow, turbulence and Combustion 62 (1999) 183–200.
- 4Germano et al. [1991] M. Germano, U. Piomelli, P. Moin, W. H. Cabot, A dynamic subgrid-scale eddy viscosity model, Physics of Fluids A: Fluid Dynamics 3 (1991) 1760–1765.
- 5Meneveau et al. [1996] C. Meneveau, T. S. Lund, W. H. Cabot, A lagrangian dynamic subgrid-scale model of turbulence, Journal of fluid mechanics 319 (1996) 353–385.
- 6You and Moin [2007] D. You, P. Moin, A dynamic global-coefficient subgrid-scale eddy-viscosity model for large-eddy simulation in complex geometries, Physics of Fluids 19 (2007) 065110.
- 7Pope and Pope [2000] S. B. Pope, S. B. Pope, Turbulent flows, Cambridge university press, 2000.
- 8Nicoud et al. [2011] F. Nicoud, H. B. Toda, O. Cabrit, S. Bose, J. Lee, Using singular values to build a subgrid-scale model for large eddy simulations, Physics of Fluids 23 (2011) 085106.
