Metraipolis › archive › dc_c8457576ff6c

High-order robust basis-update & Galerkin integrators for dynamical low-rank approximation — arXiv:2608.27749

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27749
License (as archived)
CC0-1.0
Archived
2026-10-17T11:22:19.564Z
SHA-256 of the archived text
6de622deeb1fa701c496e3289cc732500fe2d7a4e7fa601de53ee78a42ed0026
Stable URL of this page
https://metraipolis.com/documento/dc_c8457576ff6c

How to cite

High-order robust basis-update & Galerkin integrators for dynamical low-rank approximation — arXiv:2608.27749 — arXiv (en), https://arxiv.org/abs/2608.27749 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c8457576ff6c (Metraipolis archive dc_c8457576ff6c, sha256 6de622deeb1fa701c496e3289cc732500fe2d7a4e7fa601de53ee78a42ed0026)
BibTeX
@misc{dcc8457576ff6c,
  title = {High-order robust basis-update & Galerkin integrators for dynamical low-rank approximation — arXiv:2608.27749},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27749},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c8457576ff6c; sha256 6de622deeb1fa701c496e3289cc732500fe2d7a4e7fa601de53ee78a42ed0026},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27749. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Dynamical low-rank approximation has become a widely used numerical method in diverse disciplines. Its main idea is to represent the matrix or tensor-valued solution to a time-dependent differential equation as a low-rank factorization. The evolution of the factorization leads to highly stiff dynamics and requires the derivation of novel time integration methods that are not prone to this stiffness. A promising family of integrators are basis-update \& Galerkin (BUG) integrators as they enable implicit time integration and structure--preservation. However, current BUG integrators are limited to second--order accuracy while general-order BUG integrators are designed as projections of explicit time integration methods, thus severely limiting their use. In this work, we propose general-order BUG integrators that do not rely on an explicit time integration scheme while requiring a smaller number of basis functions to achieve high-order accuracy. We prove a general order error bound for the proposed augmented and parallel BUG integrators and demonstrate their behaviour for a series of stiff and non-stiff numerical benchmarks in which they significantly outperform previous BUG versions.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2608.27749 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T11:06:05.060Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).