Construction of high-order conservative basis-update and Galerkin dynamical low-rank integrators
Lukas Einkemmer, Jonas Kusch, Steffen Schotth\"ofer

TL;DR
This paper develops high-order conservative basis-update and Galerkin dynamical low-rank integrators that preserve invariants and conservation laws in kinetic simulations, improving efficiency and robustness.
Contribution
It introduces extensions to existing DLRA integrators that ensure local conservation laws with minimal computational overhead.
Findings
Successfully preserves invariants in numerical simulations.
Achieves high-order accuracy in kinetic problems.
Requires only minor modifications to existing methods.
Abstract
Numerical simulations of kinetic problems can become prohibitively expensive due to their large memory requirements and computational costs. A method that has proven to successfully reduce these costs is the dynamical low-rank approximation (DLRA). A major accomplishment in the field of DLRA has been the derivation of robust time integrators that are not limited by the stiffness of the DLRA evolution equations. One key question is whether such robust time integrators can be made locally conservative, i.e., can they preserve the invariants and associated conservation laws of the original problem? In this work, we propose extensions to commonly used basis-update \& Galerkin (BUG) integrators that preserve invariants of the solution as well as the associated conservation laws with little or no additional computational cost. This approach requires only minor modifications of existing…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Matrix Theory and Algorithms · Numerical methods for differential equations
