Reduced order models for thermally coupled low Mach flows

The main purpose of this paper is to develop a model reduction formulation suitable for thermally coupled flows, by expanding the techniques in projection-based model reduction developed for several applications on fluid dynamics—mostly for incompressible Navier–Stokes equations—to the zero Mach limit Navier–Stokes equations developed in [1, 2].

Following the model reduction developments in [3] we choose a POD model reduction approach. The POD, as any projection-based model reduction, aims to describe any phenomena that otherwise would be represented by a ‘computationally expensive’ numerical method with a surrogate lower dimensional model. This surrogate model is obtained by projecting the computational expensive numerical approximation onto a previously computed reduced space. Thus, the model reduction is arranged in two stages: an offline part, where the solution obtained from a ‘high fidelity’ full order model (FOM) is used to build the desired reduced order subspace; and an online part, where by projecting the original model onto the reduced subspace the ROM is built and subsequently solved.

The traditional POD model reduction approach presents certain drawbacks when considering non-linear complex problems: added computational cost of representing the non-linearities over a linearized computational model, inherent numerical instabilities caused by the Navier–Stokes formulation, and non-optimal projection over the reduced space caused by the asymmetrical nature of the formulation.

To overcome the first issue, a wide variety of methods inspired by the work of Everson and Sirovich [4] have been introduced [5–10], with the term ‘hyper-ROM’ coined by Ryckelink [11]. This family of methods consists in using a sample of the geometrical domain. In this paper, we propose an idea of hyper-ROM that differs from the sampling way: to set the ROM on a geometrical space smaller than the original one. This, applied to mesh based methods, implies the interpolation of the developed ROM—basis included—onto a coarser mesh.

To stabilize both the FOM and ROM, we follow the same approach: a VMS framework. For the FOM case, we follow the stabilized formulation of the thermally coupled zero Mach limit Navier–Stokes equations developed in [12], using the Orthogonal Subgrid-Scales (OSS) as defined in [13]. For the ROM case, we propose an analogous method where the OSS are defined orthogonal to the ROM sub-space.

Lastly, to solve the non-optimality in the reduced space projection, we use a Petrov–Galerkin projection instead of the standard Galerkin projection as proposed in [7]. In the specific case of mesh based methods, the POD-ROM method can be seen as a solution of the original problem using a projection method as in [14], where the Petrov–Galerkin projection is the one that satisfies the non-singularity of the system of equations when the FOM is not symmetric.

This article is organized as follows. In the first section, we present a brief description of the zero Mach number limit Navier–Stokes model. In the second section, we describe briefly the idea of model reduction along with an explanation of the POD compression technique for the construction of the basis. In the third section, we present a modified finite element (FE)-ROM implementation, including the stabilization using VMS, the new proposed hyper-ROM method, and the Petrov–Galerkin projection. In the fourth section, we present examples consisting in a differential heated cavity, with 2D and 3D cases. Finally, we close the paper with some conclusions.

Projection-based ROMs rely on the existence of a reduced dimensional sub-space that approximates the solution space. Let us define a high dimensional space of dimension M, with \(\varvec{\varphi }\) its orthonormal basis. Then, the i-th component of any element can be written as the linear combination \(Y_{h,i} = \sum \nolimits _{k=1}^M (Y_{h,i},\varphi ^k_i) \varphi ^k_i\), with ( : ,  : ) a \(L^2\)-inner product. Note that may be an approximation to a continuous—infinite dimensional—space. Since for most cases the exact basis \(\varvec{\varphi }\) is unknown, we can define a lower-dimensional space of dimension m, which approximates as \(m \rightarrow M\), with a basis \(\varvec{\phi }\). Using this test basis, we can approximate the i-th component of any element \(\varvec{Y}_h\) as \(Y_{h,i} \approx \sum \nolimits _{k=1}^m \phi ^k_i Y^k\), where the accuracy of the approximation will depend on how accurate is the basis \(\varvec{\phi }\) compared to the exact basis \(\varvec{\varphi }\).

Construction of the basis

