betaFeedback

WorksComputer Science

Hyper-reduction methods for accelerating nonlinear finite element simulations: open source implementation and reproducible benchmarks

Abstract

Hyper-reduction methods have gained increasing attention for their potential to accelerate reduced order models for nonlinear systems, yet their comparative accuracy and computational efficiency are not well understood. Motivated by this gap, we evaluate a range of hyper-reduction techniques for nonlinear finite element models across benchmark problems of varying complexity, assessing the inevitable tradeoff between accuracy and speedup. More specifically, we consider interpolation methods based on the gappy proper orthogonal decomposition as well as the empirical quadrature procedure (EQP), and apply them to the hyper-reduction of problems in nonlinear diffusion, nonlinear elasticity and Lagrangian hydrodynamics. Our numerical results are generated using the open source libROM, Laghos and MFEM numerical libraries. Our findings reveal that the comparative performance between hyper-reduction methods depends on both the problem and the choice of time integration method. The EQP method generally achieves lower relative errors than interpolation methods and is more efficient in terms of quadrature point usage, resulting in a lower wall time for the nonlinear diffusion and elasticity problems. However, its online computational cost is observed to be relatively high for Lagrangian hydrodynamics problems. Conversely, interpolation methods exhibit greater variability, especially with respect to the use of different time integration methods in the Lagrangian hydrodynamics problems. The presented results underscore the need for problem specific method selection to balance accuracy and efficiency, while also offering useful guidance for future comparisons and refinements of hyper-reduction techniques.

Introduction

Partial differential equations (PDEs) are employed in numerous scientific fields to model the behavior of spatiotemporal systems. Despite their vast utility, only a few PDEs of practical interest have known analytical solutions under general conditions. As such, in most applications approximate PDE solutions are sought by various discretization methods, such as the finite differences method or the finite element method (FEM). In this study we consider the spatial discretization of time-dependent PDEs with algebraic constraints, resulting in systems of semi-explicit differential-algebraic equations (DAEs)

Mdydt+Ay+Bz=f(y,z,t,μ)BTy+Cz=g(y,z,t,μ)y(0)=y0(1)\begin{aligned} \mathbf{M}\frac{\mathrm{d}\mathbf{y}}{\mathrm{d}t}+\mathbf{A}\mathbf{y}+\mathbf{B}\mathbf{z}&=\mathbf{f}(\mathbf{y},\mathbf{z},t,\mu) \\ \mathbf{B}^{\mathsf{T}}\mathbf{y}+\mathbf{C}\mathbf{z}&=\mathbf{g}(\mathbf{y},\mathbf{z},t,\mu) \\ \mathbf{y}(0)&=\mathbf{y}_0 \tag*{(1)} \end{aligned}

where t∈[0,T]t \in[0,T] denotes time and μ∈D\mu\in\mathcal{D} denotes physical parameters driving the system. The unknowns in the system include the differential variable y(μ):[0,T]→RNy\mathbf{y}(\mu):[0,T]\to\mathbb{R}^{N_y}, with a prescribed initial condition y0(μ)∈RNy\mathbf{y}_0(\mu)\in\mathbb{R}^{N_y}, and the algebraic variable z(μ):[0,T]→RNz\mathbf{z}(\mu):[0,T]\to\mathbb{R}^{N_z}. Moreover, M∈RNy×Ny\mathbf{M}\in\mathbb{R}^{N_y\times N_y} is the system mass matrix, A∈RNy×Ny\mathbf{A}\in\mathbb{R}^{N_y\times N_y}, C∈RNz×Nz\mathbf{C}\in\mathbb{R}^{N_z\times N_z} are linear operator matrices, and B∈RNy×Nz\mathbf{B}\in\mathbb{R}^{N_y\times N_z} is a constraint matrix. These matrices are assumed to be independent of physical parameters μ\mu throughout the paper. Finally, f:RNy×RNz×[0,T]×D→RNy\mathbf{f}:\mathbb{R}^{N_y}\times\mathbb{R}^{N_z}\times[0,T]\times\mathcal{D}\to\mathbb{R}^{N_y} and g:RNy×RNz×[0,T]×D→RNz\mathbf{g}:\mathbb{R}^{N_y}\times\mathbb{R}^{N_z}\times[0,T]\times\mathcal{D}\to\mathbb{R}^{N_z} are nonlinear functions.

Time integration schemes such as multistep and Runge-Kutta methods can be used to solve the ODE part of the semi-explicit DAE system in (1), with z\mathbf{z} solved algebraically. However, for many important physical systems the associated PDEs are nonlinear and require a fine mesh to resolve the solution, rendering the numerical modeling of such systems computationally expensive. This expense is compounded in multi-query applications such as PDE-constrained optimization [1, 2, 3, 4] where a large number of repeated PDE solves are necessary. For instance, design optimization of inertial confinement fusion experiments requires the determination of more than a dozen independent parameters. Depending on the fidelity of the physics model, each forward simulation takes a few minutes to hundreds of CPU hours to complete [5]. When employing a simple gradient based optimization algorithm, finite difference approximation of the objective function gradient requires as many radiation hydrodynamics simulations as the dimension of the parameter search space, resulting in prohibitively high computational cost for every parameter update.

For these reasons, it is of great interest to develop methodologies that accelerate the solving of large-scale nonlinear PDEs. One such methodology is reduced order modeling, where a full order model (FOM) is approximated with an accurate but computationally inexpensive reduced order model (ROM). ROMs can be divided into two main classes: data based and physics based. Purely data based methods such as dynamic mode decomposition (DMD) [6, 7] or neural network approximation [8, 9] have the benefit of not requiring prior knowledge of the PDE problem specification. However, they typically do not make accurate predictions in extrapolation and are not robust to noisy input data [10]. On the other hand, physics based ROM approaches incorporate prior knowledge into the ROM formulation and typically fare better in terms of generalization than purely data based approaches [10]. Physics based ROM approaches include physics informed neural networks [11], neural operators [12] and projection based reduced order models (pROMs), which are the class of ROMs studied in this paper. At a high level, a pROM projects the PDE onto a low dimensional subspace which approximates the PDE solution space. The projected PDE is then solved in subspace coordinates, leading to reduced computational cost. For a more comprehensive description of pROMs we refer the reader to the survey papers [13, 14].

Projection based ROMs have been shown to efficiently accelerate the solving of physics problems such as the Burgers equation [15, 16, 17, 18], the Navier-Stokes equations [19, 20], nonlinear diffusion problems [21, 22], convection-diffusion problems [23], the shallow water equations [24, 25], the Euler equations [26, 27, 28], wave problems [29, 30], Boltzmann transport problems [31] and the Schrödinger equation [32]. In addition, pROMs can enable substantial speed-up in design optimization problems such as lattice structure design [33], flutter avoidance wing shape optimization [34], topology optimization of wind turbine blades [35], reservoir simulations [36, 37, 38] and rocket nozzle shape design [39].

In the standard pROM formulation, the effects of the nonlinear terms f\mathbf{f} and g\mathbf{g} in the ROM subspaces are evaluated on the FOM mesh. This causes the pROM computational cost to scale with the FOM size, significantly reducing their efficiency. Hyper-reduction methods address this issue by approximating the nonlinear terms through evaluation at a reduced set of sample points, thereby achieving substantial computational speedup while maintaining a low approximation error. As indicated in [40], hyper-reduction methods can be broadly classified into two categories. The first category consists of interpolation or “approximate-then-project” methods, which interpolate the nonlinear terms at a subset of selected nodes before projecting them onto the reduced-order basis (ROB). This class of methods originates in the gappy proper orthogonal decomposition (POD) approach [41], which reconstructs high dimensional data using empirical basis functions. These methods rely on interpolation based approximations, where different sampling methods [42, 43, 44, 45, 46, 47] are introduced to select interpolation points for optimizing the tradeoff between accuracy and speedup. The second category comprises quadrature or “project-then-approximate” methods, which directly approximate the reduced nonlinear terms by constructing sparse quadrature rules. These methods can be viewed as data based quadrature techniques, where both the sample points and associated weights are optimized using training data. Examples include the seminal work by An et al. [48], the energy-conserving sampling and weighting method [49], the empirical cubature method [50] and the empirical quadrature procedure (EQP) [51, 52].

Given that hyper-reduction methods are being employed in applications across various domains, a comprehensive comparative analysis of their accuracy and efficiency is of significant interest. Existing works have provided valuable insights into specific hyper-reduction techniques, with recent efforts focusing on a single application at a time, such as nonlinear heat conduction [22, 53], magneto-mechanics [54, 55] and the Navier-Stokes equations [56].

In the present study we undertake a detailed empirical comparison of several hyper-reduction methods by applying them to a diverse selection of problem cases. More specifically, from the class of interpolation methods, we consider the Discrete Empirical Interpolation Method (DEIM) [43, 44], its subsequent development Q-DEIM [45], and S-OPT [47]. These methods were selected to capture distinct interpolation-based sampling strategies: DEIM serves as a widely adopted baseline, Q-DEIM improves the numerical conditioning of the interpolation operator through rank-revealing QR factorization, and S-OPT employs an optimization-based sampling procedure inspired by sensor placement and uncertainty quantification. For the class of quadrature methods, we consider EQP [52], which constructs sparse quadrature rules through non-negative least-squares optimization and has emerged as a widely used approach for hyper-reduction of nonlinear finite element simulations. Throughout this study, a two-stage workflow is employed to formulate and evaluate hyper-reduced projection-based ROMs. The workflow is split into an offline and an online stage, illustrated in Figure 1. First, the offline stage collects snapshots of FOM problem simulations, parameterized by μ\mu. From the snapshots, the linear ROM basis is formed by POD. The FOM snapshots are additionally utilized in initializing the chosen hyper-reduction method. In the second online stage, the ROM is used to make accelerated predictions, again parameterized by μ\mu. We apply the hyper-reduction methods in this study to three distinct and challenging nonlinear benchmark problems discretized by finite element methods: nonlinear diffusion, nonlinear elasticity, and Lagrangian hydrodynamics. The main features of our work are summarized below.

ROM workflow stages

Figure 1. ROM workflow stages

  1. Comparison. We present a broad comparison of hyper-reduction methods, including both interpolation and quadrature methods.

  1. Application. We evaluate each considered hyper-reduction method on three application domains with distinct challenges, revealing tradeoffs between accuracy and computational speedup.

  1. Open source implementation. We employ an open source numerical implementation of all hyper-reduction methods and problem cases considered in this work, using

the libROM [57], Laghos [58] and MFEM [59] numerical libraries and providing the commands that can be used for their reproduction.

The remainder of the paper is structured as follows. § 2 introduces a unified variational framework to describe the example problems and discusses their finite element discretization. § 3 serves as an introduction to the pROM approach used for the linear part of the ROM formulation. § 4 presents the different hyper-reduction methods compared in this work, which are used to approximate the evaluation of nonlinear terms. § 5 describes the example problems and presents our numerical results, followed by a discussion in § 6. Finally, Appendix § 9 provides details on how to reproduce our numerical results.

Finite element discretization

Considering (1) in a variational setting, we seek y(μ)∈L2(0,T;Y)y(\mu) \in L^2(0,T;\mathcal{Y}) and z(μ)∈L2(0,T;Z)z(\mu) \in L^2(0,T;\mathcal{Z}) such that dy(μ)/dt∈L2(0,T;Y′)\mathrm{d}y(\mu)/\mathrm{d}t \in L^2(0,T;\mathcal{Y}'), where H\mathcal{H} and Z\mathcal{Z} are Hilbert spaces and Y⊂H⊂Y′\mathcal{Y} \subset\mathcal{H} \subset\mathcal{Y}' forms a Gelfand triple (rigged Hilbert space). In addition, we ask that the following equations be satisfied for any φ∈Y\varphi\in\mathcal{Y} and λ∈Z\lambda\in\mathcal{Z}

ddt(y,φ)H+a(y,φ)+b(φ,z)=⟨f(y,z,t,μ),φ⟩Y′×Yb(y,λ)+c(z,λ)=⟨g(y,z,t,μ),λ⟩Z′×Z(2)\begin{aligned} \frac{\mathrm{d}}{\mathrm{d}t}(y,\varphi)_{\mathcal{H}} + a(y,\varphi) + b(\varphi,z) &= \langle f(y,z,t,\mu),\varphi\rangle_{\mathcal{Y}'\times\mathcal{Y}} \\ b(y,\lambda) + c(z,\lambda) &= \langle g(y,z,t,\mu),\lambda\rangle_{\mathcal{Z}'\times\mathcal{Z}} \tag*{(2)} \end{aligned}

where ⟨⋅,⋅⟩Y′×Y\langle\cdot,\cdot\rangle_{\mathcal{Y}'\times\mathcal{Y}} denotes the duality pairing between Y′\mathcal{Y}' and Y\mathcal{Y} and (⋅,⋅)H(\cdot,\cdot)_{\mathcal{H}} the scalar product on H\mathcal{H}. Additionally, a:Y×Y→Ra:\mathcal{Y}\times\mathcal{Y}\to\mathbb{R}, b:Y×Z→Rb:\mathcal{Y}\times\mathcal{Z}\to\mathbb{R} and c:Z×Z→Rc:\mathcal{Z}\times\mathcal{Z}\to\mathbb{R} denote bilinear forms, while f:Y×Z×[0,T]×D→Y′f:\mathcal{Y}\times\mathcal{Z}\times[0,T]\times\mathcal{D}\to\mathcal{Y}' and g:Y×Z×[0,T]×D→Z′g:\mathcal{Y}\times\mathcal{Z}\times[0,T]\times\mathcal{D}\to\mathcal{Z}' are general nonlinear functions.

The spatial discretization of (2) is carried out using the finite element method, the result of which is the system of differential-algebraic equations presented in (1). To that end, let BY={φj}j=1Ny\mathcal{B}_{\mathcal{Y}}=\{\varphi_j\}_{j=1}^{N_y} be a basis for a Y\mathcal{Y}-conforming finite element space Yh\mathcal{Y}^h, with LBY:Yh→RNyL_{\mathcal{B}_{\mathcal{Y}}}:\mathcal{Y}^h\to\mathbb{R}^{N_y} the coordinate representation of Yh\mathcal{Y}^h with respect to BY\mathcal{B}_{\mathcal{Y}}. We denote the finite element approximation yh(μ)∈Yhy_h(\mu) \in\mathcal{Y}^h of y(μ)y(\mu) by

yh(t;μ)=∑j=1Nyyj(t;μ)φj.y_h(t;\mu)=\sum_{j=1}^{N_y}y_j(t;\mu)\varphi_j.

Similarly, for the algebraic variables let BZ={λj}j=1Nz\mathcal{B}_Z=\{\lambda_j\}_{j=1}^{N_z} be a basis for a Z\mathcal{Z}-conforming finite element space Zh\mathcal{Z}^h, with LBZ:Zh→RNzL_{\mathcal{B}_Z}:\mathcal{Z}^h\to\mathbb{R}^{N_z} the coordinate representation of Zh\mathcal{Z}^h with respect to BZ\mathcal{B}_Z. The finite element approximation zh(μ)∈Zhz_h(\mu)\in\mathcal{Z}^h of z(μ)z(\mu) is denoted by

zh(t;μ)=∑j=1Nzzj(t;μ)λj.z_h(t;\mu)=\sum_{j=1}^{N_z}z_j(t;\mu)\lambda_j.

Then the differential variable vector y=LBY(yh)\mathbf{y}=L_{\mathcal{B}_Y}(y_h) and the algebraic variable vector z=LBZ(zh)\mathbf{z}=L_{\mathcal{B}_Z}(z_h) satisfy (1), wherein the matrix representations are defined entrywise by

Mj,j′=(φj′,φj)HAj,j′=a(φj′,φj)Bj,j′=b(φj′,λj)Cj,j′=c(λj′,λj)(3)\begin{aligned} M_{j,j'}&=(\varphi_{j'},\varphi_j)_{\mathcal{H}} & A_{j,j'}&=a(\varphi_{j'},\varphi_j)\\ B_{j,j'}&=b(\varphi_{j'},\lambda_j) & C_{j,j'}&=c(\lambda_{j'},\lambda_j) \tag*{(3)} \end{aligned}

and can often be computed exactly, and the vector representations are computed as a semi-discretization of the nonlinear functions acting on the test functions,

fj(y,z,t,μ)≈⟨f(LBY−1(y),LBZ−1(z),t,μ),φj⟩Y′×Ygj(y,z,t,μ)≈⟨g(LBY−1(y),LBZ−1(z),t,μ),λj⟩Z′×Z.(4)\begin{aligned} f_j(\mathbf{y},\mathbf{z},t,\mu)&\approx\left\langle f\left(L_{\mathcal{B}_Y}^{-1}(\mathbf{y}),L_{\mathcal{B}_Z}^{-1}(\mathbf{z}),t,\mu\right),\varphi_j\right\rangle_{\mathcal{Y}'\times\mathcal{Y}}\\ g_j(\mathbf{y},\mathbf{z},t,\mu)&\approx\left\langle g\left(L_{\mathcal{B}_Y}^{-1}(\mathbf{y}),L_{\mathcal{B}_Z}^{-1}(\mathbf{z}),t,\mu\right),\lambda_j\right\rangle_{\mathcal{Z}'\times\mathcal{Z}}. \tag*{(4)} \end{aligned}

As in many applications, we assume that the nonlinear residual functionals admit local integral representations over subdomains of the spatial domain Ω\Omega. More precisely, we assume the existence of nonlinear densities ηf:Yh×Zh×[0,T]×D×Ω→[Yh]′\eta_f:\mathcal{Y}^h\times\mathcal{Z}^h\times[0,T]\times\mathcal{D}\times\Omega\to[\mathcal{Y}^h]' and ηg:Yh×Zh×[0,T]×D×Ω→[Zh]′\eta_g:\mathcal{Y}^h\times\mathcal{Z}^h\times[0,T]\times\mathcal{D}\times\Omega\to[\mathcal{Z}^h]' such that the nonlinear vectors can be assembled from their action on the finite element test functions. Using numerical quadrature, these actions are approximated by

fj(y,z,t,μ)=∑k=1Kfρk(f)⟨ηf(LBY−1(y),LBZ−1(z),t,μ,xk(f)),φj⟩[Yh]′×Yhgj(y,z,t,μ)=∑k=1Kgρk(g)⟨ηg(LBY−1(y),LBZ−1(z),t,μ,xk(g)),λj⟩[Zh]′×Zh.(5)\begin{aligned} f_j(\mathbf{y},\mathbf{z},t,\mu)&=\sum_{k=1}^{K_f}\rho_k^{(f)}\left\langle\eta_f\left(L_{\mathcal{B}_Y}^{-1}(\mathbf{y}),L_{\mathcal{B}_Z}^{-1}(\mathbf{z}),t,\mu,x_k^{(f)}\right),\varphi_j\right\rangle_{[\mathcal{Y}^h]'\times\mathcal{Y}^h}\\ g_j(\mathbf{y},\mathbf{z},t,\mu)&=\sum_{k=1}^{K_g}\rho_k^{(g)}\left\langle\eta_g\left(L_{\mathcal{B}_Y}^{-1}(\mathbf{y}),L_{\mathcal{B}_Z}^{-1}(\mathbf{z}),t,\mu,x_k^{(g)}\right),\lambda_j\right\rangle_{[\mathcal{Z}^h]'\times\mathcal{Z}^h}. \tag*{(5)} \end{aligned}

where ρk(f)>0\rho_k^{(f)}>0 and ρk(g)>0\rho_k^{(g)}>0 denote quadrature weights, and xk(f)x_k^{(f)} and xk(g)x_k^{(g)} the associated quadrature points.

Projection based reduction

As mentioned in § 1, solving (1) can be computationally expensive when the FOM dimension Ny+NzN_y+N_z is very large. In such cases, the solution procedure can be accelerated by projecting the PDE to the affine subspaces yoffset+Yry_{\mathrm{offset}}+\mathcal{Y}^r and zoffset+Zrz_{\mathrm{offset}}+\mathcal{Z}^r for the differential and algebraic variables respectively, where

dim⁡(Yr)=ry≪Ny=dim⁡(Yh)dim⁡(Zr)=rz≪Nz=dim⁡(Zh)(6)\begin{aligned} \dim(\mathcal{Y}^r)&=r_y\ll N_y=\dim(\mathcal{Y}^h)\\ \dim(\mathcal{Z}^r)&=r_z\ll N_z=\dim(\mathcal{Z}^h) \tag*{(6)} \end{aligned}

with yoffset∈Yhy_{\mathrm{offset}}\in\mathcal{Y}^h and zoffset∈Zhz_{\mathrm{offset}}\in\mathcal{Z}^h denoting the prescribed offsets. The subspaces Yr\mathcal{Y}^r and Zr\mathcal{Z}^r are spanned by the sets of basis vectors {ψj}j=1ry⊂Yh\{\psi_j\}_{j=1}^{r_y}\subset\mathcal{Y}^h and {θj}j=1rz⊂Zh\{\theta_j\}_{j=1}^{r_z}\subset\mathcal{Z}^h respectively

Yr=span⁡{ψj}j=1ry⊆YhZr=span⁡{θj}j=1rz⊆Zh.(7)\begin{aligned} \mathcal{Y}^r&=\operatorname{span}\{\psi_j\}_{j=1}^{r_y}\subseteq\mathcal{Y}^h\\ \mathcal{Z}^r&=\operatorname{span}\{\theta_j\}_{j=1}^{r_z}\subseteq\mathcal{Z}^h. \tag*{(7)} \end{aligned}

The differential and algebraic state vector are then approximated using the subspace basis vectors

y(t;μ)≈y~(t;μ)=yoffset+∑j=1ryy^j(t;μ)ψjz(t;μ)≈z~(t;μ)=zoffset+∑j=1rzz^j(t;μ)θj,(8)\begin{aligned} y(t;\mu)&\approx\widetilde{y}(t;\mu)=y_{\mathrm{offset}}+\sum_{j=1}^{r_y}\widehat{y}_j(t;\mu)\psi_j\\ z(t;\mu)&\approx\widetilde{z}(t;\mu)=z_{\mathrm{offset}}+\sum_{j=1}^{r_z}\widehat{z}_j(t;\mu)\theta_j, \tag*{(8)} \end{aligned}

and it suffices to solve for the vectors of generalized coordinates of the differential and algebraic variables

y^(μ)=(y^1,…,y^ry)⊤:[0,T]→Rryz^(μ)=(z^1,…,z^rz)⊤:[0,T]→Rrz.\widehat{y}(\mu)=(\widehat{y}_1,\ldots,\widehat{y}_{r_y})^\top:[0,T]\to\mathbb{R}^{r_y}\qquad \widehat{z}(\mu)=(\widehat{z}_1,\ldots,\widehat{z}_{r_z})^\top:[0,T]\to\mathbb{R}^{r_z}.

To achieve the desired computational acceleration, ROMs typically leverage an offline-online splitting paradigm. In the offline phase (§ 3.1), which is performed once, computationally expensive tasks such as high-fidelity snapshots generation and basis construction are executed. In contrast, the online phase (§ 3.2) utilizes these precomputed quantities to assemble and solve the low-dimensional system for any new parameter configuration or time step, at a significantly lower computational cost than the offline phase. The specific procedures and computational complexities of these two phases are detailed in the subsequent subsections.

Offline phase

The offline phase is a one-time procedure aimed at constructing the low-dimensional subspaces Yr\mathcal{Y}^r and Zr\mathcal{Z}^r. To computationally manipulate the finite element functions introduced in (7), we first map them to their corresponding algebraic coordinate vectors in the Euclidean space via the isomorphisms LBY:Yh→RNyL_{B_Y}:\mathcal{Y}^h\to\mathbb{R}^{N_y} and LBZ:Zh→RNzL_{B_Z}:\mathcal{Z}^h\to\mathbb{R}^{N_z}. Specifically, the prescribed offsets are mapped as

yoffset=LBY(yoffset)∈RNyzoffset=LBZ(zoffset)∈RNz.y_{\mathrm{offset}}=L_{B_Y}(y_{\mathrm{offset}})\in\mathbb{R}^{N_y}\qquad z_{\mathrm{offset}}=L_{B_Z}(z_{\mathrm{offset}})\in\mathbb{R}^{N_z}.

To find an optimal choice for {ψj}j=1ry\{\psi_j\}_{j=1}^{r_y} and {θj}j=1rz\{\theta_j\}_{j=1}^{r_z}, one can follow the Proper Orthogonal Decomposition (POD) procedure. High-fidelity FOM simulations are conducted over a selected training set of parameters. For notational simplicity, each different variable snapshot is identified by a single index 1≤s≤Ns(y)1 \le s \le N_s^{(y)}, and represented by a triplet (ys,tℓ(y),μm(y))∈Yh×[0,T]×D(y_s,t_{\ell_{(y)}},\mu_{m_{(y)}}) \in\mathcal{Y}^h \times[0,T] \times\mathcal{D}, where tℓ(y)t_{\ell_{(y)}} is the corresponding time instance and μm(y)\mu_{m_{(y)}} is the corresponding parameter where ss-th state snapshot is simulated. Similarly, each algebraic variable snapshot is represented by a triplet (zs,tℓ(z),μm(z))∈Zh×[0,T]×D(z_s,t_{\ell_{(z)}},\mu_{m_{(z)}}) \in\mathcal{Z}^h \times[0,T] \times\mathcal{D}, for 1≤s≤Ns(z)1 \le s \le N_s^{(z)}. From these snapshots, we collect the vector representation of the differential and algebraic variables and decentralize:

Sy=[LBy(y1)−yoffset,…,LBy(yNs(y))−yoffset]∈RNy×Ns(y),\mathbf{S}_y = [L_{B_y}(y_1)-\mathbf{y}_{\mathrm{offset}},\ldots,L_{B_y}(y_{N_s^{(y)}})-\mathbf{y}_{\mathrm{offset}}] \in\mathbb{R}^{N_y \times N_s^{(y)}},
Sz=[LBz(z1)−zoffset,…,LBz(zNs(z))−zoffset]∈RNz×Ns(z).\mathbf{S}_z = [L_{B_z}(z_1)-\mathbf{z}_{\mathrm{offset}},\ldots,L_{B_z}(z_{N_s^{(z)}})-\mathbf{z}_{\mathrm{offset}}] \in\mathbb{R}^{N_z \times N_s^{(z)}}.

The reduced bases can be subsequently extracted by performing a thin singular value decomposition (SVD) on these snapshot matrices:

Sy=UyΣyVyTSz=UzΣzVzT,(9)\mathbf{S}_y = \mathbf{U}_y\mathbf{\Sigma}_y\mathbf{V}_y^{\mathsf{T}} \qquad\mathbf{S}_z = \mathbf{U}_z\mathbf{\Sigma}_z\mathbf{V}_z^{\mathsf{T}}, \tag*{(9)}

with the singular values arranged in descending order. The choice of the basis dimensions ryr_y and rzr_z governs a critical trade-off: larger dimensions improve the accuracy of the reduced-order model by retaining more physical information, whereas smaller dimensions minimize computational complexity to maximize speed-up. To balance this, the dimensions ryr_y and rzr_z are typically determined via an energy criterion, selecting the minimal number of singular vectors required to capture a user-defined percentage ζy∈(0,1)\zeta_y \in(0,1) and ζz∈(0,1)\zeta_z \in(0,1) of the total snapshot energy, defined by the ratio of the cumulative sum of the singular values, i.e.,

ry=min⁡{r:∑i=1rσy,i2∑i=1Ns(y)σy,i2≥ζy},rz=min⁡{r:∑i=1rσz,i2∑i=1Ns(z)σz,i2≥ζz}.(10)r_y = \min\left\{r : \frac{\sum_{i=1}^{r}\sigma_{y,i}^{2}}{\sum_{i=1}^{N_s^{(y)}}\sigma_{y,i}^{2}} \ge\zeta_y\right\}, \qquad r_z = \min\left\{r : \frac{\sum_{i=1}^{r}\sigma_{z,i}^{2}}{\sum_{i=1}^{N_s^{(z)}}\sigma_{z,i}^{2}} \ge\zeta_z\right\}. \tag*{(10)}

where (σy,i)i=1ry(\sigma_{y,i})_{i=1}^{r_y} and (σz,i)i=1rz(\sigma_{z,i})_{i=1}^{r_z} are the diagonal entries of Σy\mathbf{\Sigma}_y and Σz\mathbf{\Sigma}_z respectively. The basis matrices Ψ∈RNy×ry\mathbf{\Psi} \in\mathbb{R}^{N_y \times r_y} and Θ∈RNz×rz\mathbf{\Theta} \in\mathbb{R}^{N_z \times r_z} are then constructed from the first ryr_y and rzr_z left singular vectors of Sy\mathbf{S}_y and Sz\mathbf{S}_z respectively, i.e.,

Ψ=Uy[e1,e2,⋯ ,ery]Θ=Uz[e1,e2,⋯ ,erz](11)\mathbf{\Psi} = \mathbf{U}_y[\mathbf{e}_1,\mathbf{e}_2,\cdots,\mathbf{e}_{r_y}] \qquad\mathbf{\Theta} = \mathbf{U}_z[\mathbf{e}_1,\mathbf{e}_2,\cdots,\mathbf{e}_{r_z}] \tag*{(11)}

where each column represents an individual finite element basis function

ψj=LBy−1(ψj)∈Yhθj=LBz−1(θj)∈Zh\psi_j = L_{B_y}^{-1}(\psi_j) \in\mathcal{Y}^h \qquad\theta_j = L_{B_z}^{-1}(\theta_j) \in\mathcal{Z}^h

for j=1,…,ryj=1,\ldots,r_y and j=1,…,rzj=1,\ldots,r_z.

Online phase

The reduced system of DAEs is derived by performing the Galerkin projection of (1) onto the introduced subspaces. With the basis matrices (11) in place, the approximate variables (8) can be written in vector notation

y(t)≈y~(t)=yoffset+Ψy^(t)z(t)≈z~(t)=zoffset+Θz^(t).(12)\mathbf{y}(t) \approx\widetilde{\mathbf{y}}(t) = \mathbf{y}_{\mathrm{offset}} + \mathbf{\Psi}\hat{\mathbf{y}}(t) \\ \mathbf{z}(t) \approx\widetilde{\mathbf{z}}(t) = \mathbf{z}_{\mathrm{offset}} + \mathbf{\Theta}\hat{\mathbf{z}}(t). \tag*{(12)}

Invoking the approximation (12) and applying Galerkin projection directly to (1), we obtain the reduced order model of dimension ry+rzr_y+r_z

M^dy^dt+A^y^+B^z^=fˉ(yoffset+Ψy^,zoffset+Θz^,t,μ)B^Ty^+C^z^=gˉ(yoffset+Ψy^,zoffset+Θz^,t,μ)(13)\widehat{\mathbf{M}}\frac{\mathrm{d}\hat{\mathbf{y}}}{\mathrm{d}t}+\widehat{\mathbf{A}}\hat{\mathbf{y}}+\widehat{\mathbf{B}}\hat{\mathbf{z}}=\bar{\mathbf{f}}\left(\mathbf{y}_{\mathrm{offset}}+\mathbf{\Psi}\hat{\mathbf{y}},\mathbf{z}_{\mathrm{offset}}+\mathbf{\Theta}\hat{\mathbf{z}},t,\mu\right) \\ \widehat{\mathbf{B}}^{\mathsf{T}}\hat{\mathbf{y}}+\widehat{\mathbf{C}}\hat{\mathbf{z}}=\bar{\mathbf{g}}\left(\mathbf{y}_{\mathrm{offset}}+\mathbf{\Psi}\hat{\mathbf{y}},\mathbf{z}_{\mathrm{offset}}+\mathbf{\Theta}\hat{\mathbf{z}},t,\mu\right) \tag*{(13)}

with

M^=ΨTMΨ∈Rry×ryA^=ΨTAΨ∈Rry×ryB^=ΨTBΘ∈Rry×rzC^=ΘTCΘ∈Rrz×rz(14)\widehat{\mathbf{M}}=\mathbf{\Psi}^{\mathsf{T}}\mathbf{M}\mathbf{\Psi}\in\mathbb{R}^{r_y\times r_y} \qquad \widehat{\mathbf{A}}=\mathbf{\Psi}^{\mathsf{T}}\mathbf{A}\mathbf{\Psi}\in\mathbb{R}^{r_y\times r_y} \\ \widehat{\mathbf{B}}=\mathbf{\Psi}^{\mathsf{T}}\mathbf{B}\mathbf{\Theta}\in\mathbb{R}^{r_y\times r_z} \qquad \widehat{\mathbf{C}}=\mathbf{\Theta}^{\mathsf{T}}\mathbf{C}\mathbf{\Theta}\in\mathbb{R}^{r_z\times r_z} \tag*{(14)}

and

fˉ=ΨTf∈Rrygˉ=ΘTg∈Rrz.(15)\bar{\mathbf{f}}=\mathbf{\Psi}^{\mathsf{T}}\mathbf{f}\in\mathbb{R}^{r_y} \qquad \bar{\mathbf{g}}=\mathbf{\Theta}^{\mathsf{T}}\mathbf{g}\in\mathbb{R}^{r_z}. \tag*{(15)}

Note that the nonlinear terms fˉ:RNy×RNz×[0,T]×D→Rry\bar{\mathbf{f}}:\mathbb{R}^{N_y}\times\mathbb{R}^{N_z}\times[0,T]\times\mathcal{D}\to\mathbb{R}^{r_y} and gˉ:RNy×RNz×[0,T]×D→Rrz\bar{\mathbf{g}}:\mathbb{R}^{N_y}\times\mathbb{R}^{N_z}\times[0,T]\times\mathcal{D}\to\mathbb{R}^{r_z} are the projections of the image of the vector valued functions f\mathbf{f} and g\mathbf{g} onto the column spaces of Ψ\mathbf{\Psi} and Θ\mathbf{\Theta} respectively. The projected functions are defined entrywise as

fˉj(y~,z~,t,μ)=∑k=1Kfρk(f)⟨ηf(Ly−1(y~),Lz−1(z~),t,μ,xk(f)),ψj⟩[Yh′]×Yhgˉj(y~,z~,t,μ)=∑k=1Kgρk(g)⟨ηg(Ly−1(y~),Lz−1(z~),t,μ,xk(g)),θj⟩[Zh′]×Zh,(16)\bar{f}_j(\widetilde{\mathbf{y}},\widetilde{\mathbf{z}},t,\mu)=\sum_{k=1}^{K_f}\rho_k^{(f)} \left\langle \eta_f\left(L_{\mathbf{y}}^{-1}(\widetilde{\mathbf{y}}),L_{\mathbf{z}}^{-1}(\widetilde{\mathbf{z}}),t,\mu,\mathbf{x}_k^{(f)}\right),\psi_j \right\rangle_{[\mathcal{Y}_h']\times\mathcal{Y}_h} \\ \bar{g}_j(\widetilde{\mathbf{y}},\widetilde{\mathbf{z}},t,\mu)=\sum_{k=1}^{K_g}\rho_k^{(g)} \left\langle \eta_g\left(L_{\mathbf{y}}^{-1}(\widetilde{\mathbf{y}}),L_{\mathbf{z}}^{-1}(\widetilde{\mathbf{z}}),t,\mu,\mathbf{x}_k^{(g)}\right),\theta_j \right\rangle_{[\mathcal{Z}_h']\times\mathcal{Z}_h}, \tag*{(16)}

which involves numerical quadrature of the shown integrand functions over the spatial domain.

The nonlinear terms fˉ\bar{\mathbf{f}} and gˉ\bar{\mathbf{g}} defined in (16) need to be evaluated at every state update in a time marching scheme, and involve lifting back to the finite element functions, which scales with the FOM sizes NyN_y and NzN_z, before taking the nonlinear actions f\mathbf{f} and g\mathbf{g}. This dominates the ROM computational cost and prevents it from achieving significant speedup. To overcome this issue, the evaluation of fˉ\bar{\mathbf{f}} and gˉ\bar{\mathbf{g}} is approximated by sampling f\mathbf{f} and g\mathbf{g} at a small number of evaluation points, giving rise to various hyper-reduction methods.

In the next section we focus on hyper-reduction methods that are based on interpolation or quadrature, presenting their formulation and computational implementation.

Hyper-reduction

As explained in the previous section, the projection based reduction of a nonlinear problems leads to nonlinear terms that retain their dependence on the FOM size parameters Ny≫ryN_y \gg r_y and Nz≫rzN_z \gg r_z. To remove this dependence, various hyper-reduction methods have been developed. The central idea of hyper-reduction is to replace the evaluation of nonlinear terms f\mathbf{f} and g\mathbf{g} defined in (16) by approximations f^:Rry×Rrz×[0,T]×D→Rry\widehat{\mathbf{f}} : \mathbb{R}^{r_y} \times\mathbb{R}^{r_z} \times[0,T] \times\mathcal{D} \to\mathbb{R}^{r_y} and g^:Rry×Rrz×[0,T]×D→Rrz\widehat{\mathbf{g}} : \mathbb{R}^{r_y} \times\mathbb{R}^{r_z} \times[0,T] \times\mathcal{D} \to\mathbb{R}^{r_z} which can be evaluated from the ROM coefficients (y^,z^)∈Rry×Rrz(\widehat{\mathbf{y}},\widehat{\mathbf{z}}) \in\mathbb{R}^{r_y} \times\mathbb{R}^{r_z} without the need of full lifting to (y~,z~)∈RNy×RNz(\widetilde{\mathbf{y}},\widetilde{\mathbf{z}}) \in\mathbb{R}^{N_y} \times\mathbb{R}^{N_z} by (12) during the online phase. Invoking these approximations to (13), we obtain the hyper-reduced order model of dimension ry+rzr_y+r_z

