Stable rank-adaptive Dynamically Orthogonal Runge-Kutta schemes
Aaron Charous, Pierre F.J. Lermusiaux

TL;DR
This paper introduces stable, rank-adaptive Dynamically Orthogonal Runge-Kutta schemes that efficiently approximate low-rank matrices and PDE solutions, improving accuracy and stability over existing methods.
Contribution
The paper presents novel rank-adaptive DORK schemes with stable, high-order retractions, enabling efficient low-rank approximations and dynamic subspace updates in numerical integration.
Findings
Reduced error accumulation with new integrators
Enhanced accuracy through rank adaptation
Stable, superlinear convergence in low-rank matrix approximation
Abstract
We develop two new sets of stable, rank-adaptive Dynamically Orthogonal Runge-Kutta (DORK) schemes that capture the 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 superlinearly 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…
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.
Taxonomy
TopicsMeteorological Phenomena and Simulations · Model Reduction and Neural Networks
