betaFeedback

WorksMathematics

Symplectic model reduction of Hamiltonian systems using data-driven quadratic manifolds

Abstract

This work presents two novel approaches for the symplectic model reduction of high-dimensional Hamiltonian systems using data-driven quadratic manifolds. Classical symplectic model reduction approaches employ linear symplectic subspaces for representing the high-dimensional system states in a reduced-dimensional coordinate system. While these approximations respect the symplectic nature of Hamiltonian systems, linear basis approximations can suffer from slowly decaying Kolmogorov NN-width, especially in wave-type problems, which then requires a large basis size. We propose two different model reduction methods based on recently developed quadratic manifolds, each presenting its own advantages and limitations. The addition of quadratic terms to the state approximation, which sits at the heart of the proposed methodologies, enables us to better represent intrinsic low-dimensionality in the problem at hand. Both approaches are effective for issuing predictions in settings well outside the range of their training data while providing more accurate solutions than the linear symplectic reduced-order models.

Introduction

Computational modeling, simulation, and control of dynamical systems characterized by Hamiltonian mechanics are essential for many science and engineering applications such as robotics, quantum mechanics, solid state physics, and climate modeling, see [37, 39]. Hamiltonian partial differential equations (PDEs) demonstrate complex dynamic behavior while possessing underlying mathematical structures in the form of symmetries, Casimirs, symplecticity, and energy conservation. The structure-preserving spatial discretization of Hamiltonian PDEs with finite element methods, spectral methods, or finite difference methods leads to finite-dimensional Hamiltonian systems with large state-space dimensions.

For a high-dimensional Hamiltonian system, it is desirable to construct a reduced-order model (ROM) that preserves the underlying geometric structure and in particular, the stability of the full-order model (FOM). To this end, the field of structure-preserving model reduction has developed efficient tools for reducing the computational complexity of high-dimensional FOMs while preserving the underlying geometric structure. Symplectic model reduction of Hamiltonian systems was introduced in [50], where the Galerkin projection-based ROM was modified so that the ROM retains the underlying symplectic structure. In another research direction, the work in [38] presented a greedy approach for symplectic model reduction of parametric Hamiltonian systems. A variety of symplectic model reduction approaches have been developed along these two research directions recently, e.g., basis generation for symplectic model reduction of Hamiltonian systems [6, 11, 8, 9], modified projection techniques [21, 29, 44], and data-driven operator inference [58, 56, 25]. However, all of the aforementioned methods for symplectic model reduction project onto linear subspaces which often requires simulating high-dimensional ROMs to obtain accurate approximate solutions.

Classical projection-based model reduction methods encounter substantial difficulties whenever the solution manifold has so-called Kolmogorov NN-widths that decay slowly with increasing NN [35]. The Kolmogorov NN-width quantifies the degree of accuracy by which a set can be approximated using linear subspaces of dimension NN. If the NN-widths decay slowly with increasing NN, the associated ROMs can provide accurate approximate solutions only for large values of NN, which in turn defeats the original purpose of achieving computational speedups. This poses substantial limitations to the spectrum of possible applications. Many physics-based systems do not exhibit a global low-rank structure and are characterized by slowly decaying Kolmogorov NN-widths, such as those featuring coherent structures that propagate in space-time [24, 43]. Strategies aimed at overcoming this bottleneck typically fall into one of three categories: (1) dictionary approaches (local reduced basis methods, divide-and-conquer, [3, 18, 48, 14, 13]), (2) time-dependent basis or other transformations [30, 46, 51, 41, 42, 59, 34, 29, 54], (3) and the use of nonlinear approximation techniques (deep learning and other data-driven manifold techniques) [15, 16, 17, 22, 52, 47, 2, 5], which are sometimes referred as model reduction on manifolds. In the present work, we focus on the latter class of methods. Following the pioneering work from [36], projection-based reduced-order modeling approaches based on convolutional autoencoders have seen a surge of activity in recent years [15, 16, 33, 32, 2]. With various levels of success, these methods can produce ROMs of lower dimensionality—compared to classical approaches based on linear subspaces—for the same level of accuracy. In general, however, nonlinear model reduction methods are not tailored to preserve the underlying geometric structure and are thus ill-suited for Hamiltonian systems.

An exception in that regard is the work [10], which uses a nonlinear approximation while preserving the structure of Hamiltonian systems. There, the symplectic manifold Galerkin (SMG) projection is introduced which generalizes the structure-preserving model reduction with linear subspaces from [50] to symplectic (nonlinear) approximation mappings. The SMG projection requires a symplectic approximation mapping. While the SMG projection works for all symplectic approximation mappings, the numerical example in [10] however only considers a weakly symplectic mapping. Moreover, the mapping is based on a deep convolutional autoencoder which leads to a ROM that lacks interpretability. Designing autoencoders requires careful considerations towards reproducible research including the choice of network size and depth, activation function, optimizer, and weight initialization. Each physical problem usually requires its own hyperparameter tuning. Furthermore, different latent space sizes might lead to different optimal hyperparameter configurations, rendering the training process tedious and often unstable. Solutions to this problem have been proposed in the form of automated parameter choices, but more principled techniques have yet to be established.

In a similar direction, data-driven quadratic manifolds have emerged to build ROMs for transport-dominated problems in [4, 19]. Combining quadratic manifolds with Galerkin projection leads to a highly scalable approach for deriving efficient, yet interpretable, ROMs. However, the application of these approaches to Hamiltonian systems, in their standard formulation, leads to a violation of the underlying geometric structure. This makes the associated ROMs prone to displaying nonphysical behavior (see § 3.1). The main goal of this work is to build on the recent successes of data-driven quadratic manifolds to construct structure-preserving state approximations, characterized by quadratic nonlinearities, for symplectic model reduction. We focus particularly on high-dimensional dynamical-system models that arise from the semi-discretization of Hamiltonian PDEs. The key contributions of this paper are:

  1. We propose the quadratic manifold cotangent lift (QMCL) and the resulting SMG-QMCL-ROM in § 3.3 that use a quadratic approximation to build a symplectic approximation mapping while using the SMG as projection. The resulting ROM is a Hamiltonian system of reduced

dimension. Thus, the SMG-QMCL is strictly preserving the structure of Hamiltonian systems throughout the reduction.

  1. We propose the blockwise-quadratic (BQ) approximation mapping and the resulting Galerkin-BQ-ROM in § 3.4 that increases the accuracy of linear-subspace Hamiltonian ROMs by introducing quadratic terms to the state approximation. This approach augments the linear-subspace Hamiltonian ROM with interpretable and physics-preserving higher-order terms to derive an approximately Hamiltonian ROM with improved computational efficiency compared to the SMG-QMCL-ROM.

  1. Numerical experiments on the challenging cases of a thin moving pulse and a two-dimensional nonlinear wave equation illustrate that the proposed ROMs of the same dimensionality yield more accurate results than the symplectic linear subspace ROMs. In a parameter extrapolation study for the nonlinear example, the proposed methods yield accurate predictions of the high-dimensional state even for parameter values that are outside the range of the training parameters. In a time extrapolation study, the proposed ROMs provide long-time stable and accurate predictions outside the training time interval.

This paper is structured as follows. In § 2 we recall the main concepts and definitions of Hamiltonian systems and symplectic model reduction on linear subspaces. We also describe the data-driven construction of quadratic manifolds for nonlinear dimension reduction. § 3 presents the proposed SMG-QMCL-ROM and Galerkin-BQ-ROM for deriving ROMs of high-dimensional, Hamiltonian systems. In § 4 we present various numerical experiments for the parametric one-dimensional linear wave equation and two-dimensional nonlinear wave equation. Finally, § 5 summarizes the contributions and suggests a number of interesting avenues for future research.

Background

§ 2.1 provides an introduction to Hamiltonian PDE models, followed by details about their structure-preserving space discretization. In § 2.2 we review the basic principles of symplectic model reduction for Hamiltonian systems using linear symplectic subspaces. The data-driven learning of quadratic manifolds directly from high-dimensional data is recapitulated in § 2.3.

Hamiltonian systems

