Numerical Analysis of the Leray Reduced Order Model
Xuping Xie, David Wells, Zhu Wang, Traian Iliescu

TL;DR
This paper provides a detailed numerical analysis of the Leray Reduced Order Model, including error estimates for its filtering process and overall accuracy in simulating 2D Navier-Stokes equations, addressing oscillation issues in convection-dominated flows.
Contribution
It introduces rigorous error estimates for the Leray ROM's filtering and overall performance, supported by numerical experiments, advancing the understanding of regularized ROMs.
Findings
Error estimates for the ROM differential filter are established.
Error bounds for the Leray ROM are derived and validated.
Numerical experiments confirm the theoretical error estimates.
Abstract
Standard ROMs generally yield spurious numerical oscillations in the simulation of convection-dominated flows. Regularized ROMs use explicit ROM spatial filtering to decrease these spurious numerical oscillations. The Leray ROM is a recently introduced regularized ROM that utilizes explicit ROM spatial filtering of the convective term in the Navier-Stokes equations. This paper presents the numerical analysis of the finite element discretization of the Leray ROM. Error estimates for the ROM differential filter, which is the explicit ROM spatial filter used in the Leray ROM, are proved. These ROM filtering error estimates are then used to prove error estimates for the Leray ROM. Finally, both the ROM filtering error estimates and the Leray ROM error estimates are numerically investigated in the simulation of the two-dimensional Navier-Stokes equations with an analytic solution.
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| 30 | |||
| 40 | |||
| 50 | |||
| 60 | |||
| 70 | |||
| 80 |
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.
Taxonomy
TopicsModel Reduction and Neural Networks · Fluid Dynamics and Vibration Analysis · Computational Fluid Dynamics and Aerodynamics
Numerical Analysis of the Leray Reduced Order Model
Xuping Xie
David Wells
Zhu Wang
Traian Iliescu
Department of Mathematics, Virginia Tech, Blacksburg, VA 24061, U.S.A.
Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180, U.S.A.
Department of Mathematics, University of South Carolina, Columbia, SC 29208, U.S.A.
Abstract
Standard ROMs generally yield spurious numerical oscillations in the simulation of convection-dominated flows. Regularized ROMs use explicit ROM spatial filtering to decrease these spurious numerical oscillations. The Leray ROM is a recently introduced regularized ROM that utilizes explicit ROM spatial filtering of the convective term in the Navier-Stokes equations.
This paper presents the numerical analysis of the finite element discretization of the Leray ROM. Error estimates for the ROM differential filter, which is the explicit ROM spatial filter used in the Leray ROM, are proved. These ROM filtering error estimates are then used to prove error estimates for the Leray ROM. Finally, both the ROM filtering error estimates and the Leray ROM error estimates are numerically investigated in the simulation of the two-dimensional Navier-Stokes equations with an analytic solution.
keywords:
Reduced order model , proper orthogonal decomposition , regularized model , Leray model , spatial filter.
††journal: J. Comput. Appl. Math.
url]http://www.math.vt.edu/people/xupingxy
url]http://homepages.rpi.edu/ wellsd2
url]http://people.math.sc.edu/wangzhu
url]http://www.math.vt.edu/people/iliescu
1 Introduction
Reduced order models (ROMs) have been successfully used in the numerical simulation of structure-dominated fluid flows (see, e.g., [3, 4, 7, 8, 10, 17, 19, 20, 21, 23, 27, 37, 39, 40, 42]). Since they use a small number of carefully chosen basis functions (modes), ROMs can represent a computationally efficient alternative to standard numerical discretizations. For convection-dominated flows, however, standard ROMs generally yield inaccurate results, usually in the form of spurious numerical oscillations (see, e.g., [18, 46]). To mitigate these ROM inaccuracies, several numerical stabilization techniques have been proposed over the years (see, e.g., [1, 2, 6, 28, 38, 46, 45]). Regularized ROMs (Reg-ROMs) are recently proposed stabilized ROMs for the numerical simulation of convection-dominated flows [24, 41, 47]. These Reg-ROMs use explicit ROM spatial filtering to smooth various ROM terms and thus increase the numerical stability of the resulting ROM. This idea goes back to the great Jean Leray [35], who used it in the mathematical study of the Navier-Stokes equations (NSE). In standard CFD, this idea was used to develop regularized models for the numerical simulation of turbulent flows [16, 34]). In a ROM setting, a Reg-ROM was first used in [41] in the numerical simulation of the 1D Kuramoto-Sivashinsky equations. A different Reg-ROM was proposed in [47] for the numerical simulation of the 3D NSE. Reg-ROMs were also employed for the stabilization of ROMs in the numerical simulation of a stochastic Burgers equation [24].
Reg-ROMs were successful in the numerical simulation of convection-dominated flows. Two Reg-ROMs (the Leray ROM and the evolve-then-filter ROM) were used in the numerical simulation of a 3D flow past a circular cylinder at a Reynolds number [47]. These two Reg-ROMs produced accurate results in which the spurious numerical oscillations of standard ROMs were significantly decreased. Despite the Reg-ROMs’ success, to our knowledge there is no numerical analysis of the Reg-ROMs and the explicit ROM spatial filter used in their development. In this paper, we take a first step in this direction and prove error estimates for the finite element discretization of (i) the Leray ROM [24, 41, 47], which is a Reg-ROM; and (ii) the ROM differential filter, which is an explicit ROM spatial filter.
The rest of the paper is organized as follows: In Section 2, we present some notation and preliminaries. In Section 3, we present the ROM differential filter and the Leray ROM. In Section 4, we prove error estimates for the ROM differential filter and the Leray ROM. In Section 5, we verify numerically the error estimates proved in Section 4. Finally, in Section 6, we draw conclusions and outline possible future research directions.
2 Notation and Preliminaries
We consider the numerical solution of the incompressible Navier-Stokes equations (NSE):
[TABLE]
where and represent the fluid velocity and pressure of a flow in the region , respectively, for , , and with or ; the flow is bounded by walls and driven by the force ; is the reciprocal of the Reynolds number; and denotes the initial velocity. We also assume that the boundary of the domain, , is polygonal when and is polyhedral when .
The following functional spaces and notations will be used in the paper:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where and are the finite element (FE) spaces of the velocity and pressure, respectively, and is the quasi-uniform mesh size. We consider the div-stable pair of FE spaces [33]. We emphasize, however, that our analysis extends to more general FE spaces.
Let be a real Hilbert space endowed with inner product and norm . Let the trilinear form be defined as
[TABLE]
Lemma 2.1** (see Lemma 13, Lemma 14 and Lemma 18 in [33]).**
For any functions , the skew-symmetric trilinear form satisfies
[TABLE]
[TABLE]
and a sharper bound
[TABLE]
The weak formulation of the NSE (1) reads: Find and such that
[TABLE]
To ensure the uniqueness of the solution to (5), we make the following regularity assumptions (see Definition 29, Proposition 15, and Remark 10 in [33]):
Assumption 2.1**.**
In (1), we assume that , , , , , and .
For any positive integer , consider the time instances , where . Denote the solution of (5) at time to be and the force at to be , respectively. We make the following assumption, which will be used in Theorem 4.1:
Assumption 2.2**.**
We assume that the solution of (5) satisfies the following stability estimate for all integers such that :
[TABLE]
where is a constant that does not depend on , but can depend on the initial data.
For , denote the FE approximate solution of (7) at to be . The FE semidiscretization of (5) can be written as follows: Find such that
[TABLE]
and .
Assumption 2.3** (Finite Element Error).**
We assume that the FE approximation of the full discretization of (7) satisfies the following error estimate:
[TABLE]
We also assume the following standard approximation property:
[TABLE]
The constant in (8)–(9) is a constant that does not depend on , but can depend on the initial data.
3 The Leray ROM (L-ROM)
In this section, we present the Leray ROM, which we will analyze in Section 4. To this end, we present the standard ROM (Sections 3.1 and 3.2) and the explicit ROM differential filter (Section 3.3), which will be used to construct the Leray ROM (Section 3.4).
3.1 Proper Orthogonal Decomposition
We briefly describe the POD method, following [30]. For a detailed presentation, the reader is referred to [23, 44].
Consider an ensemble of snapshots , which is a collection of velocity data from either numerical simulation results or experimental observations at time , . The POD method seeks a low-dimensional basis in that optimally approximates the snapshots, i.e., solves the minimization problem: subject to the conditions , where is the Kronecker delta. To solve this minimization problem, one can consider the eigenvalue problem where is the snapshot correlation matrix with entries for , is the -th eigenvector, and is the associated eigenvalue. The eigenvalues are positive and sorted in descending order , where is the rank of . It can then be shown that the POD basis functions are given by where is the -th component of the eigenvector . It can also be shown that the following error formula holds [23, 30]:
[TABLE]
We define the ROM space as .
Remark 3.1**.**
Since, the POD basis functions are linear combinations of the snapshots, the POD basis functions satisfy the boundary conditions in (1) and are solenoidal. If the FE approximations are used as snapshots, the POD basis functions belong to , which yields .
3.2 The Galerkin ROM (G-ROM)
The ROM employs both Galerkin truncation and Galerkin projection. The former yields an approximation of the velocity field by a linear combination of the truncated POD basis:
[TABLE]
where are the sought time-varying coefficients representing the POD-Galerkin trajectories. Note that , where denotes the number of degrees of freedom in the full order model (e.g., the FE approximation). Replacing the velocity with in the NSE (1), using the Galerkin method, and projecting the resulting equations onto the ROM space , one obtains the Galerkin ROM (G-ROM) for the NSE: Find such that
[TABLE]
and . In (12), the pressure term vanishes because all POD modes are solenoidal and satisfy the appropriate boundary conditions. The error analysis of the spatial and temporal discretizations of the G-ROM (12) was considered in [9, 25, 29, 30, 31, 36, 43]. Despite its appealing computational efficiency, the G-ROM (12) has generally been limited to laminar flows. To overcome this restriction, we consider the Leray ROM.
3.3 ROM Differential Filter (DF)
To construct the Leray ROM, we use the ROM differential filter (DF), which is an explicit ROM spatial filter:
Definition 3.1** (ROM Differential Filter).**
, let be the unique element of such that
[TABLE]
The differential filter was introduced in large eddy simulation by Germano [15, 14]. In a ROM setting, the DF (13) was first used in [41] and later extended in [24, 47, 48].
3.4 The Model
We consider the Leray reduced order model (L-ROM) [41, 47], which is a regularized ROM: Find such that
[TABLE]
where the initial condition is given by the projection of on :
We consider the full discretization of (14): We use the backward Euler method with a time step for the time integration and the FE space with and a mesh size for the spatial discretization. For , we denote the approximation solution of (14) at to be and the force at to be , respectively. Note that we have dropped the subscript in for clarity of notation. The discretized L-ROM reads: Find such that, ,
[TABLE]
where the initial condition is
4 Error Analysis
In this section, we present the error analysis for the L-ROM discretization (15). We take the FE solutions , as snapshots and choose in the POD generation. The error source includes three main components: the spatial FE discretization error, the temporal discretization error, and the POD truncation error. We derive the error estimate in three steps: First, we gather some necessary assumptions and preliminary results in Section 4.1. Then, we prove a ROM filtering error estimate in Section 4.2. Finally, we prove an L-ROM error estimate in Section 4.3.
4.1 Preliminaries
Definition 4.1** (Generic Constant ).**
In what follows, and , where is a positive integer, will denote generic constants that do not depend on , but can depend on .
Definition 4.2** (ROM Laplacian).**
Let
[TABLE]
such that, is the unique element of such that
[TABLE]
We list a POD inverse estimate, which will be used in what follows. Let with be the POD stiffness matrix. Let denote the matrix 2-norm.
Lemma 4.1** (POD Inverse Estimates).**
For all , the following POD inverse estimate holds:
[TABLE]
where .
The inverse estimate (18) was proved in Lemma 2 and Remark 2 in [30] and was numerically investigated in Remark 3.3 in [25] and in Remark 3.2 in [18].
Definition 4.3** (ROM Projection).**
Let
[TABLE]
such that, is the unique element of such that
[TABLE]
Proposition 4.1** ( Stability of ROM Projection).**
[TABLE]
Proof.
By choosing in (20) and using the Cauchy-Schwarz inequality, we can prove (21). ∎
The following error estimate was proved in Lemma 3.3 in [26]:
Lemma 4.2**.**
For any , its projection, , satisfies the following error estimates:
[TABLE]
We assume the following estimates, which were also assumed in [25]:
Assumption 4.1**.**
For any , its projection, , satisfies the following error estimates:
[TABLE]
4.2 ROM Filtering Error Estimates
In this section, we present theoretical results for the DF (13), which was the essential tool that we used in developing the Leray ROM (14). The main result in this section is the estimate for the ROM filtering error in Lemma 4.3. To our knowledge, this is the first estimate for the ROM filtering error. This estimate is an extension of the FE filtering error estimates proved in [11, 12, 32]. This ROM filtering error estimate is important for the L-ROM error analysis in Section 4.3, since we use it to treat the nonlinear term in (63).
Lemma 4.3** (ROM Filtering Error Estimates).**
For and ,
[TABLE]
Proof.
Using the definition of the DF (13), we have
[TABLE]
Since (by hypothesis), we also have
[TABLE]
Subtracting (27) from (28), we get
[TABLE]
We decompose the error as follows:
[TABLE]
where is arbitrary. Using (30) in (29), we get:
[TABLE]
To prove (26), we let in (31) and then use the Cauchy-Schwarz and Young inequalities:
[TABLE]
Rearranging (32) yields
[TABLE]
Using (33) and the triangle inequality yields
[TABLE]
Using Assumption 4.1, we get
[TABLE]
Plugging (4.2)-(36) into (34) proves (26).
∎
Remark 4.1**.**
Lemma 4.3 extends Lemma 2.12 in [32] from the FE setting to the ROM setting. We could have extended Lemma 2.4 in [12] instead of Lemma 2.12 in [32] since the former yields better scalings of the seminorm of the filtering error. We emphasize, however, that the proof of Lemma 2.4 in [12] uses the stability of the projection [5, 13]. To our knowledge, the stability of the projection has not been yet proven in a ROM setting. Thus, we decided to extend to the ROM setting Lemma 2.12 in [32], which does not rely on the stability of the ROM projection.
In the following lemma, we prove the stability of the ROM filtered variables, which will be used to prove Theorem 4.1. This lemma extends Lemma 2.11 in [32] (see also Lemma 2.3 in [12]) from the FE case to the ROM case.
Lemma 4.4** (Stability of ROM Filtered Variables).**
For , we have
[TABLE]
For , we have
[TABLE]
Proof.
To prove (37), we let in (13):
[TABLE]
Applying the Cauchy-Schwarz inequality to the RHS of (40), we get (37).
To prove (38), we use the POD inverse estimate (18) and (37):
[TABLE]
Finally, to prove (39), we let in (13):
[TABLE]
Using the definition of the ROM Laplacian (17) in (42), we get
[TABLE]
Applying the Cauchy-Schwarz inequality to the RHS of (43), we get (39).
∎
4.3 Leray ROM Error Estimates
In this section, we prove a stability estimate (Lemma 44) and an error estimate (Theorem 4.1) for the L-ROM (15).
Lemma 4.5**.**
The solution of (15) satisfies the following bound:
[TABLE]
Proof.
Choosing in (15) and noting that by (2), we obtain
[TABLE]
Using the Cauchy-Schwarz and Young inequalities yields
[TABLE]
Applying the Cauchy-Schwarz and Young inequalities in (46), we get
[TABLE]
The stability estimate (44) follows by summing (47) from 0 to . ∎
Theorem 4.1**.**
Under the regularity assumption of the exact solution (Assumption 2.1 and Assumption 2.2), the assumption on the FE approximation (Assumption 2.3), and the assumption on the ROM projection error (Assumption 4.1), the solution of the L-ROM (15) satisfies the following error estimate: There exists such that the inequality
[TABLE]
holds for all , where
[TABLE]
Proof.
We start by splitting the error into two terms:
[TABLE]
where
[TABLE]
The first term in (50), , represents the difference between and its projection on , which has been bounded in Lemma 4.2. The second term, , is the remainder. Next, we construct the error equation. We first evaluate the weak formulation of the NSE (5) at and let , then subtract the L-ROM (15) from it. We obtain
[TABLE]
By subtracting and adding the difference quotient term, , in (52), and applying the decomposition (50), we have
[TABLE]
Note that (20) implies that and . Letting , we obtain
[TABLE]
We estimate the LHS of (54) by applying the Cauchy-Schwarz and Young inequalities:
[TABLE]
Using (54) and (55), we obtain
[TABLE]
Using the Cauchy-Schwarz and Young inequalities in (56), we get
[TABLE]
[TABLE]
The nonlinear terms in (56) can be written as follows:
[TABLE]
[TABLE]
where in the last term we have used (2). In (59), we apply Lemma 2.1, Lemma 4.4, Lemma 4.3 and the Cauchy-Schwarz and Young inequalities:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
which can be bounded by using Lemma 4.3. Since , the pressure term on the RHS of (56) can be written as
[TABLE]
where is any function in . Thus, the pressure term can be estimated as follows by using the Cauchy-Schwarz and Young inequalities:
[TABLE]
Choosing appropriately, then substituting inequalities (57)–(58), (60)–(62), and (63) in (56), we obtain
[TABLE]
Summing (66) from to , we have
[TABLE]
The first term on the RHS of (67) vanishes, since . By using the Poincaré-Friedrichs inequality, the second term on the RHS of (67) can be estimated as follows (see, e.g., [26]):
[TABLE]
Using (23), the third term on the RHS of (67) can be estimated as follows:
[TABLE]
To estimate the fourth term on the RHS of (67), we use Lemma 44 and Assumption 4.1:
[TABLE]
where we used estimate (25) in the derivation of (70). Using (23) would not have been enough for the asymptotic convergence of (70).
Using Assumption 4.1, the fifth term on the RHS of (67) can be bounded as follows:
[TABLE]
To estimate the seventh term on the RHS of (67), we use Lemma 4.3:
[TABLE]
Since in (64) was an arbitrary function in , we can use the approximation property (9) in Assumption 2.3 to bound the eighth term on the RHS of (67) as follows:
[TABLE]
Collecting (68)-(73), equation (67) becomes
[TABLE]
[TABLE]
A discrete Gronwall lemma (see Lemma 27 in [33] and Lemma 5.1 in [22]) implies that, for small enough (i.e., \Delta t<\bigl{(}C_{9}\,\max_{1\leq k\leq M}\|\nabla\boldsymbol{u}^{k}\|^{4}\bigr{)}^{-1}), the following inequality holds:
[TABLE]
By using (75), the triangle inequality, and (23)–(24), yields
[TABLE]
This completes the proof.
∎
5 Numerical Results
In this section, we perform a numerical investigation of the theoretical results obtained in Section 4. To this end, we investigate whether the ROM filtering error estimate in Lemma 4.3 and the L-ROM approximation error estimate in Theorem 4.1 are recovered numerically.
In the numerical investigation, we consider the same test problem and computational setting as those used in Section IV.B in [26]. The problem is governed by the 2D incompressible NSE with an analytical solution. The exact velocity, , has the components , , and the exact pressure is given by . The diffusion coefficient is and the forcing term is chosen to match the exact solution. The spatial domain is discretized by the Taylor-Hood FEs with the mesh size . To generate the POD basis, snapshots are collected over the time interval at every by recording the exact values of and on the FE mesh. Following the ansatz in (11), we do not use the common centering trajectory approach; instead, we apply the method of snapshots to the snapshot data directly. The dimension of the POD basis is 101.
5.1 ROM Filtering Error
In this section, we perform a numerical investigation of the ROM filtering error (26) in Lemma 4.3. We define the following average squared filtering errors: The ROM filtering error bound (26) in Lemma 4.3 depends on the parameters as well as the ROM truncation errors We numerically investigate the rates of convergence of and with respect to the time step , filter radius , and ROM truncation error .
First, we investigate the convergence rates with respect to . To this end, we fix , and (note that the time step size should not matter in this test because the snapshots are FE interpolants of the exact solutions), and vary . With these choices, , , and . Thus, the theoretical error estimate (26) in Lemma 4.3 yields the following asymptotic scaling:
[TABLE]
Note that (26) does not provide a scaling between and .
We apply the DF (13) to the snapshot data and measure the numerical errors and , which are listed in Table 1. Linear regressions of the errors, which are plotted in Fig. 1 for decreasing values, show the following scalings for the ROM filtering errors:
[TABLE]
Thus, the theoretical scaling (77) is numerically recovered. On the other hand, although not verified theoretically in (26), we do observe the almost quadratic convergence of with respect to (see Remark 4.1).
Next, we investigate the convergence rates with respect to . To this end, we fix , , and vary . With these choices, , and . Thus, the theoretical error estimate (26) in Lemma 4.3 yields the following asymptotic scalings:
[TABLE]
The numerical errors and are listed in Table 2 for increasing values. The corresponding linear regressions, which are shown in Fig. 2, indicate the following scalings between the average ROM filtering errors and the ROM truncation error:
[TABLE]
Thus, the theoretical scalings (80) and (81) are numerically recovered.
5.2 L-ROM Approximation Error
In this section, we perform a numerical investigation of the L-ROM approximation error estimate (48) in Theorem 4.1. The L-ROM approximation error at the final time step is We numerically investigate the rates of convergence of with respect to the time step , filter radius and ROM truncation error . To this end, we first note that in our numerical investigation and . Thus, the L-ROM approximation error bound (49) in Theorem 4.1 simplifies to the following:
[TABLE]
The control parameters in the L-ROM approximation error rates of convergence in (84) are .
To determine the L-ROM approximation error rate of convergence with respect to , we fix , , and vary . With these choices, , , and . Thus, the theoretical L-ROM approximation error bound (84) predicts the following rate of convergence of with respect to :
[TABLE]
The L-ROM approximation error is listed in Table 3 for decreasing values. The corresponding linear regression, which is shown in Fig. 3, indicates the following L-ROM approximation error rate of convergence with respect to :
[TABLE]
Thus, the theoretical rate of convergence (85) is numerically recovered.
[TABLE]
To determine the L-ROM approximation error rate of convergence with respect to , we fix , , and vary . With these choices, , , , and . Thus, the theoretical L-ROM approximation error bound (84) predicts the following rate of convergence of with respect to :
[TABLE]
The L-ROM approximation error is listed in Table 4 for decreasing values. The corresponding linear regression, which is shown in Fig. 4, indicates the following L-ROM approximation error rate of convergence with respect to :
[TABLE]
We note that the numerical rate of convergence (88) is higher than the theoretical rate of convergence (87) (see Remark 4.1).
[TABLE]
To determine the L-ROM approximation error rate of convergence with respect to , we fix , , and vary . With these choices, and . Thus, the theoretical L-ROM approximation error bound (84) predicts the following rate of convergence of with respect to :
[TABLE]
The L-ROM approximation error is listed in Table 5 for increasing values. The corresponding linear regression, which is shown in Fig. 5, indicates the following L-ROM approximation error rate of convergence with respect to :
[TABLE]
Thus, the theoretical rate of convergence (89) is numerically recovered.
[TABLE]
6 Conclusions and Outlook
Several modeling strategies have been proposed to alleviate the spurious numerical oscillations that generally appear when standard ROMs are used to simulate convection-dominated flows. Reg-ROMs are recently proposed ROMs in which numerical stabilization is achieved through explicit ROM spatial filtering. Reg-ROMs were successfully used in [47] in the numerical simulation of the 3D flow past a circular cylinder at a Reynolds number . Reg-ROMs were also employed in [24] for the stabilization of ROMs in the numerical simulation of a stochastic Burgers equation. To our knowledge, however, there is no numerical analysis of the Reg-ROMs and the explicit ROM spatial filter.
In this paper, we took a first step in this direction and, in Theorem 4.1, we proved error estimates for the FE discretization of one such Reg-ROM, the L-ROM [24, 41, 47]. In Lemma 4.3, we also proved error estimates for the FE discretization of the ROM differential filter, which is the explicit ROM spatial filter that we used in the construction of the L-ROM. Finally, in Section 5, we provided a numerical verification of the ROM filtering error estimate derived in Lemma 4.3 and the L-ROM approximation error estimate in Theorem 4.1. In our numerical investigation, we considered the 2D incompressible NSE with an analytical solution and small diffusion coefficient , which is the computational setting used in [26].
There are several research directions that could be pursued. As noted in Remark 4.1, one could try to extend from the FE setting to the ROM setting Lemma 2.4 in [12] instead of Lemma 2.12 in [32], as we did in Lemma 4.3, since the former could yield better scalings of the seminorm of the filtering error. However, one would probably first have to prove the stability of the ROM projection, which, to our knowledge, has not been achieved yet. Another research direction is the extension of the numerical analysis for the L-ROM to other Reg-ROMs, such as the evolve-then-filter ROM [47]. Finally, one could also try to prove error estimates for the novel large eddy simulation ROMs introduced in [48], in which the explicit ROM filter error plays a central role.
Acknowledgements
The authors greatly appreciate the financial support of the National Science Foundation through grants DMS-1522656 and DMS-1522672.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. J. Balajewicz, E. H. Dowell, and B. R. Noack. Low-dimensional modelling of high-Reynolds-number shear flows incorporating constraints from the Navier–Stokes equation. J. Fluid Mech. , 729:285–308, 2013.
- 2[2] M. J. Balajewicz, I. Tezaur, and E. H. Dowell. Minimal subspace rotation on the Stiefel manifold for stabilization and enhancement of projection-based reduced order models for the compressible Navier–Stokes equations. J. Comput. Phys. , 321:224–241, 2016.
- 3[3] F. Ballarin, E. Faggiano, S. Ippolito, A. Manzoni, A. Quarteroni, G. Rozza, and R. Scrofani. Fast simulations of patient-specific haemodynamics of coronary artery bypass grafts based on a POD–Galerkin method and a vascular shape parametrization. J. Comput. Phys. , 315:609–628, 2016.
- 4[4] F. Ballarin, A. Manzoni, A. Quarteroni, and G. Rozza. Supremizer stabilization of POD–Galerkin approximation of parametrized steady incompressible Navier–Stokes equations. Int. J. Numer. Meth. Engng. , 102:1136–1161, 2015.
- 5[5] R. E. Bank and T. Dupont. An optimal order process for solving finite element equations. Math. Comput. , 36(153):35–51, 1981.
- 6[6] M. Benosman, J. Borggaard, and B. Kramer. Robust reduced-order model stabilization for partial differential equations based on Lyapunov theory and extremum seeking with application to the 3D Boussinesq equations. ar Xiv preprint http://arxiv.org/abs/1604.04586 , 2016.
- 7[7] L. Bertagna and A. Veneziani. A model reduction approach for the variational estimation of vascular compliance by solving an inverse fluid–structure interaction problem. Inverse Probl. , 30(5):055006, 2014.
- 8[8] D. A. Bistrian and I. M. Navon. An improved algorithm for the shallow water equations model reduction: Dynamic mode decomposition vs POD. Int. J. Num. Meth. Fluids , 78(9):552–580, 2015.