M^dy^dt+A^y^+B^z^=f^(y^,z^,t,μ),B^Ty^+C^z^=g^(y^,z^,t,μ).(17)\widehat{\mathbf{M}}\frac{\mathrm{d}\widehat{\mathbf{y}}}{\mathrm{d}t}+\widehat{\mathbf{A}}\widehat{\mathbf{y}}+\widehat{\mathbf{B}}\widehat{\mathbf{z}}=\widehat{\mathbf{f}}(\widehat{\mathbf{y}},\widehat{\mathbf{z}},t,\mu), \\ \widehat{\mathbf{B}}^{\mathsf{T}}\widehat{\mathbf{y}}+\widehat{\mathbf{C}}\widehat{\mathbf{z}}=\widehat{\mathbf{g}}(\widehat{\mathbf{y}},\widehat{\mathbf{z}},t,\mu). \tag*{(17)}

In what follows, we focus on the hyper-reduction f^\widehat{\mathbf{f}} of f\mathbf{f}; the hyper-reduction g^\widehat{\mathbf{g}} of g\mathbf{g} can be performed analogously. The hyper-reduction methods considered in this paper can be classified into interpolation-based (Section 4.1) and quadrature-based (Section 4.2). For each class of methods, we will describe in detail the acceleration mechanism in the online phase, the additional precomputed quantities required in the offline phase, and the loss-minimizing design of hyper-reduction schemes.

Interpolation methods

The acceleration mechanism of interpolation methods is to evaluate appropriately sampled entries of the nonlinear term f\mathbf{f} and interpolate to the other entries. Based on gappy proper orthogonal decomposition [41], the interpolation methods uses a reduced basis approximation of f\mathbf{f}

f≈Ξff~(18)\mathbf{f} \approx\Xi_f\widetilde{\mathbf{f}} \tag*{(18)}

where

Ξf=[ξ1(f) ⋯ ξrf(f)]∈RNy×rfrf≪Ny\Xi_f=\left[\xi_1^{(f)}\ \cdots\ \xi_{r_f}^{(f)}\right]\in\mathbb{R}^{N_y\times r_f} \qquad r_f\ll N_y

is a basis matrix for approximating the nonlinear term f\mathbf{f}, which can be obtained in a similar manner to (11) from additional snapshots of f\mathbf{f} in the offline phase, and f~∈Rrf\widetilde{\mathbf{f}}\in\mathbb{R}^{r_f} denotes the coordinates of f\mathbf{f} with respect to Ξf\Xi_f. The approximation (18) is performed by interpolation of f\mathbf{f} at nfn_f sampled indices, with rf≤nf≪Nyr_f\leq n_f\ll N_y. More precisely, let Zf={i1,…,inf}⊂{1,…,Ny}\mathcal{Z}_f=\{i_1,\ldots,i_{n_f}\}\subset\{1,\ldots,N_y\} be a set of sampled indices and Zf∈RNy×nfZ_f\in\mathbb{R}^{N_y\times n_f} the associated sampling matrix whose entries are given by [Zf]j,k=δj,ik[Z_f]_{j,k}=\delta_{j,i_k}. Using the above, we formulate a least squares problem for the coordinates

f~=arg min⁡c∈Rrf∥ZfT(f−Ξfc)∥22\widetilde{\mathbf{f}}=\underset{\mathbf{c}\in\mathbb{R}^{r_f}}{\operatorname{arg\,min}}\left\|Z_f^{\mathsf{T}}\left(\mathbf{f}-\Xi_f\mathbf{c}\right)\right\|_2^2

whose solution is given by

f~=(ZfTΞf)†ZfTf,\widetilde{\mathbf{f}}=\left(Z_f^{\mathsf{T}}\Xi_f\right)^\dagger Z_f^{\mathsf{T}}\mathbf{f},

where superscript † denotes the Moore-Penrose pseudoinverse. Combining with (15), this yields

fˉ(y~,z~,t,μ)≈f^(y^,z^,t,μ)=ΨTΞf(ZfTΞf)†ZfTf(y~,z~,t,μ),(19)\bar{f}(\tilde{y},\tilde{z},t,\mu) \approx\hat{f}(\hat{y},\hat{z},t,\mu) = \Psi^{\mathsf{T}}\Xi_f(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\dagger}\mathcal{Z}_f^{\mathsf{T}}f(\tilde{y},\tilde{z},t,\mu), \tag*{(19)}

where the matrix Tf=ΨTΞf(ZfTΞf)†∈Rry×rfT_f = \Psi^{\mathsf{T}}\Xi_f(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\dagger} \in\mathbb{R}^{r_y \times r_f} is small, which can be precomputed and stored offline. In the online phase, it suffices to evaluate ZfTf∈Rnf\mathcal{Z}_f^{\mathsf{T}}f \in\mathbb{R}^{n_f}, i.e., the values of ff at the sampling indices Zf\mathcal{Z}_f, and multiply to the precomputed matrix TfT_f. In view of (5), the evaluation of f^\hat{f} only requires the values of the nonlinear density ηf\eta_f in the support of the selected test functions {φj}j∈Zf\{\varphi_j\}_{j\in\mathcal{Z}_f}, which is referred to as the sample mesh, and avoids the expensive full lifting.

In addition to the basis matrices Ψ\Psi and Θ\Theta described in Section 3.1, the offline procedure of interpolation-based hyper-reduction methods involves the construction of additional basis matrices Ξf\Xi_f and Ξg\Xi_g, and the selection of sampling indices Zf\mathcal{Z}_f and Zg\mathcal{Z}_g, which heavily affects the tradeoff between accuracy and speed-up. Noting that the matrix Πf=Ξf(ZfTΞf)†ZfT∈RNy×Ny\Pi_f = \Xi_f(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\dagger}\mathcal{Z}_f^{\mathsf{T}} \in\mathbb{R}^{N_y\times N_y} defines a rank-rfr_f oblique projection onto the column space of Ξf\Xi_f, an error bound for interpolation methods as a function of Zf\mathcal{Z}_f is given in [47 Theorem 3.1]

err⁡(Zf)=∥(INy−Πf)f∥2≤∥(ZfTΞf)†∥2∥(INy−ΞfΞfT)f∥2(20)\operatorname{err}(\mathcal{Z}_f) = \lVert(I_{N_y}-\Pi_f)f\rVert_2 \leq\lVert(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\dagger}\rVert_2\lVert(I_{N_y}-\Xi_f\Xi_f^{\mathsf{T}})f\rVert_2 \tag*{(20)}

where the 2-norm ∥(ZfTΞf)†∥2\lVert(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\dagger}\rVert_2 is equal to the largest singular value of (ZfTΞf)†(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\dagger}, or equivalently the reciprocal of the smallest strictly positive singular value of ZfTΞf\mathcal{Z}_f^{\mathsf{T}}\Xi_f. The same theorem provides the alternative expression

∥(INy−Πf)f∥22=∥(INy−ΞfΞfT)f∥22+∥ϵ(f,Zf)∥22(21)\lVert(I_{N_y}-\Pi_f)f\rVert_2^2 = \lVert(I_{N_y}-\Xi_f\Xi_f^{\mathsf{T}})f\rVert_2^2 + \lVert\epsilon(f,\mathcal{Z}_f)\rVert_2^2 \tag*{(21)}

where ϵ(f,Zf)∈RNy\epsilon(f,\mathcal{Z}_f) \in\mathbb{R}^{N_y} is given by

ϵ(f,Zf)=((ZfTΞf)TZfTΞf)−1(ZfTΞf)TZfT(INy−ΞfΞfT)f.(22)\epsilon(f,\mathcal{Z}_f) = \left((\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\mathsf{T}}\mathcal{Z}_f^{\mathsf{T}}\Xi_f\right)^{-1}(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\mathsf{T}}\mathcal{Z}_f^{\mathsf{T}}(I_{N_y}-\Xi_f\Xi_f^{\mathsf{T}})f. \tag*{(22)}

Different greedy sampling strategies for adaptively minimizing the error err⁡(Zf)\operatorname{err}(\mathcal{Z}_f) can be devised based on the expressions (20)–(22), three of which are considered in this work. DEIM sampling methods (§ 4.1.1) aim to lower the error bound in (20) by minimizing the 2-norm of (ZfTΞf)†(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\dagger}. Q-DEIM sampling methods (§ 4.1.2) have the similar goal of minimizing the condition number of (ZfTΞf)†(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\dagger} to minimize the error bound. Finally, the S-OPT sampling algorithm (§ 4.1.3) aims first to increase the non-singularity of (ZfTΞf)TZfTΞf(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\mathsf{T}}\mathcal{Z}_f^{\mathsf{T}}\Xi_f to increase numerical stability, and second to increase the column orthogonality of ZfTΞf\mathcal{Z}_f^{\mathsf{T}}\Xi_f in order to decrease the 2-norm of ϵ(f,Zf)\epsilon(f,\mathcal{Z}_f).

DEIM

The discrete empirical interpolation method (DEIM) was introduced in [43] for greedily selecting nf=rfn_f = r_f sampling indices from the linearly independent rows of Ξf\Xi_f such Algorithm 1 Oversampled DEIM sampling algorithm

Input: Basis matrix Ξf∈RN×rf\Xi_f \in\mathbb{R}^{N \times r_f} and desired number of sampled indices nf>rfn_f > r_f

Output: Set of nfn_f sampling indices Zf={i1,…,inf}\mathcal{Z}_f = \{i_1, \ldots, i_{n_f}\}

  1. i1=argmax⁡i∣[Ξf]i,1∣i_1 = \operatorname*{argmax}_i |[\Xi_f]_{i,1}|

  2. Zf={i1}\mathcal{Z}_f = \{i_1\}

  3. niter=ceil⁡(nf−1rf−1)n_{\mathrm{iter}} = \operatorname{ceil}\left(\frac{n_f-1}{r_f-1}\right)

  4. for j=2:rfj = 2 : r_f do

  5. Construct Ξf(j−1)=Ξf[e1,…,ej−1]\Xi_f^{(j-1)} = \Xi_f[e_1,\ldots,e_{j-1}]

  6. for ℓ=(j−2)niter+1:(j−1)niter\ell= (j-2)n_{\mathrm{iter}} + 1 : (j-1)n_{\mathrm{iter}} do

  7. Construct Zf=[ei1,…,eiℓ]\mathcal{Z}_f = [e_{i_1},\ldots,e_{i_\ell}]

  8. Compute ε=Ξf(j−1)(ZfTΞf(j−1))†ZfTξj(f)\varepsilon= \Xi_f^{(j-1)}(\mathcal{Z}_f^{\mathsf{T}}\Xi_f^{(j-1)})^\dagger\mathcal{Z}_f^{\mathsf{T}}\xi_j^{(f)}

  9. iℓ+1=argmax⁡i∣[Ξf]i,j−εi∣i_{\ell+1} = \operatorname*{argmax}_i |[\Xi_f]_{i,j} - \varepsilon_i|

  10. Zf←Zf∪{iℓ+1}\mathcal{Z}_f \leftarrow\mathcal{Z}_f \cup\{i_{\ell+1}\}

  11. if ∣Zf∣=nf|\mathcal{Z}_f| = n_f then return

  12. end for

  13. end for

