TL;DR
This paper introduces a rank-2 Galerkin formulation for linear time-invariant dynamical systems that shifts the computational challenge from memory bandwidth to compute, enabling more efficient many-query simulations.
Contribution
The paper presents a novel rank-2 Galerkin approach that improves computational efficiency of ROMs for LTI systems, suitable for modern many-core architectures.
Findings
Rank-2 Galerkin ROM is ten times more efficient than rank-1.
Achieves 970X speedup over full order models.
Maintains accuracy in simulations and statistical analyses.
Abstract
This work aims to advance computational methods for projection-based reduced order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern many-core and hybrid computing nodes. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
