Splitting-based randomised dynamical low-rank approximations for stiff matrix differential equations
By: Zi Wu, Yong-Liang Zhao
Potential Business Impact:
Solves hard math problems faster by breaking them down.
In the fields of control theory and machine learning, the dynamic low-rank approximation for large-scale matrices has received substantial attention. Considering the large-scale semilinear stiff matrix differential equations, we propose a dynamic numerical integrator for obtaining low-rank approximations of solutions. We first decompose the differential equation into a stiff linear component and a nonstiff nonlinear term, then employ an exponential integrator along with a dynamic low-rank approach to resolve these subsystems, respectively. Furthermore, the proposed framework naturally extends to rank-adaptation scenarios. Through rigorous validation on canonical stiff matrix differential problems, including spatially discretized Allen-Cahn equations and differential Riccati equations, we demonstrate that the method achieves the theoretically predicted convergence orders. Numerical evidence confirms the robustness and accuracy of the proposed methods.
Similar Papers
A low-rank, high-order implicit-explicit integrator for three-dimensional convection-diffusion equations
Numerical Analysis
Makes complex math problems solve much faster.
A fast and memoryless numerical method for solving fractional differential equations
Numerical Analysis
Solves hard math problems for science and engineering.
Full- and low-rank exponential midpoint schemes for forward and adjoint Lindblad equations
Quantum Physics
Helps control tiny particles with math.