Windowed least-squares model reduction for dynamical systems
Eric J. Parish, Kevin T. Carlberg

TL;DR
This paper introduces a windowed least-squares (WLS) method for model reduction in dynamical systems, improving accuracy and addressing limitations of existing techniques by optimizing residuals over time windows.
Contribution
The WLS approach generalizes existing methods and reduces dependence on time discretization, offering a flexible framework for spatial and spatiotemporal model reduction.
Findings
WLS yields more accurate solutions than Galerkin and LSPG.
WLS reduces space-time residuals effectively.
The approach addresses key deficiencies in existing model reduction techniques.
Abstract
This work proposes a windowed least-squares (WLS) approach for model-reduction of dynamical systems. The proposed approach sequentially minimizes the time-continuous full-order-model residual within a low-dimensional space-time trial subspace over time windows. The approach comprises a generalization of existing model reduction approaches, as particular instances of the methodology recover Galerkin, least-squares Petrov-Galerkin (LSPG), and space-time LSPG projection. In addition, the approach addresses key deficiencies in existing model-reduction techniques, e.g., the dependence of LSPG and space-time LSPG projection on the time discretization and the exponential growth in time exhibited by a posteriori error bounds for both Galerkin and LSPG projection. We consider two types of space-time trial subspaces within the proposed approach: one that reduces only the spatial dimension of the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
