Adaptive sparse interpolation for accelerating nonlinear stochastic reduced-order modeling with time-dependent bases

Abstract

Stochastic reduced-order modeling based on time-dependent bases (TDBs) has proven successful for extracting and exploiting low-dimensional manifold from stochastic partial differential equations (SPDEs). The nominal computational cost of solving a rank-$r$ reduced-order model (ROM) based on time-dependent basis, a.k.a. TDB-ROM, is roughly equal to that of solving the full-order model for $r$ random samples. As of now, this nominal performance can only be achieved for linear or quadratic SPDEs -- at the expense of a highly intrusive process. On the other hand, for problems with non-polynomial nonlinearity, the computational cost of solving the TDB evolution equations is the same as solving the full-order model. In this work, we present an adaptive sparse interpolation algorithm that enables stochastic TDB-ROMs to achieve nominal computational cost for generic nonlinear SPDEs. Our algorithm constructs a low-rank approximation for the right hand side of the SPDE using the discrete empirical interpolation method (DEIM). The presented algorithm does not require any offline computation and as a result the low-rank approximation can adapt to any transient changes of the dynamics on the fly. We also propose a rank-adaptive strategy to control the error of the sparse interpolation. Our algorithm achieves computational speedup by adaptive sampling of the state and random spaces. We illustrate the efficiency of our approach for two test cases: (1) one-dimensional stochastic Burgers' equation, and (2) two-dimensional compressible Navier-Stokes equations subject to one-hundred-dimensional random perturbations. In all cases, the presented algorithm results in orders of magnitude reduction in the computational cost.

arXiv comment31 pages, 14 figures

References in corpus (16)

• Data-Driven Sparse Sensor Placement for Reconstruction
• A New Selection Operator for the Discrete Empirical Interpolation Method -- improved a priori error bound and extensions
• Sparse reduced-order modeling : Sensor-based dynamics to full-state estimation
• A fast and accurate physics-informed neural network reduced order model with shallow masked autoencoder
• Two-step greedy algorithm for reduced order quadratures
• On-the-fly Reduced Order Modeling of Passive and Reactive Species via Time-Dependent Manifolds
• Reduced-order Description of Transient Instabilities and Computation of Finite-Time Lyapunov Exponents
• Real-Time Reduced-Order Modeling of Stochastic Partial Differential Equations via Time-Dependent Subspaces
• Data-driven reduced modelling of turbulent Rayleigh-Benard convection using DMD-enhanced Fluctuation-Dissipation Theorem
• A Scalable Observation-Driven Time-Dependent Basis for a Reduced Description of Transient Systems
• Calibration of projection-based reduced-order models for unsteady compressible flows
• A Training Set Subsampling Strategy for the Reduced Basis Method
• Stochastic dynamical low-rank approximation method
• A Discrete Empirical Interpolation Method for Interpretable Immersion and Embedding of Nonlinear Manifolds
• Reduced Order Modeling of Turbulence-Chemistry Interactions using Dynamically Bi-Orthonormal Decomposition
• Reduced order modeling with time-dependent bases for PDEs with stochastic boundary conditions