Following previous works in model reduction in FE [3, 7, 9], we use the POD statistical procedure as a way to build the reduced order sub-space basis \(\varvec{\phi }\). The objective of the POD method is finding a basis for a collection of high-fidelity ‘snapshots’ to use it as a the basis of the desired reduced sub-space.

Let us organize a set of data that has been previously obtained from a solution of the problem in Eq. 1, as a N-collection of ‘snapshots’ \(\varvec{Y}_{h,j}^s = \varvec{Y}_{h,j} - \bar{\varvec{Y}}_h\) in an ensemble:

$$\begin{aligned} \{\varvec{Y}_{h,j}^s\}_{j=1}^N = \{\varvec{Y}_{h,1}^s,\varvec{Y}_{h,2}^s,\ldots ,\varvec{Y}_{h,N}^s\}, \end{aligned}$$

(6)

with \(\bar{\varvec{Y}}_h\) the mean value of the snapshots.

Now, let us denote as \(\{\varvec{\phi }^k\}_{k=1}^m\) an orthonormal basis of , where any member \(\varvec{Y}_{h,j}\) of the ensemble in Eq. 6 can be approximated as:

$$\begin{aligned} \varvec{Y}_{h,j} \approx \bar{\varvec{Y}}_h + \sum \limits _{k=1}^m (\varvec{Y}_{h,j}^s,\varvec{\phi }^k) \varvec{\phi }^k. \end{aligned}$$

(7)

The POD consists in finding the orthonormal basis \(\{\varvec{\phi }^k\}_{k=1}^m\), such that, for every \(k \in \{1,\ldots ,m\}\) the mean square error between the elements \(\varvec{Y}_{h,j}\), \(1 \le j \le N\), and the corresponding j-th partial sum of Eq. 7 is minimized on average:

$$\begin{aligned} \min _{\{\varvec{\phi }\}_{k=1}^m}\qquad&\frac{1}{N} \sum \limits _{j=1}^N \left\| \varvec{Y}_{h,j}^s - \sum \limits _{k=1}^m (\varvec{Y}_{h,j}^s,\varvec{\phi }^k) \varvec{\phi }^k\right\| ^2, \nonumber \\ \text {subject to }&(\varvec{\phi }^i,\varvec{\phi }^j) = \delta _{ij}, \quad 1 \le i,j \le m. \end{aligned}$$

(8)

To solve the problem in Eq. 8 we follow a singular value decomposition (SVD) of the ‘snapshots’ collection in Eq. 6, where the resulting left singular-vectors of the decomposition represent the basis \(\{\varvec{\phi }^k\}_{k=1}^M\). Here, based on the Eckart–Young–Mirsky theorem we can define a reduced basis simply by truncating the left singular-vectors at the m column as: \(\{\varvec{\phi }^k\}_{k=1}^{m \ll M}\). As a criterion for the truncation, we use the retained energy \(\eta \) defined in [3] as:

$$\begin{aligned} \eta = \frac{\sum \nolimits _{k=1}^m \lambda ^k}{\sum \nolimits _{k=1}^M \lambda ^k}, \end{aligned}$$

(9)

where \(\lambda ^k\) are the SVD non-zero singular values.

Remark

Note that this is the way we approximate \(\varvec{\phi }\), but there are several other ways to find a basis for the reduced order sub-space (as the ones in [15, 16]). The projection-based model reduction formulation below should be valid for any basis regardless of the technique used to obtain it.

Remark

In this paper, the ‘snapshots’ data is obtained using a FE approximation and therefore, the basis \(\varvec{\phi }\) approximates the FE space —of dimension M—which in turn approximates the space of the continuous problem.

Having stated the equations that represent the physical problem and the standard model reduction approach, we now describe the FE-ROM approximation of the problem.

In this section, let us denote as the functional continuous space where \(\varvec{Y}\) exist. Instead of following a standard Galerkin approximation of the variational problem—where the FE space is denoted as —we construct the approximation space for the ROM. The FE space is assumed to be built from a FE partition of the domain \(\Omega \). The order of the FE interpolation is irrelevant for our discussion.