that the 2-norm of (ZfTΞf)†(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^\dagger is minimized. A variant of this algorithm that allows for oversampling (nf≥rfn_f \ge r_f) was introduced in [60], a simplified version of which is presented in Algorithm 1.

Q-DEIM

The Q-DEIM algorithm was introduced in [45] as a variant of DEIM for selecting the sampling indices in a way that produces a smaller estimate of the condition number ∥(ZfTΞf)†∥2\|(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^\dagger\|_2 when nf=rfn_f = r_f. In contrast to the greedy selection process employed in DEIM, the Q-DEIM algorithm relies on a rank revealing QR factorization of (ZfTΞf)T(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\mathsf{T}}. A further development of Q-DEIM termed GappyPOD+E was proposed in [61], which achieves low projection errors with few oversampling points by maximizing the lower bound of the smallest singular value of ZfTΞf\mathcal{Z}_f^{\mathsf{T}}\Xi_f. This algorithm is presented in Algorithm 2.

S-OPT

The majority of gappy POD-based methods for selecting Zf\mathcal{Z}_f are based on the principle of minimizing the largest singular value of the sampled matrix (ZfTΞf)T(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\mathsf{T}}. This is referred to as E-optimality [62] in the optimal design community and suffers from the issue of numerical instability [47]. On the other hand, the S-OPT algorithm introduced in [47] pursues S-optimality, which results in better numerical stability than Algorithm 2 GappyPOD+E sampling algorithm

Input: Basis matrix Ξf∈RN×rf\Xi_f \in\mathbb{R}^{N \times r_f} and desired number of sampled indices nfn_f

Output: Set of nfn_f sampling indices Zf={i1,…,inf}\mathcal{Z}_f = \{i_1,\ldots,i_{n_f}\}

  1. ΞfTZf=QR\Xi_f^{\mathsf{T}}\mathcal{Z}_f = \mathsf{Q}\mathsf{R}, where Q∈Rrf×rf\mathsf{Q} \in\mathbb{R}^{r_f \times r_f}, QTQ=Irf\mathsf{Q}^{\mathsf{T}}\mathsf{Q} = \mathsf{I}_{r_f}, and R∈Rrf×N\mathsf{R} \in\mathbb{R}^{r_f \times N} is upper triangular.

  2. Take Zf={i1,…,irf}\mathcal{Z}_f = \{i_1,\ldots,i_{r_f}\}, with Zf=[ei1,⋯ ,eirf]\mathcal{Z}_f = [e_{i_1},\cdots,e_{i_{r_f}}]

  3. for ℓ=rf+1:nf\ell= r_f + 1 : n_f do

  4. Construct Zf=[ei1,⋯ ,eiℓ−1]\mathcal{Z}_f = [e_{i_1},\cdots,e_{i_{\ell-1}}] from Zf\mathcal{Z}_f

  5. ZfTΞf=USVT\mathcal{Z}_f^{\mathsf{T}}\Xi_f = \mathsf{U}\mathsf{S}\mathsf{V}^{\mathsf{T}}, where U∈Rj×rf\mathsf{U} \in\mathbb{R}^{j \times r_f}, UTU=Ij\mathsf{U}^{\mathsf{T}}\mathsf{U} = \mathsf{I}_j, V∈Rrf×rf\mathsf{V} \in\mathbb{R}^{r_f \times r_f}, VTV=Irf\mathsf{V}^{\mathsf{T}}\mathsf{V} = \mathsf{I}_{r_f}, and S∈Rrf×rf\mathsf{S} \in\mathbb{R}^{r_f \times r_f} is diagonal

  6. Compute g=σrf−12−σrf2g = \sigma_{r_f-1}^{2} - \sigma_{r_f}^{2} where S=diag⁡(σ1,…,σrf)\mathsf{S} = \operatorname{diag}(\sigma_1,\ldots,\sigma_{r_f})

  7. Compute W=VTΞfT∈Rrf×N\mathsf{W} = \mathsf{V}^{\mathsf{T}}\Xi_f^{\mathsf{T}} \in\mathbb{R}^{r_f \times N}

  8. Compute y=(W⊙W)T1rf∈RN\mathsf{y} = (\mathsf{W} \odot\mathsf{W})^{\mathsf{T}}\mathbf{1}_{r_f} \in\mathbb{R}^{N}

  9. iℓ=argmax⁡i∉Zf(g+yi−(g+yi)2−4g(Wrf,i)2)i_\ell= \underset{i \notin\mathcal{Z}_f}{\operatorname{argmax}}\left(g+y_i-\sqrt{(g+y_i)^2-4g(\mathsf{W}_{r_f,i})^2}\right)

  10. Zf←Zf∪{iℓ}\mathcal{Z}_f \leftarrow\mathcal{Z}_f \cup\{i_\ell\}

  11. end for

sampling methods based on E-optimality. The core principle of S-OPT is to simultaneously promote the nonsingularity of the normal matrix (ZfTΞf)TZfTΞf(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\mathsf{T}}\mathcal{Z}_f^{\mathsf{T}}\Xi_f and the column orthogonality of the sampled matrix ZfTΞf\mathcal{Z}_f^{\mathsf{T}}\Xi_f by maximizing measure S\mathcal{S} [63]

S(ZfTΞf)=(det⁡((ZfTΞf)TZfTΞf)∏k=1p∥ZfTΞfek∥2)1p.(23)\mathcal{S}(\mathcal{Z}_f^{\mathsf{T}}\Xi_f)=\left(\sqrt{\frac{\det\left((\mathcal{Z}_f^{\mathsf{T}}\Xi_f)^{\mathsf{T}}\mathcal{Z}_f^{\mathsf{T}}\Xi_f\right)}{\prod_{k=1}^{p}\left\|\mathcal{Z}_f^{\mathsf{T}}\Xi_f e_k\right\|_2}}\right)^{\frac{1}{p}} . \tag*{(23)}

The S-OPT algorithm as described in [47 Algorithm 1] is presented in Algorithm 3. In the developed algorithm, the determinant computations are performed using a fast method that exploits the rank-one updates involved in each iteration [63 Section 3.3.3].

Quadrature methods

The acceleration mechanism of quadrature-based methods is to approximate the integrations in the finite element assembly by an appropriately selected subset of quadrature integration points. As shown in (16), the nonlinear term f\mathbf{f} is defined as projection of the vector valued function f\mathbf{f} onto the derived reduced subspace. Recalling the duality pairings correspond to integration of the nonlinear integrands (5),

Algorithm 3 S-OPT sampling algorithm

Input: Basis matrix Ξf∈RN×rf\Xi_f \in\mathbb{R}^{N \times r_f} and desired number of sampled indices nfn_f.

Output: A set of nfn_f indices Zf={i1,…,inf}\mathcal{Z}_f = \{i_1,\ldots,i_{n_f}\}.

  1. i1=argmax⁡i∣[Ξf]i,1∣i_1 = \operatorname*{argmax}_i |[\Xi_f]_{i,1}|

  2. Zf={i1}\mathcal{Z}_f = \{i_1\}

  3. for ℓ=2:rf\ell= 2:r_f do

  4. Construct Ξf(ℓ−1)=Ξf[e1,…,eℓ−1]\Xi_f^{(\ell-1)} = \Xi_f[e_1,\ldots,e_{\ell-1}]

  5. Construct Zf=[ei1,…,eiℓ−1]\mathcal{Z}_f = [e_{i_1},\ldots,e_{i_{\ell-1}}]

  6. Construct A=ZfTΞf(ℓ−1)A = \mathcal{Z}_f^{\mathsf{T}}\Xi_f^{(\ell-1)}

  7. iℓ=argmax⁡i∉Zf1+rTb∏k=1j(∥Aek∥2+rk2)cTc+γ2−αcTc+γ2i_\ell= \operatorname*{argmax}_{i\notin\mathcal{Z}_f} \dfrac{1+\mathbf{r}^{\mathsf{T}}\mathbf{b}}{\prod_{k=1}^{j}(\lVert A e_k\rVert^2+r_k^2)}\dfrac{\mathbf{c}^{\mathsf{T}}\mathbf{c}+\gamma^2-\alpha}{\mathbf{c}^{\mathsf{T}}\mathbf{c}+\gamma^2}, with rT=eiTΞf(ℓ−1)\mathbf{r}^{\mathsf{T}}=e_i^{\mathsf{T}}\Xi_f^{(\ell-1)}, b=(ATA)−1r\mathbf{b}=(A^{\mathsf{T}}A)^{-1}\mathbf{r}, γ=[Ξf]i,ℓ\gamma=[\Xi_f]_{i,\ell}

  8. Zf←Zf∪{iℓ}\mathcal{Z}_f \leftarrow\mathcal{Z}_f \cup\{i_\ell\}

  9. end for

  10. for ℓ=rf+1:nf\ell= r_f+1:n_f do

  11. Construct Zf=[ei1,…,eiℓ−1]\mathcal{Z}_f = [e_{i_1},\ldots,e_{i_{\ell-1}}]

  12. Construct A=ZfTΞfA = \mathcal{Z}_f^{\mathsf{T}}\Xi_f

  13. iℓ=argmax⁡i∉Zf1+rT(ATA)−1r∏k=1rf(∥Aek∥2+rk2)i_\ell= \operatorname*{argmax}_{i\notin\mathcal{Z}_f} \dfrac{1+\mathbf{r}^{\mathsf{T}}(A^{\mathsf{T}}A)^{-1}\mathbf{r}}{\prod_{k=1}^{r_f}(\lVert A e_k\rVert^2+r_k^2)}, with rT=eiTΞf\mathbf{r}^{\mathsf{T}}=e_i^{\mathsf{T}}\Xi_f

  14. Zf←Zf∪{iℓ}\mathcal{Z}_f \leftarrow\mathcal{Z}_f \cup\{i_\ell\}

  15. end for

the quadrature-based hyper-reduction methods seek to form a sparse and re-weighted approximation of (16) on the reduced subspace Yr\mathcal{Y}^r as the test function space, i.e.,

fˉj(y~,z~,t,μ)≈f^j(y^,z^,t,μ)=∑k=1Kfρk(f),⋆⟨ηf(LBy−1(y),LBz−1(z),t,μ,xk(f)),ψj⟩[Yh]′×Yh(24)\bar{f}_j(\tilde{y},\tilde{z},t,\mu) \approx\hat{f}_j(\hat{y},\hat{z},t,\mu) = \sum_{k=1}^{K_f}\rho_k^{(f),\star}\left\langle\eta_f\left(L_{\mathcal{B}_y}^{-1}(y),L_{\mathcal{B}_z}^{-1}(z),t,\mu,x_k^{(f)}\right),\psi_j\right\rangle_{[Y_h]'\times Y_h} \tag*{(24)}

where the new weights are non-negative, i.e., ρk(f),⋆≥0\rho_k^{(f),\star} \ge0, and sparse, i.e., Kf⋆={k:ρk(f),⋆≠0}K_f^\star= \{k:\rho_k^{(f),\star}\ne0\} with ∣Kf⋆∣=Kf⋆≪Kf|K_f^\star|=K_f^\star\ll K_f. In the online phase, the evaluation of f^\hat{f} only requires the ROM finite element approximation y~\tilde{y} and z~\tilde{z} where it takes to compute the nonlinear density ηf\eta_f at selected quadrature points {xk}k∈Kf⋆\{x_k\}_{k\in K_f^\star}, again called the sample mesh, and thus avoids the expensive full lifting.

In addition to the basis matrices Ψ\Psi and Θ\Theta described in § 3.1, the offline procedure of quadrature-based hyper-reduction methods involves finding two sets of sparse quadrature weights ρf⋆=(ρk(f),⋆)k=1Kf\boldsymbol{\rho}_f^\star= (\rho_k^{(f),\star})_{k=1}^{K_f} and ρg⋆=(ρk(g),⋆)k=1Kg\boldsymbol{\rho}_g^\star= (\rho_k^{(g),\star})_{k=1}^{K_g}, which heavily affects the tradeoff between accuracy and speed-up. The computational expense of calculating f\mathbf{f} scales with the number of sampled quadrature points, making it desirable to minimize Kf⋆K_f^\star. At the same time, the set of nonzero quadrature weights affects the quality of the approximation in (24), which in turn has a significant impact on the downstream ROM accuracy (in analogy to the role of ZfZ_f in interpolation methods). It is therefore desirable to obtain a vector of weights ρf⋆\boldsymbol{\rho}_f^\star that minimizes Kf⋆K_f^\star while keeping the approximation error below a chosen tolerance. The task of computing ρf⋆\boldsymbol{\rho}_f^\star has been formulated as a linear programming problem [52] and as an equivalent nonnegative least squares (NNLS) problem [64, 65]. In this work we follow the latter approach and determine ρf⋆\boldsymbol{\rho}_f^\star by solving the NNLS problem

ρf⋆=arg⁡min⁡r≥0 ∥Gf(ρf−r)∥22(25)\boldsymbol{\rho}_f^\star= \underset{\mathbf{r}\geq0}{\arg\min}\ \left\|G_f\left(\boldsymbol{\rho}_f-\mathbf{r}\right)\right\|_2^2 \tag*{(25)}

where Gf∈Rnc(f)×KfG_f \in\mathbb{R}^{n_c^{(f)}\times K_f} is an accuracy constraints matrix with nc(f)n_c^{(f)} constraint rows and ρf\boldsymbol{\rho}_f is the original quadrature weights vector. The entries of each row of GfG_f correspond to the evaluation of the integrand at all FOM quadrature points xk(f)x_k^{(f)} for a given combination of snapshot quadruplets (ys,zs,tℓs,μms)(y_s,z_s,t_{\ell_s},\mu_{m_s}) introduced in § 3.1 and ROM test functions ψj\psi_j which gives rise to nc(f)=Ns(f)ry≪Kfn_c^{(f)}=N_s^{(f)}r_y\ll K_f constraints. More specifically, we define GfG_f entrywise by: for 1≤s≤Ns1\leq s\leq N_s, 1≤j≤ry1\leq j\leq r_y, 1≤k≤Kf1\leq k\leq K_f,

[Gf]ik=⟨ηf(ys,zs,tℓs,μms,xk(f)),ψj⟩[Yh]′×Yh,i=j+(s−1)ry.(26)[G_f]_{ik}=\left\langle\eta_f\left(y_s,z_s,t_{\ell_s},\mu_{m_s},x_k^{(f)}\right),\psi_j\right\rangle_{[Y_h]'\times Y_h}, \qquad i=j+(s-1)r_y. \tag*{(26)}

After forming GfG_f, the NNLS problem (25) is solved using the Lawson-Hanson algorithm [66], which is recited in Algorithm 4. Even though the NNLS problem (25) does not attempt to explicitly minimize Kf⋆K_f^\star, we find that significantly sparse solutions ρf⋆\boldsymbol{\rho}_f^\star are obtained in our numerical experiments using a solver tolerance ϵ=10−6\epsilon=10^{-6}, matching the behavior demonstrated in previous works [64, 65].

Before applying the algorithm, two conditioning operations are performed on GfG_f, which we have found to increase the derived quadrature rule’s accuracy and decrease the number of iterations needed for the algorithm’s convergence. First, each row of GfG_f is rescaled by dividing the row by its maximum absolute value. In our numerical experiments we have found that within each row, nonzero entries may differ considerably in magnitude. Rescaling all entries to take values within [−1,1]⊂R[-1,1]\subset\mathbb{R} was found to improve the convergence of the Lawson-Hanson algorithm. Second, we compute the LQ decomposition of matrix G=LQG=LQ and use matrix QQ as the constraints matrix. It has been previously reported that using a constraints matrix with orthonormal rows (constraints) consistently reduces the number of iterations needed for the Lawson-Hanson algorithm to converge [67], and this indeed matches our own experience. Additional details on the implementation of the EQP method and the NNLS formulation can be found in [28]. Finally, we note that generally the resulting sparse quadrature rule can only be expected to yield accurate solutions in the neighborhood of the differential variable snapshots yh(ts)y_h(t_s) used for forming GfG_f. If desired, additional snapshots can be incorporated into GfG_f to make the derived quadrature rule more robust. However,

Algorithm 4 Lawson-Hanson algorithm

Input: Gf∈Rrf×KG_f \in\mathbb{R}^{r_f \times K}, ρf∈RK\rho_f \in\mathbb{R}^{K} and the solver tolerance ε\varepsilon

Output: ρf∗∈RK\rho_f^* \in\mathbb{R}^{K}

1: z←∅z \leftarrow\varnothing

2: v←{1,…,K}v \leftarrow\{1,\ldots,K\}

3: ρf∗←0∈RK\rho_f^* \leftarrow0 \in\mathbb{R}^{K}

4: u←GT(Gfρ−Gfρf∗)u \leftarrow G^{\mathsf{T}}(G_f\rho-G_f\rho_f^*)

5: uR←uu_R \leftarrow u

6: while ∣v∣>0|v| > 0 and max⁡(uR)>ε\max(u_R) > \varepsilon do

7: j←arg max⁡iui∈uRj \leftarrow\operatorname*{arg\,max}_i u_i \in u_R

8: z←z∪jz \leftarrow z \cup j

9: v←v∖jv \leftarrow v \setminus j

10: Gf,z←{Gf[:,i]∣i∈z}G_{f,z} \leftarrow\{G_f[:,i]\mid i\in z\}

11: s←0∈RKs \leftarrow0 \in\mathbb{R}^{K}

12: sz←{si∣i∈z}s_z \leftarrow\{s_i\mid i\in z\}

13: sR←{si∣i∈v}s_R \leftarrow\{s_i\mid i\in v\}

14: sz←((Gf,z)TGf,z)−1(Gf,z)Tρs_z \leftarrow((G_{f,z})^{\mathsf{T}}G_{f,z})^{-1}(G_{f,z})^{\mathsf{T}}\rho

15: while min⁡(sz)≤0\min(s_z)\leq0 do

16: sn←{si≤0}s_n \leftarrow\{s_i\leq0\}

17: α←min⁡(ρf∗ρf∗−sn)\alpha\leftarrow\min\left(\frac{\rho_f^*}{\rho_f^*-s_n}\right)

18: ρf∗←ρf∗+α⋅(s−ρf∗)\rho_f^* \leftarrow\rho_f^*+\alpha\cdot(s-\rho_f^*)

19: iz←{i∈z:ri≤0}i_z \leftarrow\{i\in z:r_i\leq0\}

20: v←v∪izv \leftarrow v\cup i_z

21: z←z∖izz \leftarrow z\setminus i_z

22: sz←((Gf,z)TGf,z)−1(Gf,z)TGfρs_z \leftarrow((G_{f,z})^{\mathsf{T}}G_{f,z})^{-1}(G_{f,z})^{\mathsf{T}}G_f\rho

23: sR←0s_R \leftarrow0

24: end while

25: ρf∗←s\rho_f^* \leftarrow s

26: u←GfT(ρ−Gfρf∗)u \leftarrow G_f^{\mathsf{T}}(\rho-G_f\rho_f^*)

27: uR←{ui∣i∈v}u_R \leftarrow\{u_i\mid i\in v\}

28: end while

increasing the number of snapshots will increase the offline time spent solving the NNLS problem and may also increase the resulting number of nonzero entries of ρf∗\rho_f^*.

Sample mesh

The hyper-reduction methods tested in this work require the selection of the number of sampling points (nfn_f for gappy POD methods and K∗K^* for EQP). Ideally, this selection is done such that the nonlinear functions f\mathbf{f} and g\mathbf{g} are accurately approximated while the computation time is minimized. However, the relation between the number of sampling points and the resulting computation time is not always straightforward. Our implementation of the tested hyper-reduction methods relies on the construction of a sample mesh, which consists of the finite elements containing the sampled quadrature or interpolation points. Each finite element in our computational domain includes a prescribed number of FEM basis functions (degrees of freedom) and associated quadrature points. The interpolation hyper-reduction methods sample degrees of freedom, corresponding to the nfn_f sampled indices Zf\mathcal{Z}_f. Their implementation requires the evaluation of the sampled degrees of freedom at all local quadrature points. On the contrary, the EQP method samples quadrature points, determined by the K∗K^* nonzeros resulting from solving the NNLS problem (25). Its implementation requires the evaluation of all local degrees of freedom at the subset of sampled quadrature points. Because of this difference in approach between the two classes of methods, the computational cost of the tested hyper-reduction methods depends on element-wise factors that go beyond the number of sampled points. In many cases, the EQP method can also be implemented using pointwise integration, effectively viewing the whole computational domain as one “global element” to bypass the need for a sample mesh [64]. This is possible when the nonlinear terms allow for a clean offline-online splitting, where the geometric mapping and basis function gradients are precomputed in a fixed reference configuration. However, for the Lagrangian hydrodynamics problems (§ 5.3), the computational mesh is continuously deforming with time, while the governing equations involve complex state-dependent terms such as artificial viscosity that rely on local spatial stencils. Specifically, robust shock-capturing via artificial viscosity necessitates the calculation of velocity gradients and characteristic length scales derived from the instantaneous configuration of the local mesh [58]. Evaluating these element-based terms requires the online reconstruction of local geometric quantities (e.g., Jacobians and velocity gradients) and neighborhood connectivity at each time step. Since these geometric quantities evolve dynamically and are inextricably linked to the mesh topology, they cannot be fully precomputed in a fixed reference configuration. While alternative FOM discretizations (e.g., purely pointwise artificial viscosity) might allow for a fully mesh-independent implementation, they often lack the robustness required for complex shock-physics. As a result, the standard formulations used in the present work require access to the local mesh structure. This complex relationship between the sample mesh and ROM cost can lead to situations where using fewer sampled points does not necessarily lead to lower computational cost. Anticipating our later discussion, Figure 2 illustrates such a scenario for the triple point expansion problem (§ 5.3.3), where the sampled elements are visualized as volumes and the sampled points as dots. In this particular example, although fewer points are sampled by EQP than by S-OPT, the points sampled by EQP are scattered across many high order elements. This means that the sample mesh obtained by EQP contains significantly more elements than the one obtained by S-OPT. In such a case, the computational overhead associated with loading the sampled elements and reconstructing their local geometry can outweigh the savings gained from reducing the total number of quadrature points. As a result, the hyper-reduction speed-up becomes heavily dependent on the spatial distribution of the sampled points and the spatial sparsity of the sampled elements, rather than just the number of sampled quadrature points. These observations help highlight a key message: the employed FOM discretization can be an important factor in determining the speedup that can be delivered by a chosen hyper-reduction method.

Sample mesh comparison for the triple point expansion problem

Figure 2. Sample mesh comparison for the triple point expansion problem. Left: S-OPT sample mesh with 22 sampled elements and 22×64=140822 \times64 = 1408 sampled quadrature points (in dark blue). Right: EQP sample mesh with 178 sampled elements and 150 sampled quadrature points each for the energy field (in green) and the velocity field (in red).

Numerical results

The inherent tradeoff for any hyper-reduction method between minimizing computational time and maximizing approximation accuracy can be quantified with a Pareto front.

Definition 5.1 (Pareto front) Given a finite solution set D={x1,x2,…,xn}\mathcal{D} = \{\mathbf{x}_1, \mathbf{x}_2, \ldots, \mathbf{x}_n\} and mm objective functions f1,f2,…,fmf_1, f_2, \ldots, f_m, the Pareto front P\mathcal{P} is defined as the set of solutions x∗∈D\mathbf{x}^{*} \in\mathcal{D} for which no x∈D\mathbf{x} \in\mathcal{D} satisfies both

fi(x)≤fi(x∗) for all i∈{1,…,m} and fj(x)<fj(x∗) for some j∈{1,…,m}.f_i(\mathbf{x}) \leq f_i(\mathbf{x}^{*}) \text{ for all } i \in\{1, \ldots, m\} \text{ and } f_j(\mathbf{x}) < f_j(\mathbf{x}^{*}) \text{ for some } j \in\{1, \ldots, m\}.

In this study, we consider the case m=2m = 2, with relative online phase computation time and relative L2L^2 error between FOM and ROM solutions as the two Pareto front objective functions. It is expected that the Pareto front, and thus the optimal choice of hyper-reduction method, will vary for different problems.

The hyper-reduction methods introduced in § 4 are applied to five problems: nonlinear diffusion (§ 5.1), nonlinear elasticity (§ 5.2) and three Lagrangian hydrodynamics problems: Sedov blast wave (§ 5.3.1), Taylor-Green vortex (§ 5.3.2) and triple point expansion (§ 5.3.3). Detailed settings for these problems are summarized in Table 1, including mesh size, finite element spaces (Yh,Zh)(\mathcal{Y}^h,\mathcal{Z}^h), FOM size (Ny,Nz)(N_y,N_z), the ODE solver, final time (T)(T), and the number of time steps (Nt)(N_t) for FOM runs. For each considered problem case, the physical quantities are parametrized with μ∈D\mu\in\mathcal{D}. Figure 3 visualizes the final-time FOM solutions in various benchmark problems.

ProblemMeshFE space (Yh,Zh)(\mathcal{Y}^h,\mathcal{Z}^h)FOM size (Ny,Nz)(N_y,N_z)ODE solverTTNtN_t
Nonlinear diffusion32×3232 \times32(Q^0,RT0)(\widehat{Q}_0,RT_0)(1024,2112)(1024,2112)BE0.10.1101101
Nonlinear elasticity32×432 \times4([Q2]2×[Q2]2,−)([Q_2]^2 \times[Q_2]^2,-)(2340,−)(2340,-)RK45.05.0500500
Sedov blast wave8×8×88 \times8 \times8([Q2]3×Q^1×[Q2]3,−)([Q_2]^3 \times\widehat{Q}_1 \times[Q_2]^3,-)(33574,−)(33574,-)RK4<br>RK2Avg0.20.2363363<br>377377
Taylor-Green vortex8×8×88 \times8 \times8([Q2]3×Q^1×[Q2]3,−)([Q_2]^3 \times\widehat{Q}_1 \times[Q_2]^3,-)(33574,−)(33574,-)RK4<br>RK2Avg0.10.1266266<br>266266
Triple point expansion28×12×428 \times12 \times4([Q2]3×Q^1×[Q2]3,−)([Q_2]^3 \times\widehat{Q}_1 \times[Q_2]^3,-)(87702,−)(87702,-)RK4<br>RK2Avg0.50.59595<br>9595

Table 1. Summary of simulation setups.

Visualization of final-time fields from FOM simulations

Figure 3. Visualization of final-time fields from FOM simulations. The first column shows the nonlinear diffusion problem (top, pressure) and the nonlinear elasticity problem (bottom, velocity). The remaining columns correspond to Lagrangian benchmark problems, showing internal energy per unit mass (top) and velocity magnitude (bottom) for the Sedov blast wave (second column), the Taylor-Green vortex (third column), and the triple-point expansion problem (fourth column).

In the results that follow we use the L2L^2 error between FOM and ROM solutions to quantify the error introduced by the different hyper-reduction methods for each problem case. In addition to the hyper-reduction error, there are two additional sources of error included in the reported L2L^2 error values: (1) the projection error introduced by restricting the dynamics to a linear subspace of the original space; (2) for predictive simulation runs, the sampling error introduced when sampling each problem’s parameter space. The reason the L2L^2 FOM-to-ROM error can be employed to perform a fair comparison between different hyper-reduction methods is that the projection and sampling errors are constant among the different hyper-reduction methods for each problem case. This is because: (1) the same linear subspaces are used across all simulations within each problem case; (2) the same parameter values are sampled for training and used for out-of-sample testing for each problem. As such, even though the magnitude of the reported FOM-to-ROM errors includes additional error sources, their relative difference depends only on the employed hyper-reduction methods, allowing for fair comparisons within each problem case.

Nonlinear diffusion

We consider the nonlinear diffusion equation in Ω⊂R2\Omega\subset\mathbb{R}^{2}

∂p∂t−∇⋅v=sin Ω×(0,T)∇p−κ(p)−1v=0in Ω×[0,T]v⋅n=0on ∂Ω×[0,T]p=p0(μ)in Ω×{0}(27)\begin{aligned} \frac{\partial p}{\partial t} - \nabla\cdot v &= s && \text{in } \Omega\times(0,T) \\ \nabla p - \kappa(p)^{-1}v &= 0 && \text{in } \Omega\times[0,T] \\ v \cdot n &= 0 && \text{on } \partial\Omega\times[0,T] \\ p &= p_{0}(\mu) && \text{in } \Omega\times\{0\} \tag*{(27)} \end{aligned}

where pp denotes the pressure, vv denotes the flux, ss denotes an external source function, and p0p_{0} denotes the initial condition on the pressure. The system is parametrized through the initial condition p0(μ)p_{0}(\mu).

To fit the nonlinear diffusion equation (27) into the general variational framework (2) introduced in § 2 we identify the following components. The dependent variables are given by y=py = p and z=vz = v, with associated vector spaces Y=L2(Ω)\mathcal{Y} = L^{2}(\Omega), Z=H0(div⁡;Ω)={ψ∈H(div⁡;Ω):ψ⋅n=0}\mathcal{Z} = H_{0}(\operatorname{div};\Omega) = \{\psi\in H(\operatorname{div};\Omega): \psi\cdot n = 0\} and H=L2(Ω)\mathcal{H} = L^{2}(\Omega) with the standard L2L^{2} inner product (⋅,⋅)H(\cdot,\cdot)_{\mathcal{H}}, leading to the trivial Gelfand triple Y=H=Y′\mathcal{Y} = \mathcal{H} = \mathcal{Y}'. The bilinear forms a:Y×Y→Ra : \mathcal{Y} \times\mathcal{Y} \to\mathbb{R}, b:Y×Z→Rb : \mathcal{Y} \times\mathcal{Z} \to\mathbb{R} and c:Z×Z→Rc : \mathcal{Z} \times\mathcal{Z} \to\mathbb{R} are defined as

a(p,p′)=0b(p,v)=−∫Ωp(∇⋅v) dxc(v,v′)=0a(p,p') = 0 \qquad b(p,v) = -\int_{\Omega} p(\nabla\cdot v)\,dx \qquad c(v,v') = 0

for any pp, p′∈Yp' \in\mathcal{Y} and vv, v′∈Zv' \in\mathcal{Z}. Finally, the duality pairing involving the nonlinear functions f:Y×Z×[0,T]×D→Y′f:\mathcal{Y} \times\mathcal{Z} \times[0,T] \times\mathcal{D} \to\mathcal{Y}' and g:Y×Z×[0,T]×D→Z′g:\mathcal{Y} \times\mathcal{Z} \times[0,T] \times\mathcal{D} \to\mathcal{Z}' are given by

⟨f(p,v,t,μ),p′⟩Y′×Y=∫Ωs(t)p′ dx⟨g(p,v,t,μ),v′⟩Z′×Z=∫Ω−κ(p)−1v⋅v′ dx\langle f(p,v,t,\mu),p'\rangle_{\mathcal{Y}'\times\mathcal{Y}} = \int_{\Omega} s(t)p'\,dx \qquad\langle g(p,v,t,\mu),v'\rangle_{\mathcal{Z}'\times\mathcal{Z}} = \int_{\Omega} -\kappa(p)^{-1}v\cdot v'\,dx

for any (p,v,t)∈Y×Z×[0,T](p,v,t) \in\mathcal{Y} \times\mathcal{Z} \times[0,T], p′∈Yp' \in\mathcal{Y} and v′∈Zv' \in\mathcal{Z}.

To generate our numerical results we consider a two dimensional problem defined on the unit square Ω=[0,1]2\Omega= [0,1]^2. The initial condition for pressure is parametrized by μ∈D=[0,0.5]\mu\in\mathcal{D} = [0,0.5] through

p0(x;μ)={1if max⁡i=1,2∣xi−0.5∣<μ0otherwisep_0(x;\mu) = \begin{cases} 1 & \text{if } \max_{i=1,2}|x_i-0.5| < \mu\\ 0 & \text{otherwise} \end{cases}

where x=(x1,x2)∈Ωx=(x_1,x_2) \in\Omega, with conductivity κ(p)=2.0+p\kappa(p)=2.0+p and source s=0s=0. We perform the spatial discretization using a mixed finite element formulation, with the finite element spaces chosen such as to satisfy the inf-sup condition for stable mixed formulations. In particular, the variables y=py=p and z=vz=v are approximated in Yh⊂L2(Ω)\mathcal{Y}^h \subset L^2(\Omega) and Zh⊂H0(div⁡;Ω)\mathcal{Z}^h \subset H_0(\operatorname{div};\Omega). We choose the lowest-order Raviart-Thomas elements Yh=Q^0\mathcal{Y}^h=\widehat{Q}_0 and Zh=RT0\mathcal{Z}^h=\mathrm{RT}_0, where Q^0\widehat{Q}_0 denotes the space of piecewise constant scalar functions on the mesh, and RT0\mathrm{RT}_0 is the lowest-order Raviart-Thomas space consisting of vector fields whose normal components are continuous across element interfaces. Backward Euler (BE) method is used for temporal discretization with a fixed time step size Δt=0.001\Delta t=0.001 up to final time T=0.1T=0.1.

Solutions at all the time steps with parameters μ=0.15,0.25,0.35\mu=0.15, 0.25, 0.35 are collected as snapshots for the predictive case and μ=0.3\mu=0.3 for the reproductive case in the offline stage. We set μ=0.3\mu=0.3 for the online stage in both the reproductive and the predictive case. The number of snapshots per training parameter is Ns(y)=101N_s^{(y)} = 101 and Ns(z)=100N_s^{(z)} = 100. We perform both reproductive and predictive simulation runs, with a range of residual energy fractions summarized in Figure 4. In the figure, the basis dimensions satisfying different prescribed energy fractions ζy=ζz=10−Er\zeta_y = \zeta_z = 10^{-E_r} are reported for each field, with the relation defined in (10).

Reduced basis dimensions with respect to the residual energy fraction for the nonlinear diffusion simulations

Figure 4. Reduced basis dimensions with respect to the residual energy fraction for the nonlinear diffusion simulations.

Figure 5 illustrates how the ROM error varies with the number of sampled points for different hyper-reduction methods across a range of residual energy fractions. In every figure panel, the Pareto front between L2L^2 error of the pressure field, on the vertical axis, and number of sampled points on the horizontal axis, is shown for the different hyper-reduction methods. We note that the Pareto front points are optimal with respect to computational time and error, not necessarily with respect to the number of sampled interpolation/quadrature points. Every figure panel also includes a dashed reference line indicating the error of the ROM without hyper-reduction for the corresponding residual energy fraction to gauge the accuracy cost of hyper-reduction.

ROM error with varying sampled points for the nonlinear diffusion problem

Figure 5. ROM error with varying sampled points for the nonlinear diffusion problem. The dashed line indicates the error of the ROM without hyper-reduction (‘noHR’).

As the residual energy fraction (or equivalently, ROM basis dimensions) increases, the errors of both interpolation methods and EQP converge toward the error of the ROM without hyper-reduction. At Er=6E_r = 6 all methods in the reproductive case reach a relative error of about 10−310^{-3}, whereas for the predictive case the lowest relative error is approximately 10−410^{-4}. In both reproductive and predictive runs the error levels of the interpolation methods seems to correlate with ErE_r and not with the number of sampled interpolation points. On the contrary, the EQP error levels demonstrate a tendency to decrease as the number of quadrature points increases, especially when ErE_r is large. The lowest error levels obtained by each method are approximately of the same order of magnitude for this problem case. However, the EQP method seems to generally require a smaller number of quadrature points to reach a given error level.

The tradeoff between computational cost and relative error is made explicit in Figure 6, which depicts the Pareto fronts obtained for each hyper-reduction method among all values of ErE_r. In the figure, the relative L2L^2-error between ROM and FOM is plotted on the vertical axis and the relative wall time, i.e. the fraction between ROM wall time and FOM wall time for the online phase, is plotted on the horizontal axis. The overall Pareto front is drawn as a line connecting the most efficient configurations across all methods. In the reproductive case the overall Pareto front consists entirely of EQP method simulations. The lowest error level achieved is about 10−310^{-3}, at which point EQP records a relative online time of approximately 4×10−34 \times10^{-3}, while the interpolation methods record about 6×10−36 \times10^{-3}. In the predictive scenario, although EQP shows greater efficiency for higher error levels, a tradeoff appears as the error levels decrease. More specifically, at error levels below 10−310^{-3} or when the relative online time exceeds 10−210^{-2}, the interpolation methods emerge on the overall Pareto front.

Pareto fronts across all hyper-reduction methods for the nonlinear diffusion problem

Figure 6. Pareto fronts across all hyper-reduction methods for the nonlinear diffusion problem, illustrating the tradeoff between relative L2L^2 error and online phase wall time.

To summarize, for the nonlinear diffusion problem, the Pareto optimal method is EQP in the reproductive case as well as in the predictive case for error levels above 10−310^{-3}. For lower predictive error levels, interpolation methods also appear on the Pareto front, with no method consistently outperforming the others. The observed lower error levels in the predictive scenario compared to the reproductive one could be explained by the larger number of basis vectors retained for the same energy residual as shown in Figure 4. Furthermore, the samples taken in the offline stage seem to describe the system conditions tested in the online stage well. If one were to sample μ\mu further away from its online stage value, then the obtained error would be expected to rise.

Nonlinear elasticity

We consider the dynamics of a visco-hyperelastic solid of homogeneous neo-hookean material undergoing finite strains, i.e. with both geometric and material nonlinearities. The state of the solid is described as a function of time tt and reference geometry x~∈Ω~=Ω(0)\tilde{x} \in\widetilde{\Omega} = \Omega(0) at initial time t=0t = 0. The system evolves according to the equations

ρdvdt=∇⋅P(x)+ηΔvin Ω~×(0,T)dxdt=vin Ω~×(0,T)v=0on Γin×[0,T]n⋅∇v=0on (∂Ω~∖Γin)×[0,T]v=v0(μ)in Ω~×{0}x=0in Ω~×{0}(28)\begin{aligned} \rho\frac{d v}{d t} &= \nabla\cdot\mathbf{P}(x) + \eta\Delta v && \text{in } \widetilde{\Omega} \times(0,T) \\ \frac{d x}{d t} &= v && \text{in } \widetilde{\Omega} \times(0,T) \\ v &= 0 && \text{on } \Gamma_{\mathrm{in}} \times[0,T] \\ n \cdot\nabla v &= 0 && \text{on } (\partial\widetilde{\Omega} \setminus\Gamma_{\mathrm{in}}) \times[0,T] \\ v &= v_0(\mu) && \text{in } \widetilde{\Omega} \times\{0\} \\ x &= 0 && \text{in } \widetilde{\Omega} \times\{0\} \tag*{(28)} \end{aligned}

where xx and vv denote the solid’s deformation and velocity fields, while ρ\rho and η\eta are the constant reference density and viscosity of the material in its initial configuration. In addition, d/dtd/dt denotes the material derivative and nn the normal vector on the boundary ∂Ω~\partial\widetilde{\Omega}; the spatial differential operators act with respect to the reference coordinates x~\tilde{x}. The divergence of the first Piola-Kirchhoff stress tensor can be written as a nonlinear function ∇⋅P(x)=H(x)\nabla\cdot\mathbf{P}(x) = H(x), H:H0,Γin1(Ω~)→HΓin−1(Ω~)H : H^1_{0,\Gamma_{\mathrm{in}}}(\widetilde{\Omega}) \to H^{-1}_{\Gamma_{\mathrm{in}}}(\widetilde{\Omega}). Finally, v0v_0 denotes the initial condition on the velocity. The system is parametrized through the initial condition v0(μ)v_0(\mu).

To write the nonlinear elasticity equations (28) in the general variational form (2) we make the following identifications. We denote the differential variable y=(v,x)y = (v,x), and define the space Y=[H1(Ω~)]d×[H1(Ω~)]d\mathcal{Y} = [H^1(\widetilde{\Omega})]^d \times[H^1(\widetilde{\Omega})]^d and Hilbert space H=[L2(Ω~)]d×[L2(Ω~)]d\mathcal{H} = [L^2(\widetilde{\Omega})]^d \times[L^2(\widetilde{\Omega})]^d. There is no algebraic variable zz in this problem case. The inner product (⋅,⋅)H:H×H→R(\cdot,\cdot)_{\mathcal{H}} : \mathcal{H} \times\mathcal{H} \to\mathbb{R} and bilinear form a:Y×Y→Ra : \mathcal{Y} \times\mathcal{Y} \to\mathbb{R} are given by

((v,x),(v′,x′))H=∫Ω~ρv⋅v′+x⋅x′ dx~a((v,x),(v′,x′))=∫Ω~η∇v:∇v′−v⋅x′ dx~.((v,x),(v',x'))_{\mathcal{H}} = \int_{\widetilde{\Omega}} \rho v \cdot v' + x \cdot x'\,\mathrm{d}\tilde{x} \qquad a((v,x),(v',x')) = \int_{\widetilde{\Omega}} \eta\nabla v : \nabla v' - v \cdot x'\,\mathrm{d}\tilde{x}.

Finally, the nonlinear function f:Y×[0,T]×D→Y′f : \mathcal{Y} \times[0,T] \times\mathcal{D} \to\mathcal{Y}' is defined by its action

⟨f(v,x,t,μ),(v′,x′)⟩Y′×Y=∫Ω~−P(x):∇v′ dx~\langle f(v,x,t,\mu),(v',x')\rangle_{\mathcal{Y}'\times\mathcal{Y}} = \int_{\widetilde{\Omega}} -\mathbf{P}(x) : \nabla v'\,\mathrm{d}\tilde{x}

where Y′\mathcal{Y}' denotes the dual of Y\mathcal{Y} with respect to (⋅,⋅)H(\cdot,\cdot)_{\mathcal{H}}.

Our numerical results are generated for a two dimensional problem defined on the rectangular domain Ω~=[0,8]×[0,1]\widetilde{\Omega} = [0,8] \times[0,1]. The velocity initial condition is parametrized by μ∈D=[0.5,2]\mu\in\mathrm{D} = [0.5,2] through

v0(x~,0;μ)=(0,−μ80sin⁡(μx~1)),v_0(\tilde{x},0;\mu)=\left(0,-\frac{\mu}{80}\sin(\mu\tilde{x}_1)\right),

with x~=(x~1,x~2)∈Ω~\tilde{x}=(\tilde{x}_1,\tilde{x}_2)\in\tilde{\Omega}. The stress tensor P\mathbf{P} is derived from a strain energy density function Ψ\Psi that involves the shear modulus ν\nu and bulk modulus KK of the material and depends nonlinearly on the deformation gradient J\mathbf{J} and its determinant J=∣J∣J=\lvert\mathbf{J}\rvert, assuming finite strains,

Ψ(J)=ν2(Iˉ1−2)+K2(J/g−1)2\Psi(\mathbf{J})=\frac{\nu}{2}(\bar{I}_1-2)+\frac{K}{2}(J/g-1)^2

where gg is a reference volumetric scaling and Iˉ1=tr⁡(JTJ)/J\bar{I}_1=\operatorname{tr}(\mathbf{J}^{\mathsf{T}}\mathbf{J})/J, yielding the stress tensor

P=νJ⋅J+(KJ(J−g)g2−νtr⁡(JTJ)2J)J−T.\mathbf{P}=\frac{\nu}{J}\cdot\mathbf{J}+\left(\frac{KJ(J-g)}{g^2}-\frac{\nu\operatorname{tr}(\mathbf{J}^{\mathsf{T}}\mathbf{J})}{2J}\right)\mathbf{J}^{-\mathsf{T}}.

For the spatial discretization of the nonlinear elasticity equations we use a single finite element space VVh⊂[H1(Ω~)]d\mathcal{V}_{V}^{h}\subset[H^{1}(\tilde{\Omega})]^{d} of dimension NVN_{V} to approximate the displacement and velocity fields. Therefore, the differential variable y=(v,x)\mathbf{y}=(\mathbf{v},\mathbf{x}) is approximated in Yh=VVh×VVh⊂Y=[H1(Ω~)]d×[H1(Ω~)]d\mathcal{Y}^{h}=\mathcal{V}_{V}^{h}\times\mathcal{V}_{V}^{h}\subset\mathcal{Y}=[H^{1}(\tilde{\Omega})]^{d}\times[H^{1}(\tilde{\Omega})]^{d}. We choose VVh=[Q2]d\mathcal{V}_{V}^{h}=[Q_{2}]^{d}, where Q2Q_{2} denotes the space of continuous piecewise tensor-product polynomials of degree at most 2 in each coordinate direction, and [Q2]d[Q_{2}]^{d} is its dd-component vector-valued counterpart. Therefore Yh=[Q2]d×[Q2]d\mathcal{Y}^{h}=[Q_{2}]^{d}\times[Q_{2}]^{d}. Fourth-order explicit Runge-Kutta (RK4) method is used for temporal discretization with a fixed time step size Δt=0.01\Delta t=0.01 up to final time T=5.0T=5.0.

Solutions and intermediate Runge-Kutta stages at all the time steps with parameters μ=0.9,1.1\mu=0.9,1.1 are collected as snapshots for the predictive case and μ=1.0\mu=1.0 for the reproductive case in the offline stage. In both cases we set μ=1.0\mu= 1.0 for the online stage. The number of snapshots per training parameter is Ns(y)=501N_s^{(y)} = 501. Rather than constructing a single POD basis for the product space as described in § 3.1, we exploit its natural decomposition and compute independent reduced bases for each state component. We partition the differential variable yy into the velocity vv and displacement xx variables of equal full dimension. The reduced bases for the two variables are constructed separately from samples of FOM displacements and velocities. The dimensions of the reduced variables are denoted rxr_x for the reduced displacement dimension and rvr_v for the reduced velocity dimension. More precisely, the finite element representations of the velocity and displacement snapshots are assembled into two snapshot matrices, Sv,Sx∈RNV×Ns\mathbf{S}_v, \mathbf{S}_x \in\mathbb{R}^{N_V \times N_s}, and a thin singular value decomposition is performed separately on each matrix. The reduced basis dimensions are selected independently using the energy criterion (10), yielding the basis matrices Ψv∈RNV×rv\boldsymbol{\Psi}_v \in\mathbb{R}^{N_V \times r_v}, Ψx∈RNV×rx\boldsymbol{\Psi}_x \in\mathbb{R}^{N_V \times r_x}. The overall differential variable ROM subspace is then defined as the direct product of the corresponding reduced subspaces. Equivalently, the resulting basis functions are

supported on exactly one component of the product space, i.e.,

Ψ=[Ψv00Ψx]∈RNy×ry.(29)\boldsymbol{\Psi} = \begin{bmatrix} \boldsymbol{\Psi}_{v} & \mathbf{0} \\ \mathbf{0} & \boldsymbol{\Psi}_{x} \end{bmatrix} \in\mathbb{R}^{N_y \times r_y}. \tag*{(29)}

The overall reduced state dimension ry=rx+rvr_y = r_x + r_v is then given by the sum of the two reduced dimensions. The reduced basis dimensions obtained for each tested residual energy fraction are shown in Figure 7.

Reduced basis dimensions used for each residual energy fraction in the nonlinear elasticity simulations

Figure 7. Reduced basis dimensions used for each residual energy fraction in the nonlinear elasticity simulations.

Figure 8 and Figure 9 present an analogous comparison to that in Figure 5, with the displacement and velocity error results shown separately. The plotted points represent Pareto-optimal configurations for each hyper-reduction method, where Pareto optimality is determined with respect to computational time and the combined L2L^2-product norm of the error in the state (v,x)(v, x). The results demonstrate that for all methods the relative errors decrease as the number of interpolation/quadrature points increases. We note that the error levels for displacement are noticeably smaller than those for velocity. For displacement errors, in both the reproductive and predictive scenarios, EQP generally attains a given error level with fewer quadrature points than the interpolation methods. However, as the error approaches that of the ROM without hyper-reduction, the performance gap diminishes, and the interpolation methods may achieve comparable or even better efficiency. The interpolation methods exhibit relatively similar performance among themselves, and, with sufficiently many sampled points, all method converge toward the error of ROM without hyper-reduction. For the velocity field, interpolation methods reach the error level of ROM without hyper-reduction across all-scenarios, whereas EQP fails to do so in the reproductive scenario at low residual error fractions. In all cases, interpolation methods outperform EQP near the error level of the ROM without hyper-reduction. Overall, EQP tends to be more efficient at relatively high error levels, whereas interpolation methods become more efficient as higher accuracy is sought.

ROM displacement error with varying sampled points for the nonlinear elasticity problem

Figure 8. ROM displacement error with varying sampled points for the nonlinear elasticity problem.

ROM velocity error with varying sampled points for the nonlinear elasticity problem

Figure 9. ROM velocity error with varying sampled points for the nonlinear elasticity problem.

Figure Figure 10 displays the Pareto fronts obtained for each hyper-reduction method with respect to the displacement and velocity state errors and relative online wall time. For the displacement field, EQP composes the overall Pareto front across most error ranges in both scenarios, with Q-DEIM becoming Pareto optimal at the lowest error levels. The lowest attained relative error is approximately 10−510^{-5} in the reproductive scenario and 2⋅10−42 \cdot10^{-4} in the predictive scenario. For the velocity field, EQP similarly dominates the Pareto front in the reproductive scenario, except near 100100 error where interpolation methods are the highest performing, and at the lowest error levels where Q-DEIM and DEIM are Pareto optimal. Q-DEIM achieves the lowest error slightly above 10−210^{-2} at a relative online time of approximately 7×10−17 \times10^{-1}. In the predictive scenario for the velocity field, no single method consistently outperforms the others. The lowest attained error is approximately 4×10−14 \times10^{-1} at relative online time 6×10−16 \times10^{-1}, again by Q-DEIM. While no single method consistently dominates for the velocity field, EQP dominates the overall Pareto front for displacement errors across both scenarios, making it the more attractive choice when displacement accuracy is the primary concern.

Pareto fronts for displacement (top) and velocity (bottom) across all hyper-reduction methods in the nonlinear elasticity problem.

Figure 10. Pareto fronts for displacement (top) and velocity (bottom) across all hyper-reduction methods in the nonlinear elasticity problem.

The Pareto fronts highlight the tradeoff between computational efficiency and accuracy. For the velocity field, the reproductive scenario allows accuracy to be improved progressively as computational efficiency is sacrificed, from relative errors above 10%10\% at relative online time below 30%30\% to about 1%1\% at relative online time above 50%50\%. In contrast, the predictive scenario cannot reduce the relative error below approximately 40%40\%, even at the highest computational cost. On the other hand, in the case of structural dynamics the displacement field can be of greater interest, and in this case a small relative error is achieved with the EQP at a significantly higher speedup. For instance, a 0.1%0.1\% relative error can with the EQP method be achieved with approximately 90%90\% speedup in the reproductive case and 80%80\% speedup in the predictive case.

Lagrangian hydrodynamics

We consider the hydrodynamics of a compressible fluid governed by the Euler equations in a Lagrangian reference frame. Similarly to the nonlinear elasticity case, the medium is described as a function of time tt and reference coordinates of the material particles x~∈Ω~=Ω(0)\tilde{x} \in\tilde{\Omega} = \Omega(0) at initial time t~=0\tilde{t} = 0. In the Lagrangian description of the medium’s motion, the physical quantities are expressed as a function of its initial position x~\tilde{x} and time tt. The system of the Euler equations of compressible fluid dynamics in a Lagrangian reference frame is written as follows [68]

momentum conservation:ρdvdt=∇⋅σmass conservation:1ρdρdt=−∇⋅venergy conservation:ρdedt=σ:∇vequation of motion:dxdt=v(30)\begin{aligned} \text{momentum conservation:}\quad& \rho\frac{d v}{d t} = \nabla\cdot\sigma\\ \text{mass conservation:}\quad& \frac{1}{\rho}\frac{d \rho}{d t} = -\nabla\cdot v \\ \text{energy conservation:}\quad& \rho\frac{d e}{d t} = \sigma: \nabla v \\ \text{equation of motion:}\quad& \frac{d x}{d t} = v \tag*{(30)} \end{aligned}

where d/dtd/dt denotes the material derivative, ρ\rho the density of the fluid, xx and vv the position and velocity of the particles, ee the internal energy per unit mass and σ\sigma the deformation stress tensor. In the equations, the spatial differential operators act with respect to the current coordinates xx. We consider an isotropic stress tensor σ=−pI+σa\sigma=-pI+\sigma_a where pp denotes the thermodynamic pressure and σa\sigma_a the artificial viscosity stress, both of which depend on the differential variables nonlinearly. The thermodynamic pressure is described by the equation of state and can be expressed as a function of the density and internal energy. In what follows, we focus on the case of polytropic ideal gas with an adiabatic index γ>1\gamma>1, which yields the equation of state

p=(γ−1)ρe.(31)p=(\gamma-1)\rho e. \tag*{(31)}

The system is prescribed with an initial condition and a boundary condition n⋅v=h\boldsymbol{n}\cdot\boldsymbol{v}=h, where n\boldsymbol{n} is the outward normal unit vector on the domain boundary.

The semidiscrete Lagrangian formulation involves a computational mesh that deforms based on the fluid velocity. Using the Reynolds transport theorem [68], the mass conservation in (30) is satisfied by

ρ(x~,t)=ρ(x~,0)∣J(x~,t)∣(32)\rho(\tilde{x},t)=\frac{\rho(\tilde{x},0)}{\lvert J(\tilde{x},t)\rvert} \tag*{(32)}

where J=∇x~xJ=\nabla_{\tilde{x}}x denotes the Jacobian of the deformation gradient. Moreover, any integrals over the current domain Ω(t)\Omega(t) involve the transformation to the reference domain Ω~\tilde{\Omega} using the determinant of the transformation gradient ∣J∣\lvert J\rvert.

To write the remaining equations in (30) in the variational form (2) we define the following quantities. We denote the differential variable by y=(v,e,x)y=(v,e,x) and define the vector space Y=[H1(Ω~)]d×L2(Ω~)×[H1(Ω~)]d\mathcal{Y}=[H^1(\tilde{\Omega})]^d\times L^2(\tilde{\Omega})\times[H^1(\tilde{\Omega})]^d. There is no algebraic variable zz. We define the Hilbert space H=[L2(Ω~)]d×L2(Ω~)×[L2(Ω~)]d\mathcal{H}=[L^2(\tilde{\Omega})]^d\times L^2(\tilde{\Omega})\times[L^2(\tilde{\Omega})]^d with inner product (⋅,⋅)H:H×H→R(\cdot,\cdot)_{\mathcal{H}}:\mathcal{H}\times\mathcal{H}\to\mathbb{R}

((v,e,x),(v′,e′,x′))H=∫Ω(t)ρvv′+ρee′+xx′ dx((v,e,x),(v',e',x'))_{\mathcal{H}}=\int_{\Omega(t)}\rho vv'+\rho ee'+xx'\,dx

and denoted by Y′\mathcal{Y}' its dual with respect to (⋅,⋅)H(\cdot,\cdot)_{\mathcal{H}}. The bilinear form a:Y×Y→Ra:\mathcal{Y}\times\mathcal{Y}\to\mathbb{R} is given by

a((v,e,x),(v′,e′,x′))=−∫Ω(t)vx′ dxa((v,e,x),(v',e',x'))=-\int_{\Omega(t)}vx'\,dx

while the action of the nonlinear function f:Y×[0,T]→Y′f:\mathcal{Y}\times[0,T]\to\mathcal{Y}' by

⟨f(v,e,x,t),(v′,e′,x′)⟩Y′×Y=∫Ω(t)−σ(v,e,x):∇v′+(σ(v,e,x):∇v)e′ dx.\langle f(v,e,x,t),(v',e',x')\rangle_{\mathcal{Y}'\times\mathcal{Y}}=\int_{\Omega(t)}-\sigma(v,e,x):\nabla v'+(\sigma(v,e,x):\nabla v)e'\,dx.

Following [58] we adopt a spatial discretization for (30) using a kinematic space VVh⊂[H1(Ω~)]d\mathcal{V}_V^h\subset[H^1(\tilde{\Omega})]^d of dimension NVN_V for approximating the position and velocity functions, and a thermodynamic space VEh⊂L2(Ω~)\mathcal{V}_E^h\subset L^2(\tilde{\Omega}) of dimension NEN_E for approximating the energy. The density can be eliminated, and the equation of mass conservation can be decoupled from (30). Therefore, the differential variable y=(v,e,x)y=(v,e,x) is approximated in Yh=VVh×VEh×VVh⊂Y=[H1(Ω~)]d×L2(Ω~)×[H1(Ω~)]d\mathcal{Y}^h=\mathcal{V}_V^h\times\mathcal{V}_E^h\times\mathcal{V}_V^h\subset\mathcal{Y}=[H^1(\tilde{\Omega})]^d\times L^2(\tilde{\Omega})\times[H^1(\tilde{\Omega})]^d. We choose VVh=[Q2]d\mathcal{V}_V^h=[Q_2]^d and VhE=Q^1\mathcal{V}_{h}^{E}=\widehat{Q}_{1}, where Q2Q_{2} denotes the space of continuous piecewise tensor-product polynomials of degree at most 2 in each coordinate direction, so that [Q2]d[Q_{2}]^{d} is the corresponding dd-component vector-valued space, and Q^1\widehat{Q}_{1} denotes the space of discontinuous piecewise tensor-product polynomials of degree at most 1 in each coordinate direction. Therefore, Vh=[Q2]d×Q^1×[Q2]d\mathcal{V}^{h}=[Q_{2}]^{d}\times\widehat{Q}_{1}\times[Q_{2}]^{d}. Each problem case is time integrated using two methods: the averaged second-order explicit Runge Kutta (RK2Avg) method for conserving the total energy [58, 69] and the standard fourth-order explicit Runge Kutta (RK4) method. In either method, adaptive time step control is employed for numerical stability. We refer the reader to [58] for additional details.

We perform numerical simulations of three problem cases: Sedov blast wave, Taylor-Green vortex and triple point expansion, introduced in the following sections. For each problem we focus on reproductive simulations, where the constructed reduced models are tested using initial conditions that were part of their training data.

Solutions and intermediate Runge-Kutta stages at all the time steps and parameters are collected as snapshots. We make two modifications to the offline basis construction procedure outlined in § 3.1. First, we employ the time windowing technique, where the simulation time interval [0,T][0,T] is decomposed into a number NwN_{w} of time sub-intervals (windows)

0=τ0<τ1<…<τNw=T.(33)0=\tau_{0}<\tau_{1}<\ldots<\tau_{N_{w}}=T. \tag*{(33)}

Instead of building a single ROM for the whole time interval [0,T][0,T], multiple ROMs are constructed for piecewise approximating the local dynamics. In practice, the number of time windows NwN_{w} used is determined by prescribing the number of snapshots to be collected per window. The snapshots are clustered into groups by the time they are simulation into the corresponding time window. Second, as in the previous example, we assemble finite element representations of the velocity, internal energy, and mesh position snapshots for the time window [τi−1,τi][\tau_{i-1},\tau_{i}] into three snapshot matrices, Sv(i)∈RNV×Ns(y,i)\mathbf{S}_{v}^{(i)}\in\mathbb{R}^{N_{V}\times N_{s}^{(y,i)}}, Se(i)∈RNE×Ns(y,i)\mathbf{S}_{e}^{(i)}\in\mathbb{R}^{N_{E}\times N_{s}^{(y,i)}}, Sx(i)∈RNV×Ns(y,i)\mathbf{S}_{x}^{(i)}\in\mathbb{R}^{N_{V}\times N_{s}^{(y,i)}}, and create the basis matrices Ψv(i)∈RNV×rv(i)\mathbf{\Psi}_{v}^{(i)}\in\mathbb{R}^{N_{V}\times r_{v}^{(i)}}, Ψe(i)∈RNE×re(i)\mathbf{\Psi}_{e}^{(i)}\in\mathbb{R}^{N_{E}\times r_{e}^{(i)}}, Ψx(i)∈RNV×rx(i)\mathbf{\Psi}_{x}^{(i)}\in\mathbb{R}^{N_{V}\times r_{x}^{(i)}} which defines the product ROM basis matrix by

Ψ(i)=[Ψv(i)000Ψe(i)000Ψx(i)]∈RNy×ry(i),(34)\mathbf{\Psi}^{(i)}= \begin{bmatrix} \mathbf{\Psi}_{v}^{(i)} & 0 & 0\\ 0 & \mathbf{\Psi}_{e}^{(i)} & 0\\ 0 & 0 & \mathbf{\Psi}_{x}^{(i)} \end{bmatrix}\in\mathbb{R}^{N_{y}\times r_{y}^{(i)}}, \tag*{(34)}

where ry(i)=rv(i)+re(i)+rx(i)r_{y}^{(i)}=r_{v}^{(i)}+r_{e}^{(i)}+r_{x}^{(i)}. This separate basis construction allows flexible separate state update necessary in the RK2Avg scheme. For each problem, the number of snapshots and residual energy fraction ErE_{r} are such as to ensure an adequate basis size for each window. Finally, we also employ an adaptive timestepping strategy to dynamically adjust the timesteps during each simulation [26, 58].

The parameters used for the reduced simulations of each problem are summarized in Table 2, including the number of time windows (NwN_{w}) and the total number of snapshots (Ns(y)N_{s}^{(y)}) and reduced basis dimensions (rvr_{v} and rer_{e}) summed over all time windows, i.e., rv=∑i=1Nwrv(i)r_v = \sum_{i=1}^{N_w} r_v^{(i)} and rv=∑i=1Nwre(i)r_v = \sum_{i=1}^{N_w} r_e^{(i)} A detailed development of the reduction process using interpolation hyper-reduction methods is given in [26] and using quadrature methods in [28].

ProblemErE_rODE solverNwN_wNs(y)N_{s}^{(y)}rvr_vrer_e
Sedov blast wave6RK415145111837
Sedov blast wave6RK2Avg1575415140
Taylor-Green vortex6RK421064822
Taylor-Green vortex6RK2Avg2532823
Triple point expansion6RK423791110
Triple point expansion6RK2Avg21901210

Table 2. Parameters used for the reduced simulations of Lagrangian hydrodynamics problems.

Sedov blast wave

The Sedov blast wave problem is a three dimensional standard shock hydrodynamic test, involving the release of energy from a localized source and the formation of a propagating shock wave [70]. We consider a localized source of internal energy initially deposited at the origin of a three dimensional cube, in analogy to the two-dimensional test in [58]. The computational domain is the unit cube Ω~=[0,1]3\tilde{\Omega} = [0,1]^3 with wall boundary conditions on all surfaces, v⋅n=0\boldsymbol{v} \cdot\boldsymbol{n} = 0. We prescribe initial velocity v=0\boldsymbol{v} = 0 and initial density ρ=1\rho= 1. The initial energy is given by a delta function supported at the origin. In our implementation, the delta function energy source is approximated by setting the internal energy to zero in all degrees of freedom except at the origin, with e(0,0,0)=0.25e(0,0,0) = 0.25. The adiabatic index in the ideal gas equation of state is set to γ=1.4\gamma= 1.4.

Figure 11 illustrates how the ROM error varies with the number of sampled interpolation/quadrature points, averaged over the number of time windows, across different hyper-reduction methods. Our comparisons focus on the achieved ROM error between the two ODE solvers (RK4 and RK2Avg) under a fixed residual energy fraction ErE_r as given in Table 2. To obtain the presented results we increase the number of sampled interpolation points for interpolation methods and the number of nonzero sparse quadrature weights for EQP within each time window. The figure compares the errors for each of the three state variables: position, velocity and energy. The position field generally exhibits the smallest error, while the ordering of the energy and velocity errors depends on the case. For both solvers, the EQP method is the most efficient in terms of the number of quadrature points, achieving a given error level with approximately one order of magnitude fewer quadrature points. For the RK4 solver, EQP attains lower errors than the interpolation methods for the position and velocity fields; however, for the energy field, EQP does not achieve the lowest error levels, with the best interpolation results being nearly one order of magnitude smaller. Among the interpolation methods, DEIM generally demonstrates the most efficient performance in terms of the number of sampled interpolation points. For the RK2Avg solver, the interpolation methods achieve lower errors than EQP across all fields considered. Among them, S-OPT shows a slight advantage for the velocity field at lower error levels, whereas the position and energy fields exhibit comparable performance.

ROM error with varying sampled points for the Sedov blast wave problem

Figure 11. ROM error with varying sampled points for the Sedov blast wave problem.

Comparing the two solvers, EQP shows little difference in error between RK4 and RK2Avg, with RK4 yielding slightly smaller errors for the velocity and energy fields. In contrast, the interpolation methods exhibit more pronounced solver dependence. For the velocity and position fields, RK2Avg enables an improvement of approximately one order of magnitude in the attainable error, reaching error levels of approximately 10−510^{-5} for the position field and 10−410^{-4} for the velocity field. For the energy field, however, RK2Avg results in errors that are roughly one order of magnitude larger than those obtained with RK4, with minimum errors around 3×10−43 \times10^{-4}. Overall, while EQP is highly efficient in terms of the number of sampled points, the achievable error levels across methods vary with the solver and state component.

Figure 12 reveals the tradeoff between approximation accuracy and time, showing the Pareto fronts for L2L^2-product norm of the error in the state (v,e,x)(v,e,x), where all differential variables are aggregated into a single error metric rather than shown separately. For the RK4 solver, the EQP method dominates the overall Pareto front at error levels below 2×10−32 \times10^{-3}, with a relative online time of approximately 6×10−26 \times10^{-2}.

Pareto fronts across hyper-reduction methods for the Sedov blast wave problem

Figure 12. Pareto fronts across hyper-reduction methods for the Sedov blast wave problem.

Among the interpolation methods, DEIM achieves the best performance and occupies the upper segment of the overall Pareto front, reaching its lowest error level near 8×10−48 \times10^{-4} at a relative online time of about 7×10−27 \times10^{-2}. In the case of the RK2Avg solver, the interpolation methods constitute the Pareto-optimal set, with no single method dominating the others. The lowest velocity error is obtained by DEIM, achieving an error level of 4×10−44 \times10^{-4} at a relative online time of about 5×10−25 \times10^{-2}. Although the interpolation methods require considerably more sampled interpolation points than EQP, their relative online times are comparable or even smaller. This could be due to computational overhead stemming from the EQP sample mesh implementation, as discussed in the introduction of § 5. We also note the solver dependent performance of each hyper-reduction method. For EQP, the error and relative online time are similar across solvers. For S-OPT, both solvers exhibit gradual tradeoffs: RK4 spans error levels between 10−210^{-2} and 10−310^{-3} over relative online times from 4×10−24 \times10^{-2} to 2×10−12 \times10^{-1}, whereas RK2Avg reaches lower error levels between 10−310^{-3} and 4×10−44 \times10^{-4} at smaller relative online times from 2×10−22 \times10^{-2} to 8×10−28 \times10^{-2}. For DEIM and Q-DEIM, both methods exhibit a relatively steep tradeoff under RK4, with the error dropping from 10−210^{-2} to 10−310^{-3} over a narrower relative online time range of approximately 4×10−24 \times10^{-2} to 7×10−27 \times10^{-2}. Under RK2Avg, however, DEIM and Q-DEIM follow a more gradual tradeoff, similar to that observed for S-OPT. Overall, RK2Avg paired with interpolation methods yields the most favorable performance across the results considered.

Taylor-Green vortex

The Taylor-Green vortex problem is a three dimensional standard benchmark test for the incompressible inviscid Navier-Stokes equations. In this work we manufacture a smooth solution by extending the steady state Taylor-Green vortex solution to the compressible Euler equations, in analogy to the two-dimensional test in [58]. Our computation domain is the unit cube Ω~=[0,1]3\tilde{\Omega} = [0,1]^3 with wall boundary conditions on all surfaces, v⋅n=0v \cdot n = 0. Denoting x~=(x~1,x~2,x~3)∈Ω\tilde{x} = (\tilde{x}_1,\tilde{x}_2,\tilde{x}_3) \in\Omega, the initial velocity is given by

v(x~,0)=(sin⁡(πx~1)cos⁡(πx~2)cos⁡(πx~3),−cos⁡(πx~1)sin⁡(πx~2)cos⁡(πx~3))v(\tilde{x},0) = (\sin(\pi\tilde{x}_1)\cos(\pi\tilde{x}_2)\cos(\pi\tilde{x}_3),-\cos(\pi\tilde{x}_1)\sin(\pi\tilde{x}_2)\cos(\pi\tilde{x}_3))

and the initial thermodynamic pressure by

p(x~,0)=100+(cos⁡(2πx~1+cos⁡(2πx~2))(cos⁡(2πx~3)+2)−216p(\tilde{x},0) = 100 + \frac{(\cos(2\pi\tilde{x}_1+\cos(2\pi\tilde{x}_2))(\cos(2\pi\tilde{x}_3)+2)-2}{16}

with initial density ρ=1\rho= 1. Based on the above, the initial energy is determined by the equation of state (31) with adiabatic index set to γ=5/3\gamma= 5/3.

Figure 13 presents the ROM errors across hyper-reduction methods with respect to the average number of interpolation/quadrature points. With the RK4 solver, the EQP method requires fewer quadrature points than the interpolation methods to reach a given error level across all variables. More specifically, EQP achieves roughly an order of magnitude lower velocity error than the interpolation methods while using fewer quadrature points. Among the interpolation methods, S-OPT tends to exhibit the most efficient performance in terms of the number of quadrature points required for a given velocity error. With the RK2Avg solver, however, a different trend is observed. We note that the EQP method is converging to the no-hyper-reduction ROM performance level for all sampled values of K∗K^*. Although EQP requires fewer quadrature points to reach near no-hyper-reduction ROM performance, its velocity error levels remain higher than those of the interpolation methods. For approximately 2×1032 \times10^{3} quadrature points, the interpolation methods achieve lower velocity errors than EQP. The minimum velocity error obtained with the interpolation methods is approximately one order of magnitude smaller than that of EQP, albeit with a larger number of sampled interpolation points. Overall, EQP demonstrates greater efficiency with the RK4 solver, whereas with RK2Avg the interpolation methods yield higher accuracy in velocity.

ROM error plots for varying sampled points and hyper-reduction methods

Figure 13. ROM error with varying sampled points for the Taylor-Green vortex problem.

Figure 14 focuses on the tradeoff between computational time and L2L^{2}-product norm of the error in the state (v,e,x)(v,e,x) across different hyper-reduction methods. With the RK4 solver, the Pareto-optimal configurations progress from DEIM to S-OPT and finally to EQP as the error level decreases. The lowest total error is achieved by EQP, reaching approximately 3×10−33 \times10^{-3} with a relative online time slightly below 4×10−14 \times10^{-1}. With RK2Avg the overall Pareto front is dominated by the interpolation methods. They attain a total error of about 2×10−32 \times10^{-3} at a relative online time of 4×10−24 \times10^{-2}, and around 10−310^{-3} at 2×10−12 \times10^{-1}. Among them, Q-DEIM generally forms the Pareto front. To compare the performance of each method depending on the solver, all interpolation methods perform better with RK2Avg than with RK4. For EQP, the minimum obtained total error is slightly smaller with the RK4 solver, while the corresponding relative online times are of a similar magnitude. Overall, the interpolation methods exhibit shorter relative online times across both solvers. However, when using RK4 the lowest error is obtained by EQP at around 3×10−33 \times10^{-3}, making it the preferred option for accuracy below 10−210^{-2}. The lowest total error among all configurations is attained by Q-DEIM with the RK2Avg solver, reaching the 10−310^{-3} level.

Pareto fronts across hyper-reduction methods for the Taylor-Green vortex problem

Figure 14. Pareto fronts across hyper-reduction methods for the Taylor-Green vortex problem.

Triple point expansion

The triple point expansion problem is a three dimensional hydrodynamic shock test that features two materials in three different states. More specifically, we consider a three state, two material, 2D Riemann problem which generates vorticity, analogous to the two dimensional test in [58]. The computational domain is Ω~=[0,7]×[0,3]×[0,1.5]\tilde{\Omega}=[0,7]\times[0,3]\times[0,1.5] with wall boundary conditions. The initial velocity is given by v=0\boldsymbol{v}=0. Denoting x~=(x~1,x~2,x~3)∈Ω~\tilde{x}=(\tilde{x}_1,\tilde{x}_2,\tilde{x}_3)\in\tilde{\Omega}, the initial density is given by

ρ(x~,0)={1if x~1≤1 or x~2≤1.51/8if x~1>1 and x~2>1.5\rho(\tilde{x},0)= \begin{cases} 1 & \text{if }\tilde{x}_1\leq1\text{ or }\tilde{x}_2\leq1.5\\ 1/8 & \text{if }\tilde{x}_1>1\text{ and }\tilde{x}_2>1.5 \end{cases}

and the initial thermodynamic pressure by

p(x~,0)={1if x~1≤11/8if x~1>1.p(\tilde{x},0)= \begin{cases} 1 & \text{if }\tilde{x}_1\leq1\\ 1/8 & \text{if }\tilde{x}_1>1. \end{cases}

The adiabatic index is set to

γ(x~,0)={1.4if x~1>1 and x~2≤1.51.5otherwise\gamma(\tilde{x},0)= \begin{cases} 1.4 & \text{if }\tilde{x}_1>1\text{ and }\tilde{x}_2\leq1.5\\ 1.5 & \text{otherwise} \end{cases}

with the initial energy then determined by (31).

Beginning with Figure 15 we see that EQP achieves the error level of ROM without hyper-reduction with both solvers. With RK4 this error is obtained with 10310^3 quadrature points, while with RK2Avg a comparable error level is reached with roughly half as many quadrature points. Contrary to EQP, the accuracy of the interpolation methods varies significantly between the two solvers. With RK4 these methods are less efficient, exhibiting minimum velocity errors around 5×10−25\times10^{-2}, more than two orders of magnitude larger than EQP. With RK2Avg their performance improves considerably, reaching minimum velocity errors of about 10−310^{-3}, which represents a marked improvement over RK4, albeit still higher than EQP. The interpolation methods typically require between 10310^3 and 10410^4 sampled interpolation points, exceeding those required by EQP. Overall, EQP attains low error levels using fewer quadrature points across both solvers.

ROM error with varying sampled points for the triple point expansion problem

Figure 15. ROM error with varying sampled points for the triple point expansion problem.

Figure 16 shows that, although the interpolation methods use more sampled points than EQP, their relative online times are comparable or even smaller for the triple-point problem. As discussed in § 5.3.1, this discrepancy between the number of quadrature points and relative online wall time could be due to differences in sample meshes between EQP and interpolation-based methods; see Figure 2. For both solvers, the Pareto optimal configurations are initially composed of interpolation methods, with EQP taking over for lower error levels. At the lowest error levels, EQP achieves total errors of approximately 3×10−43\times10^{-4} with relative online times of about 4×10−24\times10^{-2} for RK2Avg and 6×10−26\times10^{-2} for RK4. On the contrary, the interpolation methods exhibit lower relative online times and reduced accuracy. With the RK4 solver they constitute the Pareto optimal set when the relative online time is below 5×10−25 \times10^{-2}, corresponding to total errors around 10−110^{-1}. With RK2Avg they remain Pareto optimal when the relative online time is below 3.5×10−23.5 \times10^{-2}, with total errors of 9×10−39 \times10^{-3} or higher. Consistent with earlier observations, these methods perform significantly better with RK2Avg than with RK4. Overall, EQP remains the most accurate method across both solvers, whereas interpolation methods offer a clear accuracy–efficiency tradeoff.

Pareto fronts across hyper-reduction methods for the triple point expansion problem

Figure 16. Pareto fronts across hyper-reduction methods for the triple point expansion problem.

Conclusion

We introduced a variational framework for describing PDEs solved by hyper-reduced models. Five example problems were stated in terms of this framework and solved using four hyper-reduction methods: three gappy POD-based interpolation methods and the EQP quadrature method. We compared the relative performance of these hyper-reduction methods by computing the Pareto optimal front with respect to speed-up and accuracy. We would like to remark that the scope of this comparison is limited to the selected methods and benchmark problems considered herein. While the presented results provide insight into the relative performance of the studied interpolation-based and quadrature-based methods, they should not be interpreted as a general comparison between these two classes of hyper-reduction approaches.

For the nonlinear diffusion and elasticity problems, we considered two types of simulations: (1) reproductive, where the reduced model is tested for parameter values that were used in its training; (2) predictive, where the reduced model predicts solutions for parameter values not used during its training. In the Lagrangian hydrodynamics problems, we considered only reproductive simulations. Our numerical experiments demonstrate that the performance of the tested hyper-reduction methods depends on the problem and time integration method used, with no single method being universally superior.

In the diffusion problem, the EQP method was generally more efficient in terms of relative online time in the reproductive scenario, reaching similar error levels to the interpolation methods but with higher speed-up. In the predictive scenario, the differences among the methods were less pronounced, with EQP and interpolation methods displaying similar performance at lower error levels.

A similar trend appeared for the nonlinear elasticity problem, both for the displacement and velocity fields: EQP was generally more efficient in the reproductive scenario and less dominant in the predictive one. The Q-DEIM method achieved the lowest errors across both scenarios and for both displacement and velocity, at the expense of a low relative speed-up of only 40%.

For the Lagrangian hydrodynamics problems, the performance of the interpolation methods was strongly influenced by the employed time integration method: interpolation methods performed consistently better with RK2Avg than with RK4. On the other hand, EQP did not demonstrate a clear dependency on the selected time integration method.

For interpolation methods, each selected mesh element includes all associated interpolation points, whereas EQP selects quadrature points individually from the whole mesh. This can explain why EQP achieved higher efficiency with respect to the number of quadrature points in most of our numerical results. However, due to computational overhead in the creation of the sampled mesh elements, this advantage did not translate to the expected efficiency in relative online time in our Lagrangian hydrodynamics test cases. The testing of these three hydrodynamics problems focuses on reproductive simulations to keep the comparisons as simple and clear as possible.

As seen in the other problems, predictive simulations tend to have larger error than reproductive ones, with more error components. In particular, there is approximation of the solution using a fixed reduced basis, in addition to approximation of the hyper-reduced terms. The larger number of error components makes a straightforward comparison of hyper-reduction methods difficult for more complex problems such as the Lagrangian hydrodynamics ones. Testing on reproductive simulations enables comparison of the hyper-reduction approximation error. It also simplifies comparison of computational time, by avoiding the need to balance the choice of basis size and number of hyper-reduction samples for fast and accurate approximation of the predictive solution.

Overall, our findings demonstrate that the EQP method can provide a significant speed-up at high accuracy levels for a broad range of problems. Nevertheless, interpolation methods can achieve a higher speed-up or better accuracy in certain cases. The relative performance of the studied hyper-reduction methods depends on the problem case, choice of time integration method, and whether the tested simulation is reproductive or predictive. These results highlight the need for problem-specific selection of hyper-reduction strategies when choosing between interpolation and quadrature methods.

Acknowledgments

This work was supported in part by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Scientific Discovery through Advanced Computing (SciDAC) program through the LEADS SciDAC Institute under Project Number SCW1933 at Lawrence Livermore National Laboratory (LLNL). LLNL is operated by Lawrence Livermore National Security LLC, for the U.S. Department of Energy, National Nuclear Security Administration under Contract DE-AC52-07NA27344. IM release number: LLNL-JRNL-2013738. Axel Larsson was supported by the U.S. National Science Foundation Grant award number 2122269. Part of this work was performed while Axel Larsson, Minji Kim and Chris Vales were research interns at LLNL supported by the Mathematical Sciences Graduate Internship (MSGI) program administered by the U.S. National Science Foundation. Chris Vales also acknowledges support from the U.S. Department of Energy under grant DE-SC0025101. The authors thank Adrian Humphry and Masayuki Yano from the University of Toronto for their valuable feedback on an earlier version of this manuscript and for providing a piece of the code used in our implementation of the empirical quadrature procedure.

Disclaimer

This document was prepared as an account of work sponsored by an agency of the United States government. Neither the United States government nor Lawrence Livermore National Security LLC nor any of their employees makes any warranty, expressed or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States government or Lawrence Livermore National Security LLC. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States government or Lawrence Livermore National Security LLC and shall not be used for advertising or product endorsement purposes.

Command line options

To facilitate the reproduction of our results, we present the command line options used for each problem. Examples are provided for the predictive scenarios in § 5.1 and 5.2 and for the reproductive scenario with the RK2Avg solver in § 5.3. Each problem corresponds to a specific executable: mixed_nonlinear_diffusion in libROM, nonlinear_elasticity_global_rom in libROM and laghos in Laghos. Due to ongoing development in the repository, the presented commands are subject to change. The following commands are compatible with the recent commits of the master branch of MFEM 1, the master branch of libROM 2, and the rom branch of Laghos 3.

In order to use the ROM capability of Laghos, the user has to navigate to the rom subdirectory.

The conventions used in the examples are as follows. For Sections A.1 and A.2, the following apply to the online phase:

  • EQP method: use the options -eqp -ns; the number of quadrature points can be restricted with -maxnnls.

  • Interpolation methods: specify the hyper-reduction method via -hrtype and the number of sampling points with -nsr.

For Section A.3:

  • -s 7 corresponds to the RK2Avg solver and -s 4 to RK4; RK2Avg is used in the examples.

  • EQP method: requires the -eqp option in the merge phase; in the preprocessing and online phases use -hrsamptype eqp and -lqnnls.

  • Interpolation methods: specify the hyper-reduction type in the preprocessing phase with -hrsamptype; the number of sampling points is controlled by -sfacv and -sface.

Nonlinear diffusion

The following commands are used for the nonlinear diffusion problem in § 5.1. The working directory is assumed to be libROM/examples/prom.

  1. Offline phase (predictive scenario):

./mixed_nonlinear_diffusion -p 1 -offline -id 0 -sh 0.25
./mixed_nonlinear_diffusion -p 1 -offline -id 1 -sh 0.15
./mixed_nonlinear_diffusion -p 1 -offline -id 2 -sh 0.35
  1. Merge phase:

./mixed_nonlinear_diffusion -p 1 -merge -ns 3
  1. Create the FOM comparison data:

./mixed_nonlinear_diffusion -p 1 -offline -id 3 -sh 0.3
  1. Online phase for EQP:

./mixed_nonlinear_diffusion -p 1 -online -rrdim 6 -rwdim 3 -id 3 -sh
0.3 -eqp -ns 3

Online phase for S-OPT:

./mixed_nonlinear_diffusion -p 1 -online -rrdim 6 -rwdim 3 -id 3 -sh
0.3 -nldim 6 -nsr 100 -hrtype sopt

Nonlinear elasticity

The following commands are used for the nonlinear diffusion problem in § 5.2. The working directory is again assumed to be libROM/examples/prom.

  1. Offline phase (predictive scenario):

./nonlinear_elasticity_global_rom -offline -dt 0.01 -tf 5.0 -s 14 -
vs 100 -sc 0.9 -id 0
./nonlinear_elasticity_global_rom -offline -dt 0.01 -tf 5.0 -s 14 -
vs 100 -sc 1.1 -id 1
  1. Merge phase:

./nonlinear_elasticity_global_rom -merge -ns 2 -dt 0.01 -tf 5.0
  1. Create the FOM comparison data:

./nonlinear_elasticity_global_rom -offline -dt 0.01 -tf 5.0 -s 14 -
vs 100 -sc 1.0 -id 2
  1. Online phase for EQP:

./nonlinear_elasticity_global_rom -online -dt 0.01 -tf 5.0 -s 14 -vs
100 -eqp -ns 2 -rvdim 3 -rxdim 2 -hdim 1 -sc 1.0

Online phase for S-OPT:

./nonlinear_elasticity_global_rom -online -dt 0.01 -tf 5.0 -s 14 -vs
100 -hyp -hrtype sopt -rvdim 3 -rxdim 2 -hdim 5 -nsr 100 -sc
1.0

Lagrangian hydrodynamics

The following commands are used for the Lagrangian hydrodynamics simulations in § 5.3. The working directory is assumed to be Laghos/rom

Problem specification: First, we present the commands used to set up each problem.

  • Sedov blast wave problem: ./laghos -m data/cube01_hex.mesh -p 1 -pt 211 -s 7 -tf 0.2

  • Taylor-Green vortex problem: ./laghos -m data/cube01_hex.mesh -p 0 -cfl 0.1 -s 7 -tf 0.1

  • Triple-point expansion problem: ./laghos -m data/box01_hex.mesh -p 3 -cfl 0.5 -s 7 -tf 0.5

ROM simulation: Next, we present the command line options used in each stage of the ROM simulation for the Sedov blast wave problem. These options should be appended to the problem setup command for Sedov, except for the merge phase, which is executed independently. The same procedure applies to the other problems by replacing the problem specification accordingly. Below, we provide example commands for EQP and S-OPT.

  1. Offline phase:

     -offline -writesol -romsns -rpar 0 -rostype interpolate -sdim 10000
     -sample-stages
  1. Merge phase for EQP (executed independently):

     ./merge -nset 1 -romsns -romos -rostype interpolate -nwinsamp 50 -ef
         0.999999 -eqp

    Merge phase for S-OPT (executed independently):

     ./merge -nset 1 -romsns -romos -rostype interpolate -nwinsamp 50 -ef
         0.999999
  1. Hyper-reduction preprocessing phase for EQP:

     -online -romhrprep -romsns -rostype interpolate -nwin 15 -hrsamptype
         eqp -lqnnls

    Hyper-reduction preprocessing phase for S-OPT:

     -online -romhrprep -romsns -rostype interpolate -nwin 15 -hrsamptype
         sopt -sfacv 2 -sface 2
  1. ROM online phase for EQP:

     -online -romhr -romsns -rostype interpolate -nwin 15 -hrsamptype eqp
         -lqnnls

    ROM online phase for S-OPT:

     -online -romhr -romsns -rostype interpolate -nwin 15 -sfacv 2 -sface
         2
  1. Postprocessing phase (solution reconstruction and error evaluation):

-restore -romsns -rostype interpolate -nwin 15 -soldiff

References

  1. [1]Tarantola, A.: Inverse Problem Theory and Methods for Model Parameter Estimation. SIAM, Philadelphia (2005)DOI
  2. [2]Biegler, L.T., Ghattas, O., Heinkenschloss, M., Bloemen Waanders, B.: Large-scale PDE-constrained optimization: an introduction. In: Large-scale PDE-constrained Optimization, pp. 3–13. Springer, Berlin (2003)
  3. [3]Biegler, L.T., Ghattas, O., Heinkenschloss, M., Keyes, D., Bloemen Waanders, B.: Real-time PDE-constrained Optimization. SIAM, Philadelphia (2007)
  4. [4]Gunzburger, M.D.: Perspectives in Flow Control and Optimization. SIAM, Philadelphia (2002)
  5. [5]Anirudh, R., Archibald, R., Asif, M.S., Becker, M.M., Benkadda, S., Bremer, P.-T., Budé, R.H., Chang, C.-S., Chen, L., Churchill, R., et al.: 2022 review of data-driven plasma science. IEEE Trans. Plasma Sci. (2023)DOI
  6. [6]Schmid, P.J.: Dynamic mode decomposition of numerical and experimental data. J. Fluid Mech. 656, 5–28 (2010)
  7. [7]Brunton, S.L., Proctor, J.L., Kutz, J.N.: Discovering governing equations from data by sparse identification of nonlinear dynamical systems. Proc. Natl. Acad. Sci. USA 113(15), 3932–3937 (2016)DOI
  8. [8]Lagaris, I.E., Likas, A., Fotiadis, D.I.: Artificial neural networks for solving ordinary and partial differential equations. IEEE Trans. Neural Networks 9(5), 987–1000 (1998) https://doi.org/10.1109/72.712178
  9. [9]Merwe, R., Leen, T.K., Lu, Z., Frolov, S., Baptista, A.M.: Fast neural network surrogates for very high dimensional physics-based models in computational oceanography. Neural Networks 20(4), 462–478 (2007) https://doi.org/10.1016/j.neunet.2007.04.023
  10. [10]Karniadakis, G.E., Kevrekidis, I.G., Lu, L., Perdikaris, P., Wang, S., Yang, L.: Physics-informed machine learning. Nat. Rev. Phys. 3(6), 422–440 (2021)DOI
  11. [11]Raissi, M., Perdikaris, P., Karniadakis, G.E.: Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. J. Comput. Phys. 378, 686–707 (2019)DOI
  12. [12]Kovachki, N., Li, Z., Liu, B., Azizadenesheli, K., Bhattacharya, K., Stuart, A., Anandkumar, A.: Neural operator: learning maps between function spaces with applications to PDEs. J. Mach. Learn. Res. 24(89), 1–97 (2023)DOI
  13. [13]Gugercin, S., Antoulas, A.C.: A survey of model reduction by balanced truncation and some new results. Int. J. Control 77(8), 748–766 (2004)
  14. [14]Benner, P., Gugercin, S., Willcox, K.: A survey of projection-based model reduction methods for parametric dynamical systems. SIAM Rev. 57(4), 483–531 (2015)DOI
  15. [15]Veroy, K., Prud’homme, C., Patera, A.T.: Reduced-basis approximation of the viscous burgers equation: rigorous a posteriori error bounds. C.R. Math. 337(9), 619–624 (2003) https://doi.org/10.1016/j.crma.2003.09.023
  16. [16]Choi, Y., Carlberg, K.: Space–time least-squares Petrov–Galerkin projection for nonlinear model reduction. SIAM J. Sci. Comput. 41(1), 26–58 (2019)arxiv.org/abs/1703.04560
  17. [17]Choi, Y., Coombs, D., Anderson, R.: SNS: a solution-based nonlinear subspace method for time-dependent model order reduction. SIAM J. Sci. Comput. 42(2), 1116–1146 (2020)
  18. [18]Carlberg, K., Choi, Y., Sargsyan, S.: Conservative model reduction for finite-volume models. J. Comput. Phys. 371, 280–314 (2018)DOI
  19. [19]Xiao, D., Fang, F., Buchan, A.G., Pain, C.C., Navon, I.M., Du, J., Hu, G.: Non-linear model reduction for the Navier–Stokes equations using residual DEIM method. J. Comput. Phys. 263, 1–18 (2014)DOI
  20. [20]Burkardt, J., Gunzburger, M., Lee, H.-C.: POD and CVT-based reduced-order modeling of Navier–Stokes flows. Comput. Methods Appl. Mech. Eng. 196(1-3), 337–355 (2006)DOI
  21. [21]Hoang, C., Choi, Y., Carlberg, K.: Domain-decomposition least-squares Petrov-Galerkin (DD-LSPG) nonlinear model reduction. Comput. Methods Appl. Mech. Eng. 384, 113997 (2021)
  22. [22]Fritzen, F., Haasdonk, B., Ryckelynck, D., Schöps, S.: An algorithmic comparison of the hyper-reduction and the discrete empirical interpolation method for a nonlinear thermal problem. Math. Comput. Appl. 23(1), 8 (2018)
  23. [23]Mojgani, R., Balajewicz, M.: Lagrangian basis method for dimensionality reduction of convection dominated nonlinear flows. arXiv:1701.04343 (2017)arxiv.org/abs/1701.04343
  24. [24]Zhao, P., Liu, C., Feng, X.: POD-DEIM based model order reduction for the spherical shallow water equations with Turkel-Zwas finite difference discretization. J. Appl. Math. (2014)DOI
  25. [25]Stefanescu, R., Navon, I.M.: POD/DEIM nonlinear model order reduction of an ADI implicit shallow water equations model. J. Comput. Phys. 237, 95–114 (2013)
  26. [26]Copeland, D.M., Cheung, S.W., Huynh, K., Choi, Y.: Reduced order models for Lagrangian hydrodynamics. Comput. Methods Appl. Mech. Eng. 388, 114259 (2022) https://doi.org/10.1016/j.cma.2021.114259
  27. [27]Cheung, S.W., Choi, Y., Copeland, D.M., Huynh, K.: Local Lagrangian reduced-order modeling for the Rayleigh-Taylor instability by solution manifold decomposition. J. Comput. Phys. 472, 11655 (2023) https://doi.org/10.1016/j.jcp.2022.111655
  28. [28]Vales, C., Cheung, S.W., Copeland, D.M., Choi, Y.: Machine-precision energy conservative reduced models for Lagrangian hydrodynamics by quadrature methods. arXiv:2508.21279 (2025) https://doi.org/10.48550/arXiv.2508.21279
  29. [29]Glas, S., Patera, A.T., Urban, K.: A reduced basis method for the wave equation. Int. J. Comput. Fluid Dyn. 34(2), 139–146 (2020)DOI
  30. [30]Cheung, S.W., Chung, E.T., Efendiev, Y., Leung, W.T.: Explicit and energy-conserving constraint energy minimizing generalized multiscale discontinuous Galerkin method for wave propagation in heterogeneous media. Multiscale Model. Simul. 19(4), 1736–1759 (2021)arxiv.org/abs/2009.00991
  31. [31]Choi, Y., Brown, P., Arrighi, B., Anderson, R., Huynh, K.: Space-time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems. J. Comput. Phys. 424, 109845 (2021)arxiv.org/abs/1910.01260
  32. [32]Cheng, M.-C.: A reduced-order representation of the Schrödinger equation. AIP Adv. 6(9), 095121 (2016)DOI
  33. [33]McBane, S., Choi, Y.: Component-wise reduced order model lattice-type structure design. Comput. Methods Appl. Mech. Eng. 381, 113813 (2021)DOI
  34. [34]Choi, Y., Boncoraglio, G., Anderson, S., Amsallem, D., Farhat, C.: Gradient-based constrained optimization using a database of linear reduced-order models. J. Comput. Phys. 423, 109787 (2020)arxiv.org/abs/1506.07849
  35. [35]Choi, Y., Oxberry, G., White, D., Kirchdoerfer, T.: Accelerating design optimization using reduced order models. arXiv:1909.11320 (2019)arxiv.org/abs/1909.11320
  36. [36]Jiang, R., Durlofsky, L.J.: Implementation and detailed assessment of a GNAT reduced-order model for subsurface flow simulation. J. Comput. Phys. 379, 192–213 (2019)
  37. [37]Yang, Y., Ghasemi, M., Gildin, E., Efendiev, Y., Calo, V., et al.: Fast multiscale reservoir simulations with POD-DEIM model reduction. SPE Journal 21(06), 2–141 (2016)DOI
  38. [38]Wang, M., Cheung, S.W., Chung, E.T., Vasilyeva, M., Wang, Y.: Generalized multiscale model for fractured vuggy carbonate reservoirs. J. Comput. Appl. Math. 366, 112370 (2020)arxiv.org/abs/1810.12419
  39. [39]Amsallem, D., Zahr, M., Choi, Y., Farhat, C.: Design optimization using hyper-reduced-order models. Struct. Multidiscip. Optim. 51(4), 919–940 (2015)DOI
  40. [40]Grimberg, S., Farhat, C., Tezaur, R., Bou-Mosleh, C.: Mesh sampling and weighting for the hyperreduction of nonlinear Petrov-Galerkin reduced-order models with local reduced-order bases. Int. J. Numer. Methods Eng. 122(7), 1846–1874 (2021)arxiv.org/abs/2008.02891
  41. [41]Everson, R., Sirovich, L.: Karhunen–Loève procedure for gappy data. J. Opt. Soc. Am. A 12(8), 1657–1664 (1995)DOI
  42. [42]Barrault, M., Maday, Y., Nguyen, N.C., Patera, A.T.: An ‘empirical interpolation’ method: application to efficient reduced-basis discretization of partial differential equations. C.R. Math. 339(9), 667–672 (2004) https://doi.org/10.1016/j.crma.2004.08.006
  43. [43]Chaturantabut, S., Sorensen, D.C.: Nonlinear model reduction via discrete empirical interpolation. SIAM J. Sci. Comput. 32(5), 2737–2764 (2010)DOI
  44. [44]Carlberg, K., Farhat, C., Cortial, J., Amsallem, D.: The GNAT method for nonlinear model reduction: Effective implementation and application to computational fluid dynamics and turbulent flows. J. Comput. Phys. 242, 623–647 (2013)DOI
  45. [45]Drmac, Z., Gugercin, S.: A new selection operator for the discrete empirical interpolation method—improved a priori error bound and extensions. SIAM J. Sci. Comput. 38(2), 631–648 (2016)DOI
  46. [46]Drmac, Z., Saibaba, A.K.: The discrete empirical interpolation method: canonical structure and formulation in weighted inner product spaces. SIAM J. Matrix Anal. Appl. 39(3), 1152–1180 (2018)
  47. [47]Lauzon, J.T., Cheung, S.W., Shin, Y., Choi, Y., Copeland, D.M., Huynh, K.: S-OPT: a points selection algorithm for hyper-reduction in reduced order models. SIAM J. Sci. Comput. 46(4), 474–501 (2024)DOI
  48. [48]An, S.S., Kim, T., James, D.L.: Optimizing cubature for efficient integration of subspace deformations. ACM Trans. Graph. 27(5), 1–10 (2008) https://doi.org/10.1145/1409060.1409118
  49. [49]Farhat, C., Chapman, T., Avery, P.: Structure-preserving, stability, and accuracy properties of the energy-conserving sampling and weighting method for the hyper reduction of nonlinear finite element dynamic models. Int. J. Numer. Methods Eng. 102(5), 1077–1110 (2015)DOI
  50. [50]Hernandez, J.A., Caicedo, M.A., Ferrer, A.: Dimensional hyper-reduction of non-linear finite element models via empirical cubature. Comput. Methods Appl. Mech. Eng. 313, 687–722 (2017)
  51. [51]Patera, A.T., Yano, M.: An LP empirical quadrature procedure for parametrized functions. C.R. Math. 355(11), 1161–1167 (2017) https://doi.org/10.1016/j.crma.2017.10.020
  52. [52]Yano, M., Patera, A.T.: An LP empirical quadrature procedure for reduced basis treatment of parametrized nonlinear PDEs. Comput. Methods Appl. Mech. Eng. 344, 1104–1123 (2019) https://doi.org/10.1016/j.cma.2018.02.028
  53. [53]Bhattacharyya, S., Tao, J., Gildin, E., Ragusa, J.C.: Hyper-reduction techniques for efficient simulation of large-scale engineering systems. Arch. Comput. Methods Eng., 1–43 (2025)DOI
  54. [54]Brands, B., Davydov, D., Mergheim, J., Steinmann, P.: Reduced-order modelling and homogenisation in magneto-mechanics: a numerical comparison of established hyper-reduction methods. Math. Comput. Appl. 24(1), 20 (2019)DOI
  55. [55]Delagnes, T., Henneron, T., Clenet, S., Fratila, M., Ducreux, J.: Comparison of hyper-reduction methods combined with pod: Model order reduction of a squirrel cage induction machine in nonlinear case. IEEE Trans. Magn. 60(6), 1–10 (2024)DOI
  56. [56]Romor, F., Stabile, G., Rozza, G.: Explainable hyper-reduced order models on nonlinearly approximated solution manifolds of compressible and incompressible navier-stokes equations. J. Comput. Phys. 524, 113729 (2025)arxiv.org/abs/2308.03396
  57. [57]Choi, Y., Arrighi, W.J., Copeland, D.M., Anderson, R.W., Oxberry, G.M., USDOE NNSA: libROM (2019). https://www.osti.gov//servlets/purl/1505575
  58. [58]Dobrev, V.A., Kolev, T.V., Rieben, R.N.: High-order curvilinear finite element methods for Lagrangian hydrodynamics. SIAM J. Sci. Comput. 34(5), 606–641 (2012)DOI
  59. [59]MFEM: Modular Finite Element Methods. mfem.org. https://doi.org/10.11578/dc.20171025.1248
  60. [60]Carlberg, K., Bou-Mosleh, C., Farhat, C.: Efficient non-linear model reduction via a least–squares Petrov–Galerkin projection and compressive tensor approximations. Int. J. Numer. Methods Eng. 86, 155–181 (2011)DOI
  61. [61]Peherstorfer, B., Drmac, Z., Gugercin, S.: Stability of discrete empirical interpolation and gappy proper orthogonal decomposition with randomized and deterministic sampling points. SIAM J. Sci. Comput. 42(5), 2837–2864 (2020)arxiv.org/abs/1808.10473
  62. [62]Pukelsheim, F.: Optimal Design of Experiments. SIAM, Philadelphia (2006)
  63. [63]Shin, Y., Xiu, D.: On a near optimal sampling strategy for least squares polynomial regression. J. Comput. Phys. 326, 931–946 (2016)DOI
  64. [64]Du, E., Yano, M.: Efficient hyperreduction of high-order discontinuous Galerkin methods: element-wise and point-wise reduced quadrature formulations. J. Comput. Phys. 466, 111399 (2022) https://doi.org/10.1016/j.jcp.2022.111399
  65. [65]Sleeman, M.K., Yano, M.: Goal-oriented model reduction for parametrized time-dependent nonlinear partial differential equations. Comput. Methods Appl. Mech. Eng. 388, 114206 (2022) https://doi.org/10.1016/j.cma.2021.114206
  66. [66]Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. SIAM, Philadelphia (1995)
  67. [67]Humphry, A., Yano, M.: Efficient hyperreduction for large-scale problems: exploiting reducible constraint manifolds in empirical quadrature procedure. Int. J. Numer. Meth. Eng. 126(23), 70204 (2025) https://doi.org/10.1002/nme.70204
  68. [68]Aris, R.: Vectors, Tensors, and the Basic Equations of Fluid Mechanics. Dover, New York (1989)
  69. [69]Sandu, A., Tomov, V., Cervena, L., Kolev, T.: Conservative high-order time integration for Lagrangian hydrodynamics. SIAM J. Sci. Comput. 43(1), 221–241 (2021)DOI
  70. [70]Sedov, L.I., Volkovets, A.: Similarity and Dimensional Methods in Mechanics. CRC Press, Boca Raton (2018)

Paper details

vlnc:W_zbsr2ecx
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents