Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

• Published in: Journal of scientific computing Vol. 102; no. 3; p. 81
• Main Authors: Appelö, Daniel, Cheng, Yingda
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.03.2025; Springer Nature B.V; Springer
• Subjects: Algorithms; Approximation; Computational Mathematics and Numerical Analysis; Convergence; Decomposition; Differential equations; Dynamic low rank approximation; Grid refinement (mathematics); Integrators; Mathematical and Computational Engineering; Mathematical and Computational Physics; Mathematics; Mathematics and Statistics; Matrix algebra; Matrix differential equation; Methods; Numerical analysis; Partial differential equations; Robustness (mathematics); Rotating bodies; Stability; Theoretical; Time dependence; Truncation errors; Matrix differential equation; Stability; Dynamic low rank approximation; Convergence
• ISSN: 0885-7474; 1573-7691; 1573-7691
• DOI: 10.1007/s10915-025-02808-1

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. We prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.