Stable Rank-Adaptive Dynamically Orthogonal Runge–Kutta Schemes
From MaRDI portal
Abstract: We develop two new sets of stable, rank-adaptive Dynamically Orthogonal Runge-Kutta (DORK) schemes that capture high-order curvature of the nonlinear low-rank manifold. The DORK schemes asymptotically approximate the truncated singular value decomposition at a greatly reduced cost while preserving mode continuity using newly derived retractions. We show that arbitrarily high-order optimal perturbative retractions can be obtained, and we prove that these new retractions are stable. In addition, we demonstrate that repeatedly applying retractions yields a gradient-descent algorithm on the low-rank manifold that converges geometrically when approximating a low-rank matrix. When approximating a higher-rank matrix, iterations converge linearly to the best low-rank approximation. We then develop a rank-adaptive retraction that is robust to overapproximation. Building off of these retractions, we derive two novel, rank-adaptive integration schemes that dynamically update the subspace upon which the system dynamics is projected within each time-step: the stable, optimal Dynamically Orthogonal Runge-Kutta (so-DORK) and gradient-descent Dynamically Orthogonal Runge-Kutta (gd-DORK) schemes. These integration schemes are numerically evaluated and compared on an ill-conditioned matrix differential equation, an advection-diffusion partial differential equation, and a nonlinear, stochastic reaction-diffusion partial differential equation. Results show a reduced error accumulation rate with the new stable, optimal and gradient-descent integrators. In addition, we find that rank adaptation allows for highly accurate solutions while preserving computational efficiency.
Recommendations
- Dynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank Approximation
- A rank-adaptive robust integrator for dynamical low-rank approximation
- From low-rank retractions to dynamical low-rank approximation and back
- Rank-adaptive dynamical low-rank integrators for first-order and second-order matrix differential equations
Cites work
- A Class of Intrinsic Schemes for Orthogonal Integration
- A geometric approach to dynamical model order reduction
- A new splitting algorithm for dynamical low-rank approximation motivated by the fibre bundle structure of matrix manifolds
- A projector-splitting integrator for dynamical low-rank approximation
- A rank-adaptive robust integrator for dynamical low-rank approximation
- A Riemannian rank-adaptive method for low-rank matrix completion
- Accurate low-rank approximations via a few iterations of alternating least squares
- Adaptive modeling, adaptive data assimilation and adaptive sampling
- An unconventional robust integrator for dynamical low-rank approximation
- Convergence analysis of projected fixed-point iteration on a low-rank matrix manifold.
- Dynamic mode decomposition of numerical and experimental data
- Dynamical criteria for the evolution of the stochastic dimensionality in flows with uncertainty
- Dynamical low-rank integrators for second-order matrix differential equations
- Dynamical Low‐Rank Approximation
- Dynamical reduced basis methods for Hamiltonian systems
- Dynamically orthogonal numerical schemes for efficient stochastic advection and Lagrangian transport
- Dynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank Approximation
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- From quantum to classical molecular dynamics: Reduced models and numerical analysis.
- Geometric subspace updates with applications to online adaptive nonlinear model reduction
- scientific article; zbMATH DE number 6678650 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 928751 (Why is no real title available?)
- Low-rank retractions: a survey and new results
- Minimum-correction second-moment matching: theory, algorithms and applications
- Projection methods for dynamical low-rank approximation of high-dimensional problems
- Rank-adaptive structure-preserving model order reduction of Hamiltonian systems
- Revisiting the Fisher-Kolmogorov-Petrovsky-Piskunov equation to interpret the spreading-extinction dichotomy
- Spectral analysis of nonlinear flows
- Symmetric projection methods for differential equations on manifolds
- Symplectic dynamical low rank approximation of wave equations with random parameters
- The Extrinsic Geometry of Dynamical Systems Tracking Nonlinear Matrix Projections
- Total variation diminishing Runge-Kutta schemes
Cited in
(5)- From low-rank retractions to dynamical low-rank approximation and back
- Implicit low-rank Riemannian schemes for the time integration of stiff partial differential equations
- Fully adaptive structure-preserving hyper-reduction of parametric Hamiltonian systems
- Nonlinear model reduction for transport-dominated problems
- Sequential-in-time training of nonlinear parametrizations for solving time-dependent partial differential equations
This page was built for publication: Stable Rank-Adaptive Dynamically Orthogonal Runge–Kutta Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154958)
