Liqian Peng

Liqian Peng, Kamran Mohseni

In this paper, a symplectic model reduction technique, proper symplectic decomposition (PSD) with symplectic Galerkin projection, is proposed to save the computational cost for the simplification of large-scale Hamiltonian systems while preserving the symplectic structure. As an analogy to the classical proper orthogonal decomposition (POD)-Galerkin approach, PSD is designed to build a symplectic subspace to fit empirical data, while the symplectic Galerkin projection constructs a reduced Hamiltonian system on the symplectic subspace. For practical use, we introduce three algorithms for PSD, which are based upon: the cotangent lift, complex singular value decomposition, and nonlinear programming. The proposed technique has been proven to preserve system energy and stability. Moreover, PSD can be combined with the discrete empirical interpolation method to reduce the computational cost for nonlinear Hamiltonian systems. Owing to these properties, the proposed technique is better suited than the classical POD-Galerkin approach for model reduction of Hamiltonian systems, especially when long-time integration is required. The stability, accuracy, and efficiency of the proposed technique are illustrated through numerical simulations of linear and nonlinear wave equations.

Liqian Peng, Kamran Mohseni

This paper reports a development in the proper symplectic decomposition (PSD) for model reduction of forced Hamiltonian systems. As an analogy to the proper orthogonal decomposition (POD), PSD is designed to build a symplectic subspace to fit empirical data. Our aim is two-fold. First, to achieve computational savings for large-scale Hamiltonian systems with external forces. Second, to simultaneously preserve the symplectic structure and the forced structure of the original system. We first reformulate d'Alembert's principle in the Hamiltonian form. Corresponding to the integral and local forms of d'Alembert's principle, we propose two different structure-preserving model reduction approaches to reconstruct low-dimensional systems, based on the variational principle and on the structure-preserving projection, respectively. These two approaches are proven to yield the same reduced system. Moreover, by incorporating the vector field into the data ensemble, we provided several algorithms for energy preservation. In a special case when the external force is described by the Rayleigh dissipative function, the proposed method automatically preserves the dissipativity, boundedness, and stability of the original system. The stability, accuracy, and efficiency of the proposed method are illustrated through numerical simulations of a dissipative wave equation.

Liqian Peng, Kamran Mohseni

In this paper, we propose a new approach to model reduction of parameterized partial differential equations (PDEs) based on the concept of adaptive reduced bases. The presented approach is particularly suited for large-scale nonlinear systems characterized by parameter variations. Instead of using a global basis to construct a global reduced model, the proposed method approximates the original system by multiple lower-dimensional subspaces. Each localized reduced basis is generated by the SVD of a weighted snapshot ensemble; here, each weighting coefficient is a function of the input parameter. Compared with a global model reduction method, such as the classical POD, the adaptive model reduction method could yield a more accurate solution with a fixed subspace dimension. Moreover, we combine the adaptive reduced model with the chord iteration to solve elliptic PDEs in a computationally efficient fashion. The potential of the method for achieving large speedups, while maintaining good accuracy, is demonstrated for both elliptic and parabolic PDEs in a few numerical examples.

Zhe Bai, Liqian Peng

Although projection-based reduced-order models (ROMs) for parameterized nonlinear dynamical systems have demonstrated exciting results across a range of applications, their broad adoption has been limited by their intrusivity: implementing such a reduced-order model typically requires significant modifications to the underlying simulation code. To address this, we propose a method that enables traditionally intrusive reduced-order models to be accurately approximated in a non-intrusive manner. Specifically, the approach approximates the low-dimensional operators associated with projection-based reduced-order models (ROMs) using modern machine-learning regression techniques. The only requirement of the simulation code is the ability to export the velocity given the state and parameters as this functionality is used to train the approximated low-dimensional operators. In addition to enabling nonintrusivity, we demonstrate that the approach also leads to very low computational complexity, achieving up to $1000\times$ reduction in run time. We demonstrate the effectiveness of the proposed technique on two types of PDEs.