Abstract

Classical model reduction methods disregard the special symplectic structure associated with Hamiltonian systems. A key challenge in projection-based approaches is to construct a sym-plectic basis that captures the essential system information. This necessitates the computation of a so-called proper symplectic decomposition (PSD) of a given sample data set. The PSD problem allows for a canonical formulation as an optimization problem on the symplectic Stiefel manifold. However, as with their Euclidean counterparts, symplectic projectors only depend on the underlying symplectic subspaces and not on the selected symplectic bases. This motivates to tackle the PSD problem as a Riemannian optimization problem on the symplectic Grassmann manifold, i.e., the matrix manifold of symplectic projectors. Initial investigations on this manifold feature in a recent preprint of the authors. In this work, we investigate the feasibility and performance of this approach on two academic numerical examples. More precisely, we calculate an optimized PSD for snapshot matrices that stem from solving the one-dimensional linear wave equation and the one-dimensional nonlinear Schrödinger equation.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call