Metraipolis › archive › dc_30f72fda89aa

An energy-constrained implicit step-and-truncate algorithm and its robust error estimates — arXiv:2610.41606

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41606
License (as archived)
CC0-1.0
Archived
2026-11-02T07:59:40.121Z
SHA-256 of the archived text
7cb8b0377a0e23d29b27a564d939eea1ffc535005c3bae915aec3197cfeeb8f1
Stable URL of this page
https://metraipolis.com/documento/dc_30f72fda89aa

How to cite

An energy-constrained implicit step-and-truncate algorithm and its robust error estimates — arXiv:2610.41606 — arXiv (en), https://arxiv.org/abs/2610.41606 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_30f72fda89aa (Metraipolis archive dc_30f72fda89aa, sha256 7cb8b0377a0e23d29b27a564d939eea1ffc535005c3bae915aec3197cfeeb8f1)
BibTeX
@misc{dc30f72fda89aa,
  title = {An energy-constrained implicit step-and-truncate algorithm and its robust error estimates — arXiv:2610.41606},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41606},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_30f72fda89aa; sha256 7cb8b0377a0e23d29b27a564d939eea1ffc535005c3bae915aec3197cfeeb8f1},
  year = {2026}
}

Archived text

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

Deriving mesh-robust error bounds is an open problem for low-rank methods, including dynamical low-rank (DLR) and step-and-truncate (SAT) approaches, as highlighted in a recent review. Existing bounds can depend on Lipschitz constants that grow with inverse mesh size, making them impractical, particularly for kinetic equations, a major application of low-rank methods. We develop a unified framework for implicit SAT that provides a discrete counterpart of energy-localization analysis for nonlinear partial differential equations. By restricting numerical solutions to energy-localized regions, we obtain one-sided Lipschitz stability with constants independent of spatial resolution. The resulting error estimates and time-step restrictions are mesh robust, answering this open problem for the class of implicit SAT schemes covered by our assumptions. We emphasize that energy localization provides a general mechanism for mesh-independent robust error estimates in low-rank approximation, extending beyond the SAT methods considered here. Analogous results for DLR methods will be presented in subsequent work. Returning to implicit SAT, we demonstrate the broad applicability of the framework through error estimates for different classes of equations. Specifically, for semilinear parabolic and Vlasov--Poisson equations, we establish robust first-order error bounds for backward-Euler SAT under suitable regularity assumptions. Energy localization also has practical implications. We design an energy-constrained implicit SAT algorithm. Implicit SAT methods without energy constraints can select incorrect solution branches even when their algebraic residuals are small. Moreover, time-step reduction can be essential for continuation into larger energy regions. Numerical experiments support these conclusions.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.41606 — 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-11-02T07:42:30.664Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).