Introducing the notation \((:,:)=(:,:)_\Omega \) and \((:,:)_\Gamma \), for the \(L^2\)-inner product on \(\Omega \) and \(\Gamma \) respectively, or for the integral of the product of two functions—if they are not square integrable but their product can be integrated, we can define the variational problem as finding , such that:

(10)

where \(\varvec{\Upsilon }_r\) is the test function and the problem is written using the forms B and L defined as:

$$\begin{aligned} B(\varvec{Y};\varvec{Y}_r,\varvec{\Upsilon }_r) {:}{=}&\left( \varvec{A}_i^c(\varvec{Y}) \partial _i{\varvec{Y}_r}, \varvec{\Upsilon }_r \right) - ( \varvec{A}_i^f(\varvec{Y}) \varvec{Y}_r,\partial _i{\varvec{\Upsilon }_r} ) \nonumber \\&+\, \left( \varvec{K}_{ij}(\varvec{Y}) \partial _j{\varvec{Y}_r},\partial _i{\varvec{\Upsilon }_r} \right) + \left( \varvec{S}(\varvec{Y}) \varvec{Y}_r,\varvec{\Upsilon }_r \right) , \end{aligned}$$

(11)

$$\begin{aligned} L(\varvec{\Upsilon }_r) {:}{=}&\left( \varvec{F},\varvec{\Upsilon }_r \right) + \left( \hat{\varvec{T}}_n,\varvec{\Upsilon }_r \right) _\Gamma . \end{aligned}$$

(12)

Note that the terms where \(\varvec{Y}\) is not approximated by \(\varvec{Y}_r\) in Eq. 11 involve non-linearities. In a further section we discuss the linearization scheme and two ways of approximating these terms.

VMS for FE-ROM

Given the well-known lack of stability in the Galerkin standard formulation—present in convective dominated regimes—a stabilization technique is necessary. Inspired in previous works that acknowledge instability issues [17, 18] and using a VMS framework as done for several problems in FE approximations, we develop what we call FE-ROM-Subgrid-Scales (SGS), which resembles FE-SGS.

We start by splitting the unknown of the continuous problem \(\varvec{Y}\) in a part \(\varvec{Y}_r\), which can be resolved by the FE-ROM standard approximation; and a remainder \(\breve{\varvec{Y}}\), the FE-ROM-SGS. In this way we can re-define the approximation of the continuous space as , where the SGS space is any space that completes in . Then, the variational form of the problem in Eq. 10 expands into two: finding and , such that:

(13a)

(13b)

Since it is desirable to avoid derivatives over the subscale \(\breve{\varvec{Y}}\), we can re-write the bilinear form \(B(\varvec{Y};\breve{\varvec{Y}},\varvec{\Upsilon }_r)\) in Eq. 13a by integrating by parts within each element and assuming that the exact tractions are continuous across inter-element boundaries, yielding:

(14)

where \((:,:)_K\) is the \(L^2\) inner product over element K, and \(\mathcal {L}^*\) is the adjoint of the lineal operator \(\mathcal {L}(\varvec{Y};:)\). Following the formulation in [12], this adjoint operator \(\mathcal {L}^*\) is:

$$\begin{aligned} \mathcal {L}^*(\varvec{Y};\varvec{\Upsilon }_r) {:}{=}&\, \partial _t{(\varvec{M} (\varvec{Y}) \varvec{\Upsilon }_r)} - \varvec{A}_j^{f\top }(\varvec{Y}) \partial _j{ \varvec{\Upsilon }_r} \nonumber \\&-\, \varvec{A}_j^{c\top }(\varvec{Y}) \partial _j{ \varvec{\Upsilon }_r} - \partial _{j}{\varvec{K}_{ij}^\top (\varvec{Y}) \partial _{i}{\varvec{\Upsilon }_r}} + \varvec{S}^\top (\varvec{Y})\varvec{\Upsilon }_r. \end{aligned}$$

(15)

Subscales approximation

