Metraipolis › archive › dc_eb4fdab9f69d
A Memory-Efficient Adjoint State Optimization Method Based on Time-Reversible Dynamical Low-Rank Approximation — arXiv:2608.21545
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21545
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:25:46.830Z
- SHA-256 of the archived text
c33f18f1f751080d6be8eadd9587a9cc07f2476fcb9abc40769eefb208b3de29- Stable URL of this page
https://metraipolis.com/documento/dc_eb4fdab9f69d
How to cite
A Memory-Efficient Adjoint State Optimization Method Based on Time-Reversible Dynamical Low-Rank Approximation — arXiv:2608.21545 — arXiv (en), https://arxiv.org/abs/2608.21545 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eb4fdab9f69d (Metraipolis archive dc_eb4fdab9f69d, sha256 c33f18f1f751080d6be8eadd9587a9cc07f2476fcb9abc40769eefb208b3de29)
BibTeX
@misc{dceb4fdab9f69d,
title = {A Memory-Efficient Adjoint State Optimization Method Based on Time-Reversible Dynamical Low-Rank Approximation — arXiv:2608.21545},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21545},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eb4fdab9f69d; sha256 c33f18f1f751080d6be8eadd9587a9cc07f2476fcb9abc40769eefb208b3de29},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21545. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The primary challenge of conducting PDE-constrained optimization for high-dimensional problems, such as kinetic equations, is the often prohibitive memory cost. Computing gradients using the adjoint state method would require the storage of the entire time history of the forward solution. For such problems, where the memory cost for storing a single instance of the forward solution can already be a limiting factor, this is clearly not feasible. In this paper, we propose a memory-efficient adjoint state method that compresses the forward and adjoint solution with a dynamical low-rank approximation (a model order reduction technique) and bypasses the need to store the entire forward solution by employing a time-reversible low-rank integrator. The dynamical low-rank approach introduces a number of challenges: reversibility can fail in the rank-deficient case and the low-rank trajectories can show chaotic behavior. In particular, the latter has a number of important consequences for the optimization problem. We address those challenges and show that our method can drastically reduce the memory requirement for gradient-based optimization of kinetic equations. In particular, we consider two examples from kinetic plasma physics: optimizing beam profiles to suppress a bump-on-tail instability and shaping a particle beam using external electric fields. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.OC). Categorie arXiv: Numerical Analysis (math.NA) ; Optimization and Control (math.OC); Computational Physics (physics.comp-ph); Plasma Physics (physics.plasm-ph). Pagina del lavoro: https://arxiv.org/abs/2608.21545 — 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-18T08:18:05.713Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).