Hyper-reduction-free reduced-order Newton solvers for projection-based model-order reduction of nonlinear dynamical systems
arXiv:2603.03420 · doi:10.1007/s00366-026-02358-6
Abstract
This study proposes an intrusive projection-based model-order reduction framework for nonlinear problems with a polynomial structure, solved iteratively using a Newton solver in the reduced space. It is demonstrated that for the targeted class of polynomial nonlinearities, all operators appearing in the projected approximate residual and Jacobian can be precomputed in the offline phase, eliminating the need for hyper-reduction. Additionally, the evaluation of both the projected approximate residual and its Jacobian scales only with the dimension of the reduced space, and does not depend on the dimension of the full-order model, enabling effective offline-online decomposition. The proposed hyper-reduction-free (HRF) framework is applied to both Galerkin (HRF-G) and least-squares Petrov-Galerkin (HRF-LSPG) projection schemes. The accuracy and computational efficiency of the proposed HRF schemes are evaluated in two numerical experiments and compared with a commonly used hyper-reduction scheme, namely the energy-conserving sampling and weighting method, for both the Galerkin and LSPG schemes. In the first numerical example, a parametric Burgers' equation is used to assess the predictive capabilities of the considered model reduction approaches on parameter sets not seen in the training snapshots. In the second example, a parametric heat equation with a cubic reaction term is studied, for which a lifting transformation is employed to expose the desired structure. The efficacy of the HRF methods in accurately reducing the dimensionality of the lifted formulation is investigated. For the studied problems, the results show that HRF-G and HRF-LSPG achieve two and one order of magnitude speedup, respectively, with respect to the full-order model while resulting in state prediction errors below O(10^-2).
27 pages, 11 figures
References in corpus (15)
- Discovering governing equations from data: Sparse identification of nonlinear dynamical systems
- The GNAT method for nonlinear model reduction: effective implementation and application to computational fluid dynamics and turbulent flows
- A New Selection Operator for the Discrete Empirical Interpolation Method -- improved a priori error bound and extensions
- Lift & Learn: Physics-informed machine learning for large-scale nonlinear dynamical systems
- Data-driven reduced-order models via regularized operator inference for a single-injector combustion process
- Nonlinear Model Order Reduction via Lifting Transformations and Proper Orthogonal Decomposition
- On the stability of projection-based model order reduction for convection-dominated laminar and turbulent flows
- Operator inference for non-intrusive model reduction with quadratic manifolds
- LaSDI: Parametric Latent Space Dynamics Identification
- Non-intrusive reduced-order models for parametric partial differential equations via data-driven operator inference
- gLaSDI: Parametric Physics-informed Greedy Latent Space Dynamics Identification
- Nonlinear Model Reduction by Probabilistic Manifold Decomposition
- Non-intrusive reduced-order modeling for dynamical systems with spatially localized features
- Nonlinear projection-based model order reduction with machine learning regression for closure error modeling in the latent space
- Bayesian learning with Gaussian processes for low-dimensional representations of time-dependent nonlinear systems