At this point, we have described two sets of equations: a FE-ROM one, in which all the terms have been described; and a FE-ROM-SGS one. In order to solve the second system, we follow a standard VMS formulation. After doing integration by parts in some terms, neglecting the tractions across inter-element boundaries, and replacing \(\varvec{u} \cdot \nabla \rho \) by \(-\frac{\rho \varvec{u}}{T} \cdot \nabla T\); we can re-write Eq. 13b as:

(16)

with the residual defined as \(\varvec{R}(\varvec{Y},\varvec{Y}_r) = \varvec{F} - \varvec{M}(\varvec{Y})\partial _t{\varvec{Y}_r} - \breve{\mathcal {L}}(\varvec{Y};\varvec{Y}_r)\), and the linear operator defined as \(\breve{\mathcal {L}} (\varvec{Y};\varvec{Y}_r) {:}{=}\partial _i{(\varvec{A}_i^c(\varvec{Y}) \varvec{Y}_r)} + \breve{\varvec{A}}_i^f(\varvec{Y}_r) \partial _i{\varvec{Y}} - \partial _i{ \left( \varvec{K}_{ij}(\varvec{Y}) \partial _j{\varvec{Y}_r} \right) } + \varvec{S}(\varvec{Y})\varvec{Y}_r\), with:

$$\begin{aligned} \breve{\varvec{A}}_i^f = \begin{bmatrix} \varvec{0} \otimes \varvec{0}&\varvec{e}_i&\varvec{0} \\ \rho \varvec{e}_i^\top&0&\frac{\rho u_i}{T} \\ \varvec{0}^\top&0&0 \end{bmatrix}. \end{aligned}$$

(17)

We can re-write Eq. 16 in the following way:

(18)

where \(\varvec{\Upsilon }_r^\perp \) is a term that ensures that Eq. 18 belongs to and its definition depends on the choice of .

Now, using the algebraic approximation \(\breve{\mathcal {L}}(\varvec{Y};\breve{\varvec{Y}}) \approx \varvec{\tau }^{-1}(\varvec{Y})\breve{\varvec{Y}}\), we can re-write Eq. 18 as:

(19)

where \(\varvec{\tau }\) is the matrix of stabilization parameters that depends on K and the coefficients of the operator \(\breve{\mathcal {L}}\). It is important to notice that so far the matrix \(\varvec{\tau }\) does not depend on the choice of the approximation space , and therefore we can use the same definition of the stabilization parameters as in the FE approximation of the problem. In this case, we use the definition of the algebraic operator \(\varvec{\tau }\) given by [2, 13]:

$$\begin{aligned} \varvec{\tau }^{-1}(\varvec{Y})= \begin{bmatrix} \tau ^{-1}_m(\varvec{Y})\varvec{I}&\varvec{0}&\varvec{0} \\ \varvec{0}^\top&\tau ^{-1}_c(\varvec{Y})&0 \\ \varvec{0}^\top&0&\tau ^{-1}_e(\varvec{Y}) \end{bmatrix}, \end{aligned}$$

(20)

with the stabilization parameters defined as:

$$\begin{aligned} \tau ^{-1}_m&= c_1 \frac{\mu }{h^2} + c_2 \frac{\rho |\varvec{u}|}{h}, \end{aligned}$$

(21a)

$$\begin{aligned} \tau ^{-1}_c&= \frac{c_1 \rho \tau _m}{h^2}, \end{aligned}$$

(21b)

$$\begin{aligned} \tau ^{-1}_e&= c_1 \frac{\lambda }{h^2} + c_2 \frac{\rho c_p |\varvec{u}|}{h}, \end{aligned}$$

(21c)

where h is the element size and \(c_1\) and \(c_2\) are algorithmic constants.

To complete the approximation of the subscales, it still remains to define the term \(\varvec{\Upsilon }_r^\perp \), that is, to choose the appropriate subscales space . Based on the orthogonality property of the basis \(\phi \) and on the work developed in [13, 19], we define the subscales space , which can be thought as being orthogonal to the approximation space , that implies having:

