Papers › Construction of high-order conservative basis-update and Galerkin dynamical low-rank...

Construction of high-order conservative basis-update and Galerkin dynamical low-rank integrators

10 Nov 2023arXiv:2311.06399links table onlyarchive 2025-07-28

Lukas Einkemmer, Jonas Kusch, Steffen Schotthöfer

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

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 implementations. The properties of these integrators are investigated by performing numerical simulations in radiation transport and plasma physics.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections