A Modular Regularized Variational Multiscale Proper Orthogonal Decomposition for Incompressible Flows
Fatma G. Eroglu, Songul Kaya, Leo G. Rebholz

TL;DR
This paper introduces a modular, post-processing VMS-POD method for incompressible flows, enabling easier implementation and independent stabilization tuning, supported by theoretical analysis and numerical validation.
Contribution
It presents a novel decoupled, post-processing VMS stabilization integrated with POD for Navier-Stokes equations, enhancing flexibility and effectiveness.
Findings
The method effectively stabilizes simulations of incompressible flows.
Numerical tests confirm the theoretical properties and improved accuracy.
The approach is easily incorporated into existing computational frameworks.
Abstract
In this paper, we propose, analyze and test a post-processing implementation of a projection-based variational multiscale (VMS) method with proper orthogonal decomposition (POD) for the incompressible Navier-Stokes equations. The projection-based VMS stabilization is added as a separate post-processing step to the standard POD approximation, and since the stabilization step is completely decoupled, the method can easily be incorporated into existing codes, and stabilization parameters can be tuned independent from the time evolution step. We present a theoretical analysis of the method, and give results for several numerical tests on benchmark problems which both illustrate the theory and show the proposed method's effectiveness.
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16
Figure 17
Figure 18| rate | rate | ||||||
|---|---|---|---|---|---|---|---|
| 12 | 3 | 18.1675 | 0.002 | 0.0294 | - | 1.4060 | - |
| 12 | 5 | 10.4747 | 0.002 | 0.0158 | 1.13 | 1.0639 | 0.51 |
| 12 | 7 | 4.7609 | 0.002 | 0.0076 | 0.93 | 0.7039 | 0.52 |
| 12 | 9 | 2.6534 | 0.002 | 0.0034 | 1.37 | 0.6131 | 0.24 |
| 12 | 11 | 1.2920 | 0.002 | 0.0090 | -1.35 | 0.7580 | -0.29 |
| rate | rate | |||||
|---|---|---|---|---|---|---|
| 16 | 14 | 0.032 | 0.4343 | - | 15.6394 | - |
| 16 | 14 | 0.016 | 0.3587 | 0.2759 | 10.8125 | 0.5325 |
| 16 | 14 | 0.008 | 0.1296 | 1.4687 | 4.5266 | 1.2562 |
| 16 | 14 | 0.004 | 0.0267 | 2.2792 | 1.0657 | 2.0866 |
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.
Stokes with variable viscosity
Fatma G. Eroglu Department of Mathematics, Middle East Technical University, 06800 Ankara, Turkey; [email protected]
Songul Kaya
Department of Mathematics, Middle East Technical University, 06800 Ankara, Turkey; [email protected]
Leo G. Rebholz Department of Mathematical Sciences, Clemson University, Clemson, SC, 29634; [email protected]; Partially supported by NSF DMS1522191 and U.S. Army Grant 65294-MA.
A Modular Regularized Variational Multiscale Proper Orthogonal Decomposition for Incompressible Flows
Fatma G. Eroglu Department of Mathematics, Middle East Technical University, 06800 Ankara, Turkey; [email protected]
Songul Kaya
Department of Mathematics, Middle East Technical University, 06800 Ankara, Turkey; [email protected]
Leo G. Rebholz Department of Mathematical Sciences, Clemson University, Clemson, SC, 29634; [email protected]; Partially supported by NSF DMS1522191 and U.S. Army Grant 65294-MA.
Abstract
In this paper, we propose, analyze and test a post-processing implementation of a projection-based variational multiscale (VMS) method with proper orthogonal decomposition (POD) for the incompressible Navier-Stokes equations. The projection-based VMS stabilization is added as a separate post-processing step to the standard POD approximation, and since the stabilization step is completely decoupled, the method can easily be incorporated into existing codes, and stabilization parameters can be tuned independent from the time evolution step. We present a theoretical analysis of the method, and give results for several numerical tests on benchmark problems which both illustrate the theory and show the proposed method’s effectiveness.
Keywords: proper orthogonal decomposition, projection-based variational multiscale, reduced order models, post-processing
1 Introduction
We consider the incompressible Navier-Stokes equations (NSE) on a polyhedral domain with boundary :
[TABLE]
Here, is the fluid velocity and the fluid pressure. The parameters in (1.1) are the kinematic viscosity , the prescribed body forces and the initial velocity field .
It is known that due to the wide range of scales in many complex fluid flows, simulating these flows by a direct numerical simulation (DNS) can be very expensive, and sometimes is even infeasible. In particular, in the engineering design process, flow simulations must be run many times, e.g. to perform parameter studies or for system control purposes; this multiplies the DNS cost by at least several times. The concept of reduced order models was introduced as a way of lowering the computational complexity in such settings. The proper orthogonal decomposition (POD) approach has proven to be quite successful for generating reduced order models [28, 30, 29] that capture many (sometimes most) of the dominant flow features, and has been applied in many areas such as image processing, pattern recognition, unsteady aerodynamic applications etc., see e.g. [2, 5, 6]. POD reduces the complexity of systems, often by orders of magnitude, by representing it with only its most energetic structures.
However, it is well known that for certain problems, and incompressible NSE in particular, a POD by itself can perform quite poorly without some sort of numerical stabilization [1, 10]. One type of stabilization that has been successful in this endeavor is the combining of POD with the variational multiscale (VMS) method. VMS was introduced in [9] in a variational setting, and it (and its variants) have been studied extensively in finite element frameworks [8, 18, 12, 13, 14]. Using VMS in POD was pioneered in [10, 11, 26], and their studies showed this could increased numerical accuracy for convection-dominated convection-diffusion equations [11] and for NSE [10, 26]. Furthermore, in [11], an analysis was performed that showed optimal error bounds could be obtained (in terms of mesh width, time step size, and eigenvalues and eigenvectors removed from the system) for convection-diffusion-reaction VMS-POD systems.
The main objective of this report is to extend the novel ideas of [21] to the POD setting, in particular to create a VMS-POD where stabilization is added as a completely decoupled second step, in a time stepping scheme for incompressible flow simulation. That is, at each step there is a two step procedure at each time step: step 1 evolves with a standard POD (i.e. unstabilized Galerkin POD), and then the second step is a weighted POD projection that adds (in a sense) extra viscosity to the lower POD modes (hence the method can be easily incorporated into a standard Galerkin POD code). We formally introduce the method in section 3 (after giving necessary notation and preliminaries in section 2), and prove it is stable and optimally convergent (in terms of the mesh width, time step size, and removed POD modes/eigenvalues). In section 4 we provide extensive numerical results that illustrate the effectiveness of the method. Finally, conclusions are given in section 5.
2 Preliminaries and Notations
We assume that is a polygonal or polyhedral domain, with boundary . Throughout the paper standard notations for Sobolev spaces and their norms will be used. The norm in is denoted by and the norms in Lebesgue spaces , , by . The space is equipped with the norm and inner product and , respectively.
The continuous velocity and pressure spaces are denoted by and , and we denote the dual space of by with norm
[TABLE]
We use the following notation for discrete norms, for , n=0,1,2,…,M:
[TABLE]
The variational formulation of (1.1) reads as follows: Find satisfying
[TABLE]
with and
[TABLE]
is the skew-symmetric form of the convective term.
The following properties for the skew symmetric form are well known [7, 19].
Lemma 2.1**.**
The trilinear skew-symmetric form satisfies
[TABLE]
This paper considers a conforming finite element method for (2.1), with spaces and satisfying the inf-sup condition: there is a constant independent of the mesh size such that
[TABLE]
It will also be assumed for simplicity that the finite element spaces and are composed of piecewise polynomials of degrees at most and , respectively (the analysis can be extended without significant difficulty to any inf-sup stable pair). In addition, we assume that the spaces satisfy the following approximation properties
[TABLE]
for and .
We denote the discretely divergence free space by
[TABLE]
The inf-sup condition (2.2) implies that the space is closed subspace of and the formulation in is equivalent to . Thus, the Galerkin finite element approximation of (2.1) in has the following form: Find satisfying
[TABLE]
@fb@secFB
2.1 POD preliminaries
In this section the essentials of the POD are described. For a more detailed description of the method, see e.g. [23]. With the same notation of [10], consider the finite number of the time instances,
[TABLE]
at time , and let , where . In what follows, these time instances will be assumed to come from a DNS computed with a finite element spatial discretization. That is, we replace with DNS computed solution .
Let be the low-dimensional ordered POD basis functions to approximate these time instances. The low-dimensional space is obtained by solving the minimization problem of
[TABLE]
such that , and . The solution of the problem (2.7) yields
[TABLE]
where is the component of the eigenvector corresponding to which is the eigenvalue of the snapshots correlation matrix. We note that all eigenvalues are sorted in descending orders. Thus, the basis functions correspond to the first largest eigenvalues. Moreover, the error estimation satisfies (see [16]):
[TABLE]
Let be the POD-space, then POD-Galerkin (POD-G) formulation of the NSE is : Find satisfying
[TABLE]
Note that the POD-G solution of the NSE is constructed by writing,
[TABLE]
where are time varying coefficients.
To carry out the error analysis, we state the following error estimations without their proofs. Let and denote the POD mass matrix and stiffness matrix, respectively, with
[TABLE]
Note that, since we use to generate snapshots, .
Our analysis will utilize the following POD inequalities, proven in [16]: for all ,
[TABLE]
where denotes the matrix -norm.
The results of the following lemmas will be applied to bound the POD projection error. The proofs can be found in [10].
Lemma 2.2**.**
The error in POD projection for the snapshots , satisfies
[TABLE]
The proof of the finite element error estimate consists of the splitting the error into an approximation term and a finite element remainder term. To decompose the error term we use the projection of , which fulfills certain interpolation estimates. Lemma 2.3 estimates the error between the snapshots and their projection into .
Let denote a projection operator that satisfies
[TABLE]
Lemma 2.3**.**
For the true NSE solution at time , the difference satisfies
[TABLE]
Proof.
This follows from the projection error estimate from [10] along with the triangle inequality, after adding and subtracting the FEM-DNS snapshots to the true solution (at corresponding times). ∎
Assumption: We make the assumption that
[TABLE]
This assumption essentially says that the projection error the true solution is of the same order of magnitude at most of the time steps. It is possible the assumption may not hold (in which case the on the right hand side with become ) in diabolical cases where the true NSE solution lives in the ROM space at most of the times . The assumption is common in error analysis for POD type methods [10, 31].
In the projection-based VMS method, besides the standard finite element spaces representing all resolved scales an additional large resolved scale is needed. For VMS-POD setting, the following spaces are used for :
[TABLE]
Note that from the construction, we have .
The orthogonal projection will be needed in the VMS formulation, and is defined by
[TABLE]
3 Post-Processed VMS-POD Schemes
This section proposes fully discrete VMS-POD methods for solving (2.10). For simplicity, in section 3.1, we analyze the backward Euler temporal discretization. In section 3.2, extension to BDF2 time stepping is considered. In our analysis, we assume that the eddy viscosity coefficient is known bounded, positive and element-wise constant. The results of this report can be extended in the case is nonconstant even nonlinear. The consideration of a nonlinear requires more complex mathematical theory due to the strong monocity, see [17].
In that analysis that follows, we denote variables at time using superscripts, e.g. .
@fb@secFB
3.1 Backward Euler
The two step VMS-POD scheme equipped with backward Euler time stepping reads as follows:
Algorithm 3.1**.**
Let and be given with projection of in . Given compute by applying the following two steps:
Step 1.* Calculate satisfying ,*
[TABLE]
Step 2.* Post-process by applying projection to obtain , :*
[TABLE]
We note that Step 1 is the standard Galerkin POD method, and step 2 is completely decoupled VMS stabilization step. The projection in Step 2 is not a filter but constructed to recover VMS eddy viscosity term as in [21].
Note that if we let in (3.2), the numerical dissipation induced from Step 2 is immediately seen to be
[TABLE]
3.1.1 Stability of Algorithm 3.1
We now prove stability of Algorithm 3.1.
Lemma 3.1**.**
The post-processed-VMS-POD approximation is unconditionally stable in the following sense: for any ,
[TABLE]
Proof.
Letting in (3.1) and using the polarization identity yields
[TABLE]
Substitute (3.3) in (3.4) and multiply both sides by , which provides
[TABLE]
Bounding the forcing term in the usual way, and then summing over the time steps gives the stated result. ∎
The result of Lemma 3.1 also establishes the stability of .
Corollary 3.1**.**
(Stability of )
[TABLE]
Proof.
Expand the summation in Lemma 3.1 for and use (3.3). ∎
3.1.2 A Priori Error Estimation
In this section, we present the error analysis of the true solution of Navier Stokes equations and POD approximation (3.1)-(3.2). The optimal asymptotic error estimation requires the following regularity assumptions for the true solution:
[TABLE]
Theorem 3.1**.**
Suppose (3.7) holds and and given by Algorithm (3.1)-(3.2). For sufficiently small , i.e. we have the following estimation:
[TABLE]
where is independent from and .
Remark 3.1**.**
Under the assumptions of Theorem 3.1 and the finite element spaces with piecewise polynomials of degree and , respectively. We obtain the following asymptotic error estimation:
[TABLE]
Proof.
We begin the proof by deriving error equations. From (2.1), we have that true solution at time level satisfies, for ,
[TABLE]
where
[TABLE]
We define the following notations:
[TABLE]
where is projection of in .
Subtracting (3.1) from (3.8) yields
[TABLE]
Substitute and with in the last equation we obtain
[TABLE]
From the definition of projection (2.13), we note that and . Using this along with the polarization identity and that , we obtain the bound
[TABLE]
The first term on the right hand side of (3.10), and the pressure term, can be bounded using Cauchy-Schwarz and Young’s inequalities,
[TABLE]
For the nonlinear terms, first add and subtract terms to get
[TABLE]
Now using Lemma 2.1, Young’s and Poincaré’s inequalities, the terms in (3.13) are estimated as follows:
[TABLE]
The consistency error in (3.10) is estimated by
[TABLE]
Collecting all bounds for the right hand side terms of (3.10) and multiplying both sides by gives
[TABLE]
We next get a bound for . Write (3.2) by adding and subtracting the true solution projection on both sides to get
[TABLE]
and then choose in (3.16) to obtain
[TABLE]
Noting and inserting (3.17) into (3.15) results into
[TABLE]
Assume now \Delta t\leq\dfrac{1}{8C}\Big{[}\frac{\|\nabla{\bf u}\|^{4}}{\nu^{3}}\Big{]}^{-1}. Then, we can bound the remaining right hand terms of (3.18) as follows :
[TABLE]
Similarly, using the preceding bound and Young’s inequality we get
[TABLE]
and
[TABLE]
Substitute the bounds (3.1.2)-(3.20) into (3.18) and sum from to . This gives
[TABLE]
Note that since , the first right hand side term in (3.21) vanishes. The second right hand side term is majorized using Lemma 2.3, as
[TABLE]
Third term is bounded by using (2.17) as follows,
[TABLE]
To bound the fourth term, one can proceed as follows. Using along with Lemma 2.3 leads to
[TABLE]
For the first term on the right-hand side of (3.24), we use (2.19) to find that
[TABLE]
where is the large scale representation of the projection. Now using Lemma 2.3, the final estimation for (3.24) becomes
[TABLE]
Corollary 3.1, the stability of and (2.17) provide an estimation for the fifth term in the right-hand side of (3.21):
[TABLE]
The estimation of sixth term in the right hand side of (3.21) uses approximation property (2.4) to find
[TABLE]
Finally, for the last term in the right hand side of (3.21), Taylor series expansion with remainder in integral form is used along with Cauchy Schwarz and the triangle inequality to obtain
[TABLE]
Collecting all the bounds (3.22)-(3.29) for (3.21) yields
[TABLE]
Again using the assumption that \Delta t\leq\frac{1}{8C}\bigg{[}\nu^{-3}{|||\nabla{\bf u}|||_{\infty,0}^{4}}\bigg{]}^{-1} allows us to apply the discrete Gronwall inequality, which yields
[TABLE]
Finally, the triangle inequality is applied to produce the stated result. ∎
@fb@secFB
3.2 Extension to second order time stepping
We consider now an extension of Algorithm 3.1 to BDF2 time stepping.
Algorithm 3.2**.**
*Let and initial conditions and be given in . Then for n=0,1,2,…
Step 1. Calculate satisfying ,*
[TABLE]
Step 2.* Post-process to obtain satisfying ,*
[TABLE]
We note the post-processing step is exactly the same as in the backward Euler case. Also as in the case of the backward Euler method above, without Step 2, Algorithm 3.2 reduces to the classical Galerkin POD formulation for the NSE, although now using BDF2 time stepping.
We now prove stability of Algorithm 3.2. A convergence result can be obtained by combining the ideas of Algorithm 3.1’s convergence proof with the stability proof below. Such a proof is thus long and technical, but produces the expected result (i.e. same convergence as Algorithm 3.1, but second order in instead of first order). This expected second order temporal convergence is illustrated in the numerical experiments section below.
Lemma 3.2**.**
The post-processed VMS-POD approximation is stable for the eddy viscosity term in the following sense:
[TABLE]
Proof.
Note that if we let in Step 2, the numerical dissipation induced from Step 2 is given by
[TABLE]
Letting in (3.30) and using the identity
[TABLE]
yields
[TABLE]
Substitute (3.32) in (3.33), multiply both sides by , add to both sides, and then apply the Cauchy-Schwarz inequality to get
[TABLE]
We now consider the term in (3.34) . By using the properties of inner product, the equality (3.32) and rearranging terms gives
[TABLE]
Inserting (3.35) in (3.34) and applying Cauchy-Schwarz and Young’s inequalities gives
[TABLE]
Adding and subtracting terms for the last term in the previous inequality with the use of , we get
[TABLE]
Summing over the time step gives
[TABLE]
With the assumption and , we obtain the stated result. ∎
4 Numerical Studies
This section gives results for three numerical experiments. In all cases we use Algorithm 3.2, i.e. the scheme with second order time stepping. Our first test considers the predicted convergence rates of the previous section, with respect to varying and . For the second test, we compare accuracy of the proposed VMS-POD scheme compared with the usual Galerkin POD method (i.e. unstabilized POD, computed by eliminating the post-processing step of the VMS-POD) in 2D channel flow past a cylinder. Finally we consider the VMS-POD for a 3D turbulent channel flow simulation.
Our first two numerical tests use the test problem of 2D channel flow past a cylinder. Here, the domain is a rectangle with a circle radius centered at (see figure 1). The test problem uses no slip boundary conditions for the walls and cylinder, and the time dependent inflow and outflow profiles are given by
[TABLE]
The kinematic viscosity , and there is no forcing (). The POD is created as described in section 2, by taking snapshots from a BDF2-finite element DNS simulation using Taylor-Hood elements, after a periodic-in-time solution is reached (a more detailed description of the setup is given in [4]). The tests with the cylinder problem use the projection of the T=7 DNS solution as the initial condition, and run for time units.
@fb@secFB
4.1 Numerical test 1: Convergence in and
We now test the predicted convergence rates of the previous section. This is a particularly difficult task for this problem, as the parameters are the spatial mesh width , time step , POD cutoff , and VMS cutoff . We assume the spatial mesh width is sufficiently small so that this error source is negligible. Our particular interest here is the scaling of the error with the VMS cutoff and with the time step size . Due to having several parameters, to see convergence with respect to a particular parameter, it must be part of the dominant error source. Hence in our tests, different parameter choices are made to see the various scalings.
To test the scaling of the error with , we fix , , , and compute with varying . The error estimates are depend on via the term , as well as , and our interest is the scaling with . We note that for sufficiently large , the term can become sufficiently large so that it becomes a dominant error source. Results for this test are shown in table 1, and we observe the expected convergence rate of approximately in the norm, and seemingly a higher rate in . However, for larger , we see a deterioration of the rate, and by , the error increases (which is expected, due to increase in with ).
To test the scaling with respect to , we fix , , and vary . Errors and rates are given in table 2, and we observe rates consistent with second order.
@fb@secFB
4.2 Numerical test 2: Error comparison of VMS-POD versus POD-G for 2D channel flow past a cylinder
We now consider error comparison of the VMS-POD again the standard POD-G method. The statistics of interest are the maximal drag and the maximal lift coefficients at the cylinder. The reference intervals are given for and in [27],
[TABLE]
and recent computations of [4], as well as our DNS that created the snapshots, are in agreement with these numbers.
We compute with modes, and find that the POD-G method is not good, and in particular we observe in figure 2 that the energy is growing (seemingly) linearly with time. But , a significant increase in energy has occurred, leading to very inaccurate lift and drag predictions as well.
The VMS-POD does a much better job with prediction of energy, lift and drag, however. Shown in figure 2 is the energy, lift and drag with (and was found to be optimal to within , in terms of matching the DNS energy at ). We note that with POD, such a parameter optimization is quite cheap. Hence this is an excellent example of how the post-processing step of VMS-POD can remove the nonphysical energy growth that occurs with POD-G, and provide good reduced order solutions.
@fb@secFB
4.3 Numerical test 3: VMS-POD for =395 turbulent channel flow
For our last test, we consider the proposed VMS-POD for a benchmark turbulent channel flow problem at [22, 15]. The domain , and for boundary conditions, no slip is enforced on the top and bottom walls and , and periodic boundary conditions are enforced the remaining sides. The kinematic viscosity is taken to be , and the flow is forced in the -direction via , and is also dynamically adjusted at each time step as in [15] to maintain the bulk velocity. We compute snapshots using the rNS- model and scheme from [24, 25], by saving snapshots at each time step () of the simulation from to , and then create the POD basis as described in section 2. Plots of some of the POD basis functions are displayed in figure 3. We construct the reduced order model using modes, and will test the ability of the VMS-POD to give stable solutions. We note that even though the snapshots were created with a turbulence model, we use the VMS-POD in the same form as above (i.e. step 1 is NSE, not the turbulence model).
Turbulent channel flow is well known to be a challenging numerical problem which causes many codes to fail and/or give poor solutions. Underresolved simulations suffer from a nonphysical accumulation of energy near the smallest resolved scales. In time, this accumulation of energy creates spurious oscillations, inaccuracies, and instability, often causing simulations to fail [20, 3]. Thus, we test here the ability of the VMS-POD to produce a stable solution. We use the projections of the and turbulence model solutions as the initial conditions, and run the reduced order models for 5 time units.
We first test the usual POD-G, without any stabilization (i.e. ). Energy versus time is shown for this simulation in figure 4, and we observe that there is an energy blowup. The instability occurs around , and then the energy grows exponentially.
We now test the VMS-POD with the , and using , , and ( is the largest for which we could get stable energy up to ). Plots for energy versus time and mean streamwise velocity (average taken in both periodic directions and in time) are shown in figures 5-7 for these choices of , and for each we test with several values of . The main observation we make from these results is that with sufficient stabilization using and , the VMS-POD is able to produce energy stable solutions whose mean streamwise velocity profile matches the DNS values of Moser et al [22] (we note that the first mode also matches this mean streamwise profile as well). For smaller values of , smaller values of can be sufficient to obtain energy stable solutions.
5 Conclusion
We proposed, analyzed and tested a VMS-POD method for incompressible NSE simulation, where the stabilization is completely decoupled into the second step of a two step implementation at each time step. Decoupling of the stabilization has the advantage of easily being incorporated into existing POD-G codes, and also that stabilization parameters can be adjusted only in the stabilization step (and not as part of the evolution equation). We rigorously prove an error estimate for the model, in terms of the number of POD modes , the stabilization parameters (number of modes not to add stabilization to) and , as well as the time step size and the mesh width of the underlying FEM simulation that produced the POD modes.
Results from several numerical experiments are provided that show how effective the method can be. In particular, we show for 2D channel flow past a step, POD-G has an energy growth that causes poor lift and drag prediction, especially for longer times. The proposed VMS-POD is able to fix this by stabilizing so that the energy matches the DNS energy, which in turn leads to excellent lift and drag prediction, even up to (and from the plots, it appear the accurate predictions can continue for even longer time). Finally, we tested the ability of the VMS-POD to produce stable solutions for turbulent channel flow. With modes, POD-G quickly becomes unstable, however the VMS-POD is able to produce simulations with stable energy and that yield accurate mean streamwise velocity profiles.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] N. Aubry, W-Y. Lian, and E.S. Titi, Preserving symmetries in the proper orthogonal decomposition , SISSC 14 (1993), 483–505.
- 2[2] G. Berkooz, P. Holmes, and J. Lumley, The proper orthogonal decomposition in the analysis of turbulent flows , Annual Review of Fluid Mechanics 25 (1993), 539–575.
- 3[3] L. Berselli, T. Illiescu, and W. Layton, Mathematics of large eddy simulation of turbulent flows , Springer, 2005.
- 4[4] A. Caiazzo, T. Iliescu, V. John, and S. Schyschlowa, A numerical investigation of velocity-pressure reduced order models for incompressible flows , J. Comput. Phys. 259 (2014), 598–616.
- 5[5] A. Chatterjee, An introduction to the proper orthogonal decomposition , Current Science 78 (2000), 808 817.
- 6[6] L. Cordier and M. Bergmann, Proper orthogonal decomposition: an overview , Post Processing of Experimental and Numerical Data Lecture Series 2003/2004 (2003), 1–45.
- 7[7] V. Girault and P. A. Raviart, Finite element approximation of the Navier-Stokes equations , Lecture Notes in Mathematics 749, Springer-Verlag, Berlin, 1979.
- 8[8] J.-L. Guermond, Stabilization of Galerkin approximations of transport equations by subgrid modeling , M 2AN 33 (1999), 1293 – 1316.