(22a)

(22b)

(22c)

To numerically compute \(\varvec{\Upsilon }_r^\perp \) we follow the supposition made in [20], where the orthogonality between and is defined respect to the weighted inner product \((\varvec{Y},\varvec{\Upsilon })_{\varvec{M}} = (\varvec{Y},\varvec{M}(\varvec{Y}) \varvec{\Upsilon })\). Following this condition any subscale \(\breve{\varvec{Y}}\) must satisfy:

(23)

Now replacing the orthogonality condition (Eq. 23) in Eq. 19, we obtain:

(24)

from where it follows that \(\varvec{\Upsilon }_r^\perp \) is the following projection onto the space with respect to \(L^2\)-inner product, denoted by \(\Pi _r\):

$$\begin{aligned} \varvec{\Upsilon }_r^\perp = \Pi _r \left( -\varvec{R}(\varvec{Y},\varvec{Y}_r) + \varvec{\tau }^{-1}(\varvec{Y})\breve{\varvec{Y}} \right) . \end{aligned}$$

(25)

Replacing \(\varvec{\Upsilon }_r^\perp \) into Eq. 19, and using the approximation \(\Pi _r \left( \varvec{\tau }^{-1}(\varvec{Y})\breve{\varvec{Y}} \right) = \varvec{M}^{-1}(\varvec{Y}) \varvec{\tau }^{-1}(\varvec{Y}) \Pi _r \left( \varvec{M}(\varvec{Y}) \breve{\varvec{Y}} \right) = \varvec{0}\) presented in [20], we find an expression for the FE-ROM-SGS:

$$\begin{aligned} \partial _t{(\varvec{M}(\varvec{Y}) \breve{\varvec{Y}})} + \varvec{\tau }^{-1}(\varvec{Y})\breve{\varvec{Y}} = \Pi _r^\perp \left( \varvec{R}(\varvec{Y},\varvec{Y}_r) \right) , \end{aligned}$$

(26)

with \(\Pi _r^\perp {:}{=}\varvec{I}-\Pi _r\) defined as the orthogonal projection on , where \(\varvec{I}\) is now the identity in .

Finally, by introducing the orthogonality condition (Eq. 23) in Eq. 14, neglecting the term \(\varvec{M}(\varvec{Y}) \partial _t{\varvec{Y}}\) in the residual \(\varvec{R}\) of Eq. 26—due to its orthogonality to given by \(\left( \varvec{M}(\varvec{Y}) \partial _t{\varvec{Y}}, \breve{\varvec{\Upsilon }} \right) = 0\), and rearranging Eqs. 14 and 26, we can state the problem in Eq. 13 as finding and , such that:

$$\begin{aligned}&(\varvec{M}(\varvec{Y}) \partial _t{\varvec{Y}_r},\varvec{\Upsilon }_r ) + B (\varvec{Y};\varvec{Y}_r,\varvec{\Upsilon }_r )\,+\, \sum _K \left( \breve{\varvec{Y}},\mathcal {L}^*(\varvec{Y};\varvec{\Upsilon }_r) \right) _K = L(\varvec{\Upsilon }_r ), \end{aligned}$$

(27a)

$$\begin{aligned}&\partial _t{(\varvec{M}(\varvec{Y}) \breve{\varvec{Y}})} + \varvec{\tau }^{-1}(\varvec{Y})\breve{\varvec{Y}} = \Pi _r^\perp \left( \varvec{R}(\varvec{Y},\varvec{Y}_r) \right) , \end{aligned}$$

(27b)

with the adjoint operator \(\mathcal {L}^*\) and the residual \(\varvec{R}\) redefined as:

$$\begin{aligned} \mathcal {L}^*(\varvec{Y};\varvec{\Upsilon }_r)&= \varvec{S}^\top (\varvec{Y}) \varvec{\Upsilon }_r - \varvec{A}_j^{f\top }(\varvec{Y}) \partial _j{ \varvec{\Upsilon }_r} - \varvec{A}_j^{c\top }(\varvec{Y}) \partial _j{ \varvec{\Upsilon }_r} - \partial _{j}{\varvec{K}_{ij}^\top (\varvec{Y}) \partial _{i}{\varvec{\Upsilon }_r}}, \\ \varvec{R}(\varvec{Y},\varvec{Y}_r)&= \varvec{F} - \breve{\mathcal {L}}(\varvec{Y};\varvec{Y}_r). \end{aligned}$$

Remark

By following the same analysis performed when deriving the orthogonal SGS in [13, 19], we have come to a rather similar definition of the FE-ROM-SGS, where the most important difference lies in the definition of the orthogonal projection \(\Pi ^\perp \) in Eq. 26. In the FE case the projection is done onto the space , while in the FE-ROM approximation it is done onto the space .

Remark

The choice of the stabilization parameters \(\varvec{\tau }\) is done following the Fourier analysis done in [13]. Since the information represented by the reduced basis corresponds to the resolved scales from the FOM, the subscales for both the FOM and the ROM are part of the continuous solution which cannot be approximated by the FOM.

Remark

The previous definition of the FE-ROM-SGS is equivalent to the dynamic orthogonal SGS model in [20]; it is important to acknowledge that subscales could also be implemented without the temporal term (quasi-static), or not orthogonal to . An extensive analysis of the FE equivalent models is depicted in [12, 20].

Discrete approximation

We can describe the discrete representation of the FE-ROM problem as a composition of the FE and ROM approximations. In FE the space is defined as made of continuous piece-wise polynomial functions in the domain \(\Omega \), where we can write the discrete approximation of the unknown as \(\varvec{Y} \approx \varvec{Y}_h(\varvec{x},t) {:}{=}\sum \nolimits _{i=1}^n N(\varvec{x}^i) \varvec{Y}^{i}(t)\), with \(N(\varvec{x}^i)\) the shape function of node i. In contrast, in ROM we approximate the unknown \(\varvec{Y}\) as \(\varvec{Y}(t) \approx \bar{\varvec{Y}} + \sum \nolimits _{k=1}^m \varvec{\phi }^k Y^k (t)\).

Using these two approximations, we can describe the space in two ways: as a FE space , represented using orthogonal basis \(\phi \), or as a ROM approximation of the problem, discretized in \(\Omega \) using continuous piece-wise polynomial functions. In that way, we can write the discrete representation of \(\varvec{Y}_r\) as:

$$\begin{aligned} \varvec{Y}_r(\varvec{x},t) {:}{=}\sum \limits _{i=1}^n N(\varvec{x}^i) \left[ \bar{\varvec{Y}} + \sum \limits _{k=1}^m \varvec{\phi }^{k} (\varvec{x}^i) Y^{k}(t) \right] , \quad \forall \varvec{x} \in \Omega , \quad t>0. \end{aligned}$$

(31)

In this section we present two examples consisting of 2D and 3D versions of the initial transient part of a differentially heated cavity of aspect ratio 1—similar to the one presented in [12, 22]. In both examples the flow is considered an ideal gas with physical properties \(R=287.0 \frac{\text {J}}{\text {kg}\text {K}}\), \(c_p=1004.5 \frac{\text {J}}{\text {kg}\text {K}}\), and \(\mu =0.001 \frac{\text {kg}}{\text {m s}}\).

The computational domain for both problems is defined as \(\Omega = [0,L] \times [0,L]\) for the 2D problem, and \(\Omega = [0,L] \times [0,L] \times [0,L]\) for the 3D problem, with \(L= 1\) m. The temperatures on the walls perpendicular to the x-coordinate (horizontal) are fixed to \(T_h = 960\) K and \(T_c= 240\) K; while adiabatic boundary conditions are prescribed in the remaining walls. Additionally, no slip and impermeable conditions are set over all the walls, together with a homogeneous gravity force \(\varvec{g}\) prescribed in the negative y-coordinate (vertical). The initial thermodynamic pressure, temperature and density are set to \(p^{th}_0=101,325\) Pa, \(T_0 = 600\) K, and \(\rho _0 =0.58841 \frac{\text {kg}}{\text {m}^3}\) respectively, and the dimensionless Prandtl and Rayleigh numbers are set to \(Pr = \frac{c_p \mu }{\lambda } = 0.71\) and \(Ra = \frac{ 2|\varvec{g}| \rho ^2 c_p}{\lambda \mu } \frac{(T_h - T_c)}{(T_h + T_c)} = 3.55 \cdot 10^{6}\).

For the FOM solution (as a reference solution and for the construction of the snapshots), we follow the VMS formulation presented in [20], using the dynamic orthogonal SGS model. In all cases, we use a constant time step size of \(\delta t = 0.01\) s. For the finite element meshes used (described below) this time step is slightly higher than the critical time step of an explicit scheme due to advection, which in turn is of the same order as that due to viscous effects. Since we use an implicit scheme, we are not restricted to a critical time step size, but this observation serves to justify that our choice is adequate.

Additionally to the following examples, we have tested a differentially heated cavity of aspect ratio 8 analyzed in [23], getting inconclusive results.

Two dimensional case

In the 2D problem, we use 2 uniform structured meshes composed of quadrilateral elements: one with 10,000 elements and a mesh size \(h=0.01\), used for the solving the FOM and the ROM; and one with 2500 elements and a mesh size \(h=0.02\), for testing the hyper-ROM formulation. To construct the basis, we collect 500 snapshots for velocity, pressure and temperature at every 4 time steps in a 20 s interval. Figures 1, 2, and 3, show temperature contours of the solutions obtained using the FOM, ROM, and hyper-ROM formulations respectively.

To evaluate the accuracy of the ROM and hyper-ROM formulations, we perform a series of numerical tests using 12 different sets of basis, varying the retained energy from \(\eta _1=0.99\) to \(\eta _{12}=0.3\). Figure 4 depicts the number of vectors in the basis in function of the retained energy.

In Figs. 5 and 6 we compare the Nusselt number for FOM, ROM, and hyper-ROM solutions. The Nusselt number is calculated as the integral of the local Nusselt number over the hot and cold walls \(\int _\Gamma \text {Nu}(\varvec{x},t)d \Gamma \), with the local Nusselt number defined as:

$$\begin{aligned} \text {Nu}(\varvec{x},t) = \sum _a \frac{L}{T_h - T_c} \varvec{n} \cdot \nabla T(\varvec{x},t), \qquad \forall \varvec{x} \in \Gamma , \quad t > 0. \end{aligned}$$

(35)

As expected, we observe a more diffusive behaviour, in both the mean and the fluctuation of the Nusselt number, when fewer basis vectors are included. The hyper-ROM results appear to have the same behaviour of the ROM with lower amplitude. Additionally, we include a FOM solution (labeled \(\text {FOM}_{H}\)) using the coarser mesh to evaluate how the hyper-ROM formulation relates to a FE mesh coarsening.

Since we are computing an initial transient period of the physical phenomena we choose a root mean square of the Nusselt error—over the hot and cold walls—as a way to measure the overall error. The discrete \(L^2\)-norm error of the Nusselt number—for each time step i—over all the nodes of coordinates \(\varvec{x}^a\) of a boundary \(\Gamma \) is defined as:

$$\begin{aligned} \epsilon _i = \frac{\sum _a \left( (\text {Nu}_{\text {ROM}}(\varvec{x}^a) - \text {Nu}_{\text {FOM}}(\varvec{x}^a) \right) ^2}{\sum _a \left( \text {Nu}_{\text {FOM}}(\varvec{x}^a) \right) ^2}, \end{aligned}$$

(36)

and the root squared mean of \(\epsilon _i\)—for N time steps— is defined as:

$$\begin{aligned} \epsilon _\text {rms} = \sqrt{\sum _{i=1}^N \left( \frac{\epsilon _i^2}{N} \right) }. \end{aligned}$$

(37)

Figure 7 shows the convergence of \(\epsilon _{\text {rms}}\) over the hot and cold walls, and the mean value over both of them \(\bar{\epsilon }_{\text {rms}}\). We also include the convergence error for the FOM using the coarse mesh.

Although the convergence error does not have a clear slope, it behaves as expected, with the error decreasing with the addition of basis vectors. It is important to notice that appears to be an optimal value for \(\eta \ne 1\)—the maximum number of basis vectors—where the error reaches the minimum; considering that this results occur near \(\eta =1\), we believe it can attributed to an overfitting phenomenon. The same idea is explored in [24, 25], where it is attributed to a lack of smoothness or noisiness in low energy basis vectors. The overall results for the hyper-ROM seem adequate, given that the error is the same order of the ROM and the coarse mesh FOM solutions.

To evaluate the temporal evolution we perform a discrete Fourier transform of the Nusselt number. In Figs. 8 and 9 we compare the Nusselt number spectra for the hot and cold walls respectively.

Again we see how reducing the amount of basis vectors leads to a more diffusive solution. But in contrast to Fig. 7, in Nusselt number spectra we observe that the ROM and hyper-ROM spectra tend to the FOM spectra as we approach \(\eta =1\).

Regarding computational time, Fig. 10 shows speedup for all the cases under the same initial conditions, time step, and computer configuration. As expected the computational time is reduced when the coarser mesh is used. It is important to note that the computational time for the ROM and hyper-ROM is decreased not only by the solution of a smaller linear system but as well for having fewer non-linear iterations.

Three dimensional case

For the 3D problem, we use 2 uniform structured meshes composed of regular hexahedral elements: one with 64,000 elements and a mesh size \(h=0.025\), used for the solving the FOM and the ROM; and one with 35937 elements and a mesh size \(h=0.\bar{03}\), for solving the hyper-ROM. To construct the basis, we collect 500 snapshots for velocity, pressure and temperature at every 2 time steps in a 10 s interval.

Figure 11 shows a comparison of streamlines of the FOM, ROM and hyper-ROM solutions at the last time step of the simulation.

To test the 3D problem we perform similar tests as the ones in the 2D problem using 6 different sets of bases, varying the retained energy from \(\eta _1=0.99\) to \(\eta _{6}=0.5\) Fig. 12 depicts the number of vectors in the basis as a function of the retained energy.

As in the 2D problem, for the 3D case we compute the Nusselt number, the root mean square of the Nusselt error and the discrete Fourier transform of the Nusselt number for the hot and cold walls, getting similar results.

In Figs. 13 and 14 we compare the Nusselt number spectra for the hot and cold walls. Although the results behave in a similar way as in the 2D case, the ROM and hyper-ROM seems to be more dissipative, in spite of the ratio of the meshes being smaller. We believe this could be attributed to the quality of basis, which directly depends on the quality of the snapshots used to construct it.

Figure 15 shows the root mean square of the Nusselt error for ROM and hyper-ROM, showing similar results as the 2D case, including the overfitting phenomena when the retained energy \(\eta \) approaches 1.

Figure 16 shows speedup for ROM and hyper-ROM solutions. The reduction in the computational time for the 3D problem is larger than the one achieved for the 2D problem, using a similar amount of basis vectors.

In this work we have developed a formulation that allowed us to perform ROMs on the zero Mach number Navier–Stokes approximation. For that purpose we have described a set of tools that allow us to tackle the main problems that arise: lack of stability, added computational cost due to the non-linearities and non-optimal projection over the reduced space.

To solve the added computational cost, we have proposed a mesh-based hyper-ROM that contrary to the traditional sample-based methods, does not require any algorithm to select these sampling points. The numerical experiments performed show that this hyper-ROM method behaves appropriately, only inducing an expected added diffusion to the solution. A natural extension of the mesh-based hyper-ROM method is the use of mesh refinement techniques to improve both the computational time and the accuracy of the method.

Finally, to tackle the non-optimal projection of the non-linear formulation, we give a different interpretation to the Petrov–Galerkin projection—originally described in [7]—in order to include it in our formulation.