A Spectral Element Reduced Basis Method for Navier–Stokes Equations with Geometric Variations

Abstract

We consider the Navier-Stokes equations in a channel with a narrowing of varying height. The model is discretized with high-order spectral element ansatz functions, resulting in 6372 degrees of freedom. The steady-state snapshot solutions define a reduced order space through a standard POD procedure. The reduced order space allows to accurately and efficiently evaluate the steady-state solutions for different geometries. In particular, we detail different aspects of implementing the reduced order model in combination with a spectral element discretization. It is shown that an expansion in element-wise local degrees of freedom can be combined with a reduced order modelling approach to enhance computational times in parametric many-query scenarios.

1 Introduction and Motivation

Spectral element methods (SEM) use high-order polynomial ansatz functions to solve partial differential equations (PDEs) in all fields of science and engineering, see, e.g., [4,5,6,7, 12, 16] and references therein for an overview. Typically, an exponential error decay under p-refinement is observed, which can provide an enhanced accuracy over standard finite element methods at the same computational cost. In the following, we assume that the discretization error is much smaller than the model reduction error, small enough not to interfere with our results. In general, this needs to be established with the use of suitable error estimation and adaptivity techniques.

We consider the flow through a channel with a narrowing of variable height. A reduced order model (ROM) is computed from a few high-order SEM solves, which accurately approximates the high-order solutions for the parameter range of interest, i.e., the different narrowing heights under consideration. Since the parametric variations are affine, a mapping to a reference domain is applied without further interpolation techniques. The focus of this work is to show how to use simulations arising from the SEM solver Nektar++ [3] in a ROM context. In particular, the multilevel static condensation of the high-order solver is not applied, but the ROM projection works with the system matrices in local coordinates. See [12] for further details. This is in contrast to our previous work [8], since numerical experiments have shown that the multilevel static condensation is inefficient in a ROM context. Additionally, we consider affine geometry variations. With SEM as discretization method, we use global approximation functions for the high-order as well as reduced-order methods. The ROM techniques described in this paper are implemented in open-source project ITHACA-SEM.¹

The outline of the paper is as follows. In Sect. 2, the model problem is defined and the geometric variations are introduced. Section 3 provides details on the spectral element discretization, while Sect. 4 describes the model reduction approach and shows the affine mapping to the reference domain. Numerical results are given in Sect. 5, while Sect. 6 summarizes the work and points out future perspectives.

2 Problem Formulation

Let $\Omega \in \mathbb {R}^2$ be the computational domain. Incompressible, viscous fluid motion in spatial domain Ω over a time interval (0, T) is governed by the incompressible Navier-Stokes equations with vector-valued velocity u, scalar-valued pressure p, kinematic viscosity ν and a body forcing f:

$$\displaystyle \begin{aligned} \begin{array}{rcl} \frac{\partial \mathbf{u}}{\partial t} + \mathbf{u} \cdot \nabla \mathbf{u} &\displaystyle =&\displaystyle - \nabla p + \nu \Delta \mathbf{u} + \mathbf{f}, {} \end{array} \end{aligned} $$

(1)

$$\displaystyle \begin{aligned} \begin{array}{rcl} \nabla \cdot \mathbf{u} &\displaystyle =&\displaystyle 0. {} \end{array} \end{aligned} $$

(2)

Boundary and initial conditions are prescribed as

$$\displaystyle \begin{aligned} \begin{array}{rcl} \mathbf{u} &\displaystyle =&\displaystyle \mathbf{d} \quad \text{ on } \Gamma_D \times (0, T), \end{array} \end{aligned} $$

(3)

$$\displaystyle \begin{aligned} \begin{array}{rcl} \nabla \mathbf{u} \cdot \mathbf{n} &\displaystyle =&\displaystyle \mathbf{g} \quad \text{ on } \Gamma_N \times (0, T), \end{array} \end{aligned} $$

(4)

$$\displaystyle \begin{aligned} \begin{array}{rcl} \mathbf{u} &\displaystyle =&\displaystyle {\mathbf{u}}_0 \quad \text{ in } \Omega \times 0, {} \end{array} \end{aligned} $$

(5)

with d, g and u ₀ given and ∂ Ω = Γ_D ∪ Γ_N, Γ_D ∩ Γ_N = ∅. The Reynolds number Re, which characterizes the flow [11], depends on ν, a characteristic velocity U, and a characteristic length L:

$$\displaystyle \begin{aligned} Re = \frac{UL}{\nu}. \end{aligned} $$

(6)

We are interested in computing the steady states, i.e., solutions where $\frac {\partial \mathbf {u}}{\partial t}$ vanishes. The high-order simulations are obtained through time-advancement, while the ROM solutions are obtained with a fixed-point iteration.

2.1 Oseen-Iteration

The Oseen-iteration is a secant modulus fixed-point iteration, which in general exhibits a linear rate of convergence [2]. Given a current iterate (or initial condition) u ^k, the next iterate u ^k+1 is found by solving linear system:

$$\displaystyle \begin{aligned} \begin{array}{rcl} -\nu \Delta {\mathbf{u}}^{k+1} + ({\mathbf{u}}^k \cdot \nabla) {\mathbf{u}}^{k+1} + \nabla p &\displaystyle =&\displaystyle \mathbf{f} \text{ in } \Omega, {} \\ \nabla \cdot {\mathbf{u}}^{k+1} &\displaystyle =&\displaystyle 0 \text{ in } \Omega, \\ {\mathbf{u}}^{k+1} &\displaystyle =&\displaystyle \mathbf{d} \quad \text{ on } \Gamma_D, \\ \nabla {\mathbf{u}}^{k+1} \cdot \mathbf{n} &\displaystyle =&\displaystyle \mathbf{g} \quad \text{ on } \Gamma_N. \end{array} \end{aligned} $$

Iterations are typical stopped when the relative difference between iterates falls below a predefined tolerance in a suitable norm, like the L ²( Ω) or $H^1_0(\Omega )$ norm.

2.2 Model Description

We consider the reference computational domain shown in Fig. 1, which is decomposed into 36 triangular spectral elements. The spectral element expansion uses modal Legendre polynomials of the Koornwinder-Dubiner type of order p = 11 for the velocity. Details on the discretization method can be found in chapter 3.2 of [12]. The pressure ansatz space is chosen of order p − 2 to fulfill the inf-sup stability condition [1, 20]. A parabolic inflow profile is prescribed at the inlet (i.e., x = 0) with horizontal velocity component u _x(0, y) = y(3 − y) for y ∈ [0, 3]. At the outlet (i.e., x = 8) we impose a stress-free boundary condition, everywhere else we prescribe a no-slip condition.

Fig. 1

Reference computational domain for the channel flow, divided into 36 triangles

The height of the narrowing in the reference configuration is μ = 1, from y = 1 to y = 2. See Fig. 1. Parameter μ is considered variable in the interval μ ∈ [0.1, 2.9]. The narrowing is shrunken or expanded as to maintain the geometry symmetric about line y = 1.5. Figures 2, 3, and 4 show the velocity components close to the steady state for μ = 1, 0.1, 2.9, respectively.

Fig. 2

Full order, steady-state solution for μ = 1: velocity in x-direction (top) and y-direction (bottom)

Fig. 3

Full order, steady-state solution for μ = 0.1: velocity in x-direction (top) and y-direction (bottom)

Fig. 4

Full order, steady-state solution for μ = 2.9: velocity in x-direction (top) and y-direction (bottom)

The viscosity is kept constant to ν = 1. For these simulations, the Reynolds number (6) is between 5 and 10, with maximum velocity in the narrowing as characteristic velocity U and the height of the narrowing characteristic length L. For larger Reynolds numbers (about 30), a supercritical pitchfork bifurcation occurs giving rise to the so-called Coanda effect [8, 9, 22], which is not subject of the current study. Our model is similar to the model considered in [18], i.e. an expansion channel with an inflow profile of varying height. However, in [18] the computational domain itself does not change.

3 Spectral Element Full Order Discretization

The Navier-Stokes problem is discretized with the spectral element method. The spectral/hp element software framework used is Nektar++ in version 4.4.0.² The discretized system of size N _δ to solve at each step of the Oseen-iteration for fixed μ can be written as

$$\displaystyle \begin{aligned} \begin{array}{rcl} \begin{bmatrix} \begin{array}{ccc} A & -D^T_{bnd} & B \\ -D_{bnd} & 0 & -D_{int} \\ \tilde{B}^T & -D^T_{int} & C \end{array} \end{bmatrix} \begin{bmatrix} \begin{array}{ccc} {\mathbf{v}}_{bnd} \\ \mathbf{p} \\ {\mathbf{v}}_{int} \end{array} \end{bmatrix} &= \begin{bmatrix} \begin{array}{ccc} {\mathbf{f}}_{bnd} \\ \mathbf{0} \\ {\mathbf{f}}_{int} \end{array} \end{bmatrix}, {} \end{array} \end{aligned} $$

(7)

where v _bnd and v _int denote velocity degrees of freedom on the boundary and in the interior of the domain, respectively, while p denotes the pressure degrees of freedom. The forcing terms on the boundary and interior are denoted by f _bnd and f _int, respectively. The matrix A assembles the boundary-boundary coupling, B the boundary-interior coupling, $\tilde {B}$ the interior-boundary coupling, and C assembles the interior-interior coupling of elemental velocity ansatz functions. In the case of a Stokes system, it holds that $B = \tilde {B}^T$, but this is not the case for the Oseen equation because of the linearized convective term. The matrices D _bnd and D _int assemble the pressure-velocity boundary and pressure-velocity interior contributions, respectively.