In the following we consider parametric Hamiltonian systems. Let P⊂Rnμ\mathcal{P} \subset\mathbb{R}^{n_\mu} denote a parameter set for which we denote the nμn_\mu-dimensional elements μ∈P\boldsymbol{\mu} \in\mathcal{P} as the parameter vector. We consider infinite-dimensional Hamiltonian systems described by evolutionary PDEs of the form

∂y(x,t;μ)∂t=SδHδy(y(x,t;μ);μ),(1)\frac{\partial y(x,t;\boldsymbol{\mu})}{\partial t} = \mathcal{S}\frac{\delta\mathcal{H}}{\delta y}(y(x,t;\boldsymbol{\mu});\boldsymbol{\mu}), \tag*{(1)}

where xx is the spatial coordinate, tt is time, S\mathcal{S} is a skew-symmetric operator, and δH/δy\delta\mathcal{H}/\delta y is the variational derivative2 of the Hamiltonian energy functional H\mathcal{H} with respect to the state variable yy, and μ∈P\boldsymbol{\mu} \in\mathcal{P} is a fixed but arbitrary parameter vector.

Hamiltonian PDEs possess important geometric properties in the form of symplecticity and conservation laws. These geometric properties are intimately related to the ability of the space-discretized FOMs to reproduce the long-time behavior of the solutions of Hamiltonian PDEs [7, 37]. Therefore, the underlying symplectic structure and the conservative nature of Hamiltonian PDEs should be respected in their spatial discretization. Space-discretized Hamiltonian FOMs are finite-dimensional systems that are derived from the Hamiltonian PDE via structure-preserving semi-discretization. Contrary to the traditional approach in which the governing PDEs are discretized directly, Hamiltonian FOMs are obtained through a discretization of the space-time continuous Hamiltonian functional H\mathcal{H} and the skew-symmetric operator SS in space [7, 12]. The resulting Hamiltonian FOM is given by

y˙(t;μ)=S∇yH(y(t;μ);μ),y(0;μ)=y0(μ),(2)\dot{\mathbf{y}}(t;\boldsymbol{\mu})=S\nabla_{\mathbf{y}}H(\mathbf{y}(t;\boldsymbol{\mu});\boldsymbol{\mu}),\qquad\mathbf{y}(0;\boldsymbol{\mu})=\mathbf{y}_0(\boldsymbol{\mu}), \tag*{(2)}

where y(t;μ)∈R2n\mathbf{y}(t;\boldsymbol{\mu})\in\mathbb{R}^{2n} is the high-dimensional state vector, y0:P↦R2n\mathbf{y}_0:\mathcal{P}\mapsto\mathbb{R}^{2n} is the parametric initial condition, S=−STS=-S^{\mathsf{T}} is the skew-symmetric matrix approximation to S\mathcal{S} in (1), and H(⋅;μ)∈C1(R2n)H(\cdot;\boldsymbol{\mu})\in C^1(\mathbb{R}^{2n}) is the space-discretized parametric Hamiltonian function. In the above equation, and for the remainder of this paper, the dot notation denotes differentiation with respect to time.

We focus on high-dimensional Hamiltonian systems with canonical symplectic structure S=J2n=(0In−In0)S=J_{2n}=\begin{pmatrix}0&I_n\\-I_n&0\end{pmatrix}, where InI_n is the nn-dimensional identity matrix. For canonical Hamiltonian systems, the state vector can be partitioned as y(t;μ)=(q(t;μ)T,p(t;μ)T)T∈R2n\mathbf{y}(t;\boldsymbol{\mu})=(\mathbf{q}(t;\boldsymbol{\mu})^{\mathsf{T}},\mathbf{p}(t;\boldsymbol{\mu})^{\mathsf{T}})^{\mathsf{T}}\in\mathbb{R}^{2n} where q(t;μ)∈Rn\mathbf{q}(t;\boldsymbol{\mu})\in\mathbb{R}^n is the generalized position vector, and p(t;μ)∈Rn\mathbf{p}(t;\boldsymbol{\mu})\in\mathbb{R}^n is the generalized momentum vector. The governing equation for the canonical Hamiltonian FOM equals

y˙(t;μ)=(q˙(t;μ)p˙(t;μ))=J2n∇yH(q(t;μ),p(t;μ);μ),y(0;μ)=y0(μ).(3)\dot{\mathbf{y}}(t;\boldsymbol{\mu})= \begin{pmatrix} \dot{\mathbf{q}}(t;\boldsymbol{\mu})\\ \dot{\mathbf{p}}(t;\boldsymbol{\mu}) \end{pmatrix} =J_{2n}\nabla_{\mathbf{y}}H(\mathbf{q}(t;\boldsymbol{\mu}),\mathbf{p}(t;\boldsymbol{\mu});\boldsymbol{\mu}),\qquad\mathbf{y}(0;\boldsymbol{\mu})=\mathbf{y}_0(\boldsymbol{\mu}). \tag*{(3)}

The flow map$^{3}[eq]\varphi_t(\mathbf{y}(0;\boldsymbol{\mu});\boldsymbol{\mu})=\mathbf{y}(t;\boldsymbol{\mu}) for Hamiltonian FOMs (3) preserves a skew-symmetric, bilinear form known as the canonical symplectic form \omega=\sum_{i=1}^{n}d p_i\wedge d q_iandconservestheHamiltonianfunctionand conserves the Hamiltonian functionH,i.e.,, i.e.,H(\mathbf{q}(0;\boldsymbol{\mu}),\mathbf{p}(0;\boldsymbol{\mu});\boldsymbol{\mu})=H(\mathbf{q}(t;\boldsymbol{\mu}),\mathbf{p}(t;\boldsymbol{\mu});\boldsymbol{\mu})forallfor allt$.

The field of geometric numerical integration [27, 37, 57] has developed a wide variety of time integrators for Hamiltonian systems that are designed to respect some of the geometric features, such as energy, momentum, or the symplectic form. Structure-preserving integrators for finite-dimensional Hamiltonian systems can be divided into two categories: (i) symplectic methods [53, 60, 40] that preserve the canonical symplectic form ω\omega and (ii) energy-preserving integrators [23, 12, 55] that conserve the space-discretized Hamiltonian HH exactly.

Symplectic model reduction using linear subspaces

The main goal in symplectic model reduction of high-dimensional Hamiltonian systems is the preservation of symplectic structure during the projection step. The methodologies described in § 3 may be viewed as nonlinear extensions of the symplectic model reduction method from [50], which covered linear subspaces and is briefly reviewed here.

To approximate the high-dimensional system state y(t;μ)∈R2n\mathbf{y}(t;\boldsymbol{\mu})\in\mathbb{R}^{2n} we seek an approximation mapping Γ:R2r↦R2n\mathbf{\Gamma}:\mathbb{R}^{2r}\mapsto\mathbb{R}^{2n}, with r≪nr\ll n, as follows:

y(t;μ)≈Γ(y~(t;μ))∈R2n,(4)\mathbf{y}(t;\boldsymbol{\mu})\approx\mathbf{\Gamma}(\widetilde{\mathbf{y}}(t;\boldsymbol{\mu}))\in\mathbb{R}^{2n}, \tag*{(4)}

where y~(t;μ)∈R2r\widetilde{\mathbf{y}}(t;\boldsymbol{\mu})\in\mathbb{R}^{2r} denotes the reduced state vector of dimension 2r2r at time tt and parameter vector μ\boldsymbol{\mu}. We continue by defining the linear symplectic lift (LSL) as

ΓLSL(y~(t;μ)):=yref+Vy~(t;μ),(5)\mathbf{\Gamma}_{\mathrm{LSL}}(\widetilde{\mathbf{y}}(t;\boldsymbol{\mu})):=\mathbf{y}_{\mathrm{ref}}+V\widetilde{\mathbf{y}}(t;\boldsymbol{\mu}), \tag*{(5)}

where yref∈R2n\mathbf{y}_{\mathrm{ref}}\in\mathbb{R}^{2n} is a reference state that is used for centering the training data and the basis matrix V∈R2n×2rV\in\mathbb{R}^{2n\times2r} is a symplectic matrix, that is a matrix that satisfies

VTJ2nV=J2r.(6)V^{\mathsf{T}}J_{2n}V=J_{2r}. \tag*{(6)}

The set of all 2n×2r2n \times2r symplectic matrices is referred to as the symplectic Stiefel manifold and denoted with Sp⁡(2r,R2n)\operatorname{Sp}(2r,\mathbb{R}^{2n}). The symplectic inverse V+∈R2r×2n\mathbf{V}^{+} \in\mathbb{R}^{2r \times2n} of a symplectic matrix V\mathbf{V} is defined by

V+:=J2rVTJ2nsuch thatV+V=I2r∈R2r×2r,(7)\mathbf{V}^{+} := \mathbf{J}_{2r}\mathbf{V}^{\mathsf{T}}\mathbf{J}_{2n} \qquad\text{such that} \qquad\mathbf{V}^{+}\mathbf{V} = \mathbf{I}_{2r} \in\mathbb{R}^{2r \times2r}, \tag*{(7)}

which allows one to define the symplectic Galerkin projection with

y~(t;μ)=V+(y(t;μ)−yref).\widetilde{\mathbf{y}}(t;\boldsymbol{\mu}) = \mathbf{V}^{+}\left(\mathbf{y}(t;\boldsymbol{\mu})-\mathbf{y}_{\mathrm{ref}}\right).

Assuming y(t;μ)−yref∈colspan⁡(V)\mathbf{y}(t;\boldsymbol{\mu})-\mathbf{y}_{\mathrm{ref}} \in\operatorname{colspan}(\mathbf{V}) for all tt, the time evolution of the reduced state y~˙(t;μ)\dot{\widetilde{\mathbf{y}}}(t;\boldsymbol{\mu}) is derived from the symplectic projection of the FOM (3) on the symplectic subspace via V+\mathbf{V}^{+}. This results in the ROM equations

y~˙(t;μ)=V+J2n∇yH(ΓLSL(y~(t;μ)))=J2rVT∇yH(ΓLSL(y~(t;μ)))=J2r∇y~H~(y~(t;μ);μ),(8)\begin{aligned} \dot{\widetilde{\mathbf{y}}}(t;\boldsymbol{\mu}) &= \mathbf{V}^{+}\mathbf{J}_{2n}\nabla_{\mathbf{y}}H\left(\boldsymbol{\Gamma}_{\mathrm{LSL}}(\widetilde{\mathbf{y}}(t;\boldsymbol{\mu}))\right) \\ &= \mathbf{J}_{2r}\mathbf{V}^{\mathsf{T}}\nabla_{\mathbf{y}}H\left(\boldsymbol{\Gamma}_{\mathrm{LSL}}(\widetilde{\mathbf{y}}(t;\boldsymbol{\mu}))\right) \\ &= \mathbf{J}_{2r}\nabla_{\widetilde{\mathbf{y}}} \widetilde{H}\left(\widetilde{\mathbf{y}}(t;\boldsymbol{\mu});\boldsymbol{\mu}\right), \tag*{(8)} \end{aligned}

References

  1. [1]R. Abraham and J. E. Marsden. Foundations of mechanics. Number 364. American Mathematical Soc., 2008.
  2. [2]S. E. Ahmed, O. San, A. Rasheed, and T. Iliescu. Nonlinear proper orthogonal decomposition for convection-dominated flows. Physics of Fluids, 33(12):121702, 2021.DOI
  3. [3]D. Amsallem, M. J. Zahr, and C. Farhat. Nonlinear model order reduction based on local reduced-order bases. International Journal for Numerical Methods in Engineering, 92(10):891–916, 2012.DOI
  4. [4]J. Barnett and C. Farhat. Quadratic approximation manifold for mitigating the Kolmogorov barrier in nonlinear projection-based model order reduction. Journal of Computational Physics, 464:111348, 2022.DOI
  5. [5]J. L. Barnett, C. Farhat, and Y. Maday. Neural-network-augmented projection-based model order reduction for mitigating the Kolmogorov barrier to reducibility of CFD models. arXiv preprint arXiv:2212.08939, 2022.arxiv.org/abs/2212.08939
  6. [6]T. Bendokat and R. Zimmermann. Geometric optimization for structure-preserving model reduction of Hamiltonian systems. In Proceedings of the 10th Vienna International Conference on Mathematical Modelling, 2022.DOI
  7. [7]T. J. Bridges and S. Reich. Numerical methods for Hamiltonian PDEs. Journal of Physics A: Mathematical and General, 39(19):5287, 2006.DOI
  8. [8]P. Buchfink, A. Bhatt, and B. Haasdonk. Symplectic model order reduction with non-orthonormal bases. Mathematical and Computational Applications, 24(2):43, 2019.
  9. [9]P. Buchfink, S. Glas, and B. Haasdonk. Optimal bases for symplectic model order reduction of canonizable linear Hamiltonian systems. IFAC-PapersOnLine, 55(20):463–468, 2022. 10th Vienna International Conference on Mathematical Modelling MATHMOD 2022.DOI
  10. [10]P. Buchfink, S. Glas, and B. Haasdonk. Symplectic model reduction of Hamiltonian systems on nonlinear manifolds and approximation with weakly symplectic autoencoder. SIAM Journal on Scientific Computing, 45(2):A289–A311, 2023.DOI
  11. [11]P. Buchfink, B. Haasdonk, and S. Rave. Proceedings of the Conference Algorytm 2020, chapter PSD-Greedy Basis Generation for Structure-Preserving Model Order Reduction of Hamiltonian Systems, pages 151–160. Wydavatel’stvo SPEKTRUM, 2020.
  12. [12]E. Celledoni, V. Grimm, R. I. McLachlan, D. McLaren, D. O’Neale, B. Owren, and G. Quispel. Preserving energy resp. dissipation in numerical PDEs using the “Average Vector Field” method. Journal of Computational Physics, 231(20):6770–6789, 2012.DOI
  13. [13]T. Daniel, F. Casenave, N. Akkari, A. Ketata, and D. Ryckelynck. Physics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order bases. Journal of Computational Physics, 458:111120, 2022.DOI
  14. [14]T. Daniel, F. Casenave, N. Akkari, and D. Ryckelynck. Model order reduction assisted by deep neural networks (ROM-Net). Advanced Modeling and Simulation in Engineering Sciences, 7(1):1–27, 2020.DOI
  15. [15]S. Fresca, L. Dede, and A. Manzoni. A comprehensive deep learning-based approach to reduced order modeling of nonlinear time-dependent parametrized PDEs. Journal of Scientific Computing, 87(2):1–36, 2021.arxiv.org/abs/2001.04001
  16. [16]S. Fresca and A. Manzoni. POD-DL-ROM: Enhancing deep learning-based reduced order models for nonlinear parametrized PDEs by proper orthogonal decomposition. Computer Methods in Applied Mechanics and Engineering, 388:114181, 2022.DOI
  17. [17]H. Gao, J.-X. Wang, and M. J. Zahr. Non-intrusive model reduction of large-scale, nonlinear dynamical systems using deep learning. Physica D: Nonlinear Phenomena, 412:1326314, 2020.DOI
  18. [18]R. Geelen and K. Willcox. Localized non-intrusive reduced-order modeling in the operator inference framework. Philosophical Transactions of the Royal Society A, 380(2229), 2022.DOI
  19. [19]R. Geelen, S. Wright, and K. Willcox. Operator inference for non-intrusive model reduction with quadratic manifolds. Computer Methods in Applied Mechanics and Engineering, 403:115717, 2023.DOI
  20. [20]G. H. Golub and V. Pereyra. The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM Journal on Numerical Analysis, 10(2):413–432, 1973.DOI
  21. [21]Y. Gong, Q. Wang, and Z. Wang. Structure-preserving Galerkin POD reduced-order modeling of Hamiltonian systems. Computer Methods in Applied Mechanics and Engineering, 315:780–798, 2017.DOI
  22. [22]F. J. Gonzalez and M. Balajewicz. Deep convolutional recurrent autoencoders for learning low-dimensional feature dynamics of fluid systems. arXiv preprint arXiv:1808.01346, 2018.arxiv.org/abs/1808.01346
  23. [23]O. Gonzalez. On the stability of symplectic and energy-momentum algorithms for non-linear Hamiltonian systems with symmetry. Computer Methods in Applied Mechanics and Engineering, 134(3-4):197–222, 1996.
  24. [24]C. Greif and K. Urban. Decay of the Kolmogorov N-width for wave problems. Applied Mathematics Letters, 96:216–222, 2019.arxiv.org/abs/1903.08488
  25. [25]A. Gruber and I. Tezaur. Canonical and noncanonical Hamiltonian operator inference. arXiv preprint arXiv:2304.06262, 2023.arxiv.org/abs/2304.06262
  26. [26]B. Haasdonk and M. Ohlberger. Efficient reduced models and a posteriori error estimation for parametrized dynamical systems by offline/online decomposition. Mathematical and Computer Modelling of Dynamical Systems, 17(2):145–161, 2011.DOI
  27. [27]E. Hairer, C. Lubich, and G. Wanner. Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations, volume 31. Springer Science & Business Media, 2006.
  28. [28]J. Hesthaven and C. Pagliantini. Structure-preserving reduced basis methods for Poisson systems. Mathematics of Computation, 90(330):1701–1740, 2021.DOI
  29. [29]J. S. Hesthaven, C. Pagliantini, and N. Ripamonti. Rank-adaptive structure-preserving model order reduction of Hamiltonian systems. ESAIM: Mathematical Modelling and Numerical Analysis, 56(2):617–650, 2022.arxiv.org/abs/2007.13153
  30. [30]O. Issan and B. Kramer. Predicting solar wind streams from the inner-heliosphere to earth via shifted operator inference. Journal of Computational Physics, 473:111689, 2023.DOI
  31. [31]C. Jiang, Y. Wang, and W. Cai. A linearly implicit energy-preserving exponential integrator for the nonlinear Klein-Gordon equation. Journal of Computational Physics, 419:109690, 2020.DOI
  32. [32]T. Kadeethum, F. Ballarin, Y. Choi, D. O’Malley, H. Yoon, and N. Bouklas. Non-intrusive reduced order modeling of natural convection in porous media using convolutional autoencoders: Comparison with linear subspace techniques. Advances in Water Resources, 160:104098, 2022.DOI
  33. [33]Y. Kim, Y. Choi, D. Widemann, and T. Zohdi. A fast and accurate physics-informed neural network reduced order model with shallow masked autoencoder. Journal of Computational Physics, 451:110841, 2022.DOI
  34. [34]O. Koch and C. Lubich. Dynamical low-rank approximation. SIAM Journal on Matrix Analysis and Applications, 29(2):434–454, 2007.DOI
  35. [35]A. Kolmogoroff. Uber die beste Annaherung von Funktionen einer gegebenen Funktionenklasse. Annals of Mathematics, pages 107–110, 1936.DOI
  36. [36]K. Lee and K. T. Carlberg. Model reduction of dynamical systems on nonlinear manifolds using deep convolutional autoencoders. Journal of Computational Physics, 404:108973, 2020.arxiv.org/abs/1812.08373
  37. [37]B. Leimkuhler and S. Reich. Simulating Hamiltonian Dynamics. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, 2005.DOI
  38. [38]B. Maboudi Afkham and J. S. Hesthaven. Structure preserving model reduction of parametric Hamiltonian systems. SIAM Journal on Scientific Computing, 39(6):A2616–A2644, 2017.DOI
  39. [39]J. E. Marsden and T. S. Ratiu. Introduction to Mechanics and Symmetry: A Basic Exposition of Classical Mechanical Systems, volume 17. Springer Science & Business Media, 2013.
  40. [40]R. McLachlan. Symplectic integration of Hamiltonian wave equations. Numerische Mathematik, 66:465–492, 1993.
  41. [41]M. Nonino, F. Ballarin, G. Rozza, and Y. Maday. Overcoming slowly decaying Kolmogorov n-width by transport maps: Application to model order reduction of fluid dynamics and fluid–structure interaction problems. arXiv preprint arXiv:1911.06598, 2019.DOI
  42. [42]M. Ohlberger and S. Rave. Nonlinear reduced basis approximation of parameterized evolution equations via the method of freezing. Comptes Rendus Mathematique, 351(23-24):901–906, 2013.DOI
  43. [43]M. Ohlberger and S. Rave. Reduced basis methods: Success, limitations and future challenges. In Proceedings of Algoritmy, pages 1–12, 2016.arxiv.org/abs/1511.02021
  44. [44]C. Pagliantini. Dynamical reduced basis methods for Hamiltonian systems. Numerische Mathematik, 148:409–448, 2021.arxiv.org/abs/2008.07427
  45. [45]C. Pagliantini and F. Vismara. Gradient-preserving hyper-reduction of nonlinear dynamical systems via discrete empirical interpolation. arXiv preprint arXiv:2206.01792, 2022.DOI
  46. [46]D. Papapicco, N. Demo, M. Girfoglio, G. Stabile, and G. Rozza. The neural network shifted-proper orthogonal decomposition: A machine learning approach for non-linear reduction of hyperbolic equations. Computer Methods in Applied Mechanics and Engineering, 392:114687, 2022.DOI
  47. [47]S. Pawar, S. Rahman, H. Vaddireddy, O. San, A. Rasheed, and P. Vedula. A deep learning enabler for nonintrusive reduced order modeling of fluid flows. Physics of Fluids, 31(8):085101, 2019.DOI
  48. [48]B. Peherstorfer, D. Butnaru, K. Willcox, and H.-J. Bungartz. Localized discrete empirical interpolation method. SIAM Journal on Scientific Computing, 36(1):A168–A192, 2014.DOI
  49. [49]B. Peherstorfer and K. Willcox. Data-driven operator inference for nonintrusive projection-based model reduction. Computer Methods in Applied Mechanics and Engineering, 306:196–215, 2016.DOI
  50. [50]L. Peng and K. Mohseni. Symplectic model reduction of Hamiltonian systems. SIAM Journal on Scientific Computing, 38(1):A1–A27, 2016.arxiv.org/abs/1407.6118
  51. [51]J. Reiss, P. Schulze, J. Sesterhenn, and V. Mehrmann. The shifted proper orthogonal decomposition: A mode decomposition for multiple transport phenomena. SIAM Journal on Scientific Computing, 40(3):A1322–A1344, 2018.arxiv.org/abs/1512.01985
  52. [52]O. San, R. Maulik, and M. Ahmed. An artificial neural network framework for reduced order modeling of transient flows. Communications in Nonlinear Science and Numerical Simulation, 77:271–287, 2019.DOI
  53. [53]J. M. Sanz-Serna. Symplectic integrators for Hamiltonian problems: An overview. Acta numerica, 1:243–286, 1992.
  54. [54]T. P. Sapsis and P. F. Lermusiaux. Dynamically orthogonal field equations for continuous stochastic dynamical systems. Physica D: Nonlinear Phenomena, 238(23-24):2347–2360, 2009.DOI
  55. [55]H. Sharma, J. Borggaard, M. Patil, and C. Woolsey. Performance assessment of energy-preserving, adaptive time-step variational integrators. Communications in Nonlinear Science and Numerical Simulation, 114:106646, 2022.DOI
  56. [56]H. Sharma and B. Kramer. Preserving Lagrangian structure in data-driven reduced-order modeling of large-scale dynamical systems. arXiv preprint arXiv:2203.06361, 2022.arxiv.org/abs/2203.06361
  57. [57]H. Sharma, M. Patil, and C. Woolsey. A review of structure-preserving numerical methods for engineering applications. Computer Methods in Applied Mechanics and Engineering, 366:113067, 2020.DOI
  58. [58]H. Sharma, Z. Wang, and B. Kramer. Hamiltonian operator inference: Physics-preserving learning of reduced-order models for canonical Hamiltonian systems. Physica D: Nonlinear Phenomena, 431:133122, 2022.arxiv.org/abs/2107.12996
  59. [59]T. Taddei, S. Perotto, and A. Quarteroni. Reduced basis techniques for nonlinear conservation laws. ESAIM: Mathematical Modelling and Numerical Analysis, 49(3):787–814, 2015.DOI
  60. [60]H. Yoshida. Construction of higher order symplectic integrators. Physics Letters A, 150(5-7):262–268, 1990.

Paper details

vlnc:W_e7p349wn
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.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents