Supported ROM algorithms
Pressio currently supports Galerkin projection, least-squares Petrov–Galerkin projection, and windowed least-squares projection model reduction schemes.
Overview of the Galerkin ROM
The Galerkin ROM is one of the most widely used techniques in model reduction. Galerkin projection is most appropriate for symmetric systems, in which case the resulting ROM can be equipped with rigorous error bounds. For systems characterized by non-symmetric, nonlinear operators, Galerkin projection can yield inaccurate, or even unstable, dynamics. Nonetheless, Galerkin projection is widely used, and has been applied successfully to numerous linear and nonlinear systems.
- Advantages of the Galerkin ROM include
- Ease of implementation
- Compatability with both explicit and implicit time schemes
- Computational efficiency
- Disadvantages of the Galerkin ROM include
- Lack of robustness for non-symmetric systems
- Lack of robustness when equipped with hyperreduction techniques
- Related tutorials and demos
Overview of the least-squares Petrov–Galerkin ROM
Least-squares Petrov–Galerkin (LSPG) projection is a popular alternative to Galerkin projection. Unlike Galerkin projection, which relies on residual orthogonality, LSPG relies on residual minimization. Specifically, LSPG operates by sequentially computing solutions that minimize the time-discrete residual within a low-dimensional trial subspace at each time step. In general, LSPG projection yields more robust ROMs than Galerkin projection for nonsymmetric systems. Additionally, as LSPG is defined from residual minimization principles, aspects such as hyper-reduction and physical contraints can be more easily integrated into the ROM framework.
- Advantages of the LSPG ROM include
- Robustness for non-symmetric and nonlinear systems
- Robustness when eqipped with hyper-reduction techniques
- Ability to be equipped with physical constraints
- Disadvantages of the LSPG ROM include
- Inherently implicit
- Generally more computationally expensive than the Galerkin ROM
- Display a significant dependence on the time step, with this dependence difficult to quantify
- More diffusive than Galerkin ROMs
- Related tutorials and demos
Overview of the windowed least-squares ROM
Windowed least-squares (WLS) is an extension of LSPG. Similar to LSPG, WLS operates by computing solutions that minimize the residual over time windows (each time window can comprise many time steps). WLS more robust than both LSPG and Galerkin ROMs, particularly when applied to non-symmetric systems.
- Advantages of WLS include
- Equipped with the same advantages of LSPG with an increased robustness
- Decopules the residual minimization statement from the time step, and displays reduced sensitivity to the time step as compared to LSPG.
- Disadvantages of WLS include
- In general, more expensive than both Galerkin and LSPG projection.
- More diffusive than both Galerkin and LSPG.
Want to learn more about WLS? We are currently working on adding tutorials for WLS, but you can see our reference publication.