The linear system (7) is assembled in local degrees of freedom, resulting in block matrices $A, B, \tilde {B}, C, D_{bnd}$ and D _int, each block corresponding to a spectral element. This allows for an efficient matrix assembly since each spectral element is independent from the others, but makes the system singular. In order to solve the system, the local degrees of freedom need to be gathered into the global degrees of freedom [12].

The high-order element solver Nektar++ uses a multilevel static condensation for the solution of linear systems like (7). Since static condensation introduces intermediate parameter-dependent matrix inversions (such as C ⁻¹ in this case) several intermediate projection spaces need to be introduced to use model order reduction [8]. This can be avoided by instead projecting the expanded system (7) directly. The internal degrees of freedom do not need to be gathered, since they are the same in local and global coordinates. Only ansatz functions extending over multiple spectral elements need to be gathered.

Next, we will take the boundary-boundary coupling across element interfaces into account. Let M denote the rectangular matrix which gathers the local boundary degrees of freedom into global boundary degrees of freedom. Multiplication of the first row of (7) by M ^T M will then set the boundary-boundary coupling in local degrees of freedom:

$$\displaystyle \begin{aligned} \begin{array}{rcl} \begin{bmatrix} \begin{array}{ccc} M^T M A & -M^T M D^T_{bnd} & M^T M B \\ -D_{bnd} & 0 & -D_{int} \\ \tilde{B}^T & -D^T_{int} & C \end{array} \end{bmatrix} \begin{bmatrix} \begin{array}{ccc} {\mathbf{v}}_{bnd} \\ \mathbf{p} \\ {\mathbf{v}}_{int} \end{array} \end{bmatrix} &= \begin{bmatrix} \begin{array}{ccc} M^T M {\mathbf{f}}_{bnd} \\ \mathbf{0} \\ {\mathbf{f}}_{int} \end{array} \end{bmatrix} . {} \end{array} \end{aligned} $$

(8)

The action of the matrix in (8) on the degrees of freedom on the Dirichlet boundary is computed and added to the right hand side. Such degrees of freedom are then removed from (8). The resulting system can then be used in a projection-based ROM context [13], of high-order dimension N _δ × N _δ and depending on the parameter μ:

$$\displaystyle \begin{aligned} \begin{array}{rcl} \mathcal{A}(\mu) \mathbf{x}(\mu) = \mathbf{f}. {} \end{array} \end{aligned} $$

(9)

4 Reduced Order Model

The reduced order model (ROM) computes accurate approximations to the high-order solutions in the parameter range of interest, while greatly reducing the overall computational time. This is achieved by two ingredients. First, a few high-order solutions are computed and the most significant proper orthogonal decomposition (POD) modes are obtained [13]. These POD modes define the reduced order ansatz space of dimension N, in which the system is solved. Second, to reduce the computational time, an offline-online computational procedure is used. See Sect. 4.1.

The POD computes a singular value decomposition of the snapshot solutions to 99.99% of the most dominant modes [10], which define the projection matrix $U \in \mathbb {R}^{N_\delta \times N}$ used to project system (9):

$$\displaystyle \begin{aligned} \begin{array}{rcl} U^T \mathcal{A}(\mu) U {\mathbf{x}}_N(\mu) = U^T \mathbf{f} . {} \end{array} \end{aligned} $$

(10)

The low order solution x _N(μ) then approximates the high order solution as x(μ) ≈ U x _N(μ).

4.1 Offline-Online Decomposition

The offline-online decomposition [10] enables the computational speed-up of the ROM approach in many-query scenarios. It relies on an affine parameter dependency, such that all computations depending on the high-order model size can be moved into a parameter-independent offline phase, while having a fast input-output evaluation online.

In the example under consideration here, the parameter dependency is already affine and a mapping to the reference domain can be established without using an approximation technique such as the empirical interpolation method. Thus, there exists an affine expansion of the system matrix $\mathcal {A}(\mu )$ in the parameter μ as

$$\displaystyle \begin{aligned} \begin{array}{rcl} \mathcal{A}(\mu) = \sum_{i=1}^Q \Theta_i(\mu) \mathcal{A}_i. {} \end{array} \end{aligned} $$

(11)

The coefficients Θ_i(μ) are computed from the mapping $\mathbf {x} = T_k(\mu ) \hat {\mathbf {x}} + {\mathbf {g}}_k$, $T_k \in \mathbb {R}^{2 \times 2}$, ${\mathbf {g}}_k \in \mathbb {R}^{2}$, which maps the deformed subdomain $\hat {\Omega }_k$ to the reference subdomain Ω_k. See also [19, 21]. Figure 5 shows the reference subdomains Ω_k for the problem under consideration.

Fig. 5

Reference computational domain with subdomains Ω₁ (green), Ω₂ (yellow), Ω₃ (blue), Ω₄ (grey) and Ω₅ (brown)

For each subdomain $\hat {\Omega }_k$ the elemental basis function evaluations are transformed to the reference domain. For each velocity basis function u = (u ₁, u ₂), v = (v ₁, v ₂), w = (w ₁, w ₂) and each (scalar) pressure basis function ψ, we can write the transformation with summation convention as:

$$\displaystyle \begin{aligned} \begin{array}{rcl} \int_{\hat{\Omega}_k} \frac{\partial \hat{\mathbf{u}}}{\partial \hat{x}_i} \hat{\nu}_{ij} \frac{\partial \hat{\mathbf{v}}}{\partial \hat{x}_j} d \hat{\Omega}_k &\displaystyle =&\displaystyle \int_{\Omega_k} \frac{\partial \mathbf{u}}{\partial x_i} \nu_{ij} \frac{\partial \mathbf{v}}{\partial x_j} d \Omega_k, \\ \int_{\hat{\Omega}_k} \hat{\psi} \nabla \cdot \hat{\mathbf{u}} d \hat{\Omega}_k &\displaystyle =&\displaystyle \int_{\Omega_k} \psi \chi_{ij} \frac{\partial u_j}{\partial x_i} d \Omega_k, \\ \int_{\hat{\Omega}_k} (\hat{\mathbf{u}} \cdot \nabla) \hat{\mathbf{v}} \cdot \hat{\mathbf{w}} d \hat{\Omega}_k &\displaystyle =&\displaystyle \int_{\Omega_k} u_i \pi_{ij} \frac{\partial v_j}{\partial x_i} \mathbf{w} d \Omega_k, {} \end{array} \end{aligned} $$

with

$$\displaystyle \begin{aligned} \begin{array}{rcl} \nu_{ij} &\displaystyle =&\displaystyle T_{ii'} \hat{\nu}_{i'j'} T_{jj'} \det(T)^{-1}, \\ \chi_{ij} &\displaystyle =&\displaystyle \pi_{ij} = T_{ij} \det(T)^{-1}. \end{array} \end{aligned} $$

The subdomain Ω₅ (see Fig. 5) is kept constant, so that no interpolation of the inflow profile is necessary. To achieve fast reduced order solves, the offline-online decomposition expands the system matrix as in (11) and computes the parameter independent projections offline, which are stored as small-sized matrices of the order N × N. Since in an Oseen-iteration each matrix is dependent on the previous iterate, the submatrices corresponding to each basis function are assembled and then formed online using the reduced basis coordinate representation of the current iterate. This is the same procedure used for the assembly of the nonlinear term in the Navier-Stokes case [13].

5 Numerical Results

The accuracy of the ROM is assessed using 40 snapshots sampled uniformly over the parameter domain [0.1, 2.9] for the POD and 40 randomly chosen parameter locations to test the accuracy. Figure 6 (left) shows the decay of the energy of the POD modes. To reach the typical threshold of 99.99% on the POD energy, it takes 9 POD modes as RB ansatz functions. Figure 6 (right) shows the relative L ²( Ω) approximation error of the reduced order model with respect to the full order model up to 6 digits of accuracy, evaluated at the 40 randomly chosen verification parameter locations. With 9 POD modes the maximum approximation error is less than 0.7% and the mean approximation error is less than 0.5%.

Fig. 6

Left: Decay of POD mode energy. Right: Maximum (red) and mean (blue) relative L ²( Ω) error for the velocity over increasing reduced basis dimension

While the full-order solves were computed with Nektar++, the reduced-order computations were done in ITHACA-SEM with a separate python code. To assess the computational gain, the time for a fixed point iteration step using the full-order system is compared to the time for a fixed point iteration step of the ROM with dimension 20, both done in python. The ROM online phase reduces the computational time by a factor of over 100. The offline time is dominated by computing the snapshots and the trilinear forms used to project the advection terms. See [13] for detailed explanations.

6 Conclusion and Outlook

We showed that the POD reduced basis technique generates accurate reduced order models for SEM discretized models under parametric variation of the geometry. The potential of a high-order spectral element method with a reduced basis ROM is the subject of current investigations. See also [6]. Since each spectral element comprises a block in the system matrix in local coordinates, a variant of the reduced basis element method (RBEM) [14, 15] can be successfully applied in the future.