Low-rank Parareal: a low-rank parallel-in-time integrator

In this work, the Parareal algorithm is applied to evolution problems that admit good low-rank approximations and for which the dynamical low-rank approximation (DLRA) can be used as time stepper. Many discrete integrators for DLRA have recently been proposed, based on splitting the projected vector...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:BIT Ročník 63; číslo 1; s. 13
Hlavní autoři: Carrel, Benjamin, Gander, Martin J., Vandereycken, Bart
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Netherlands 01.01.2023
Springer Nature B.V
Témata:
ISSN:0006-3835, 1572-9125, 1572-9125
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this work, the Parareal algorithm is applied to evolution problems that admit good low-rank approximations and for which the dynamical low-rank approximation (DLRA) can be used as time stepper. Many discrete integrators for DLRA have recently been proposed, based on splitting the projected vector field or by applying projected Runge–Kutta methods. The cost and accuracy of these methods are mostly governed by the rank chosen for the approximation. These properties are used in a new method, called low-rank Parareal, in order to obtain a time-parallel DLRA solver for evolution problems. The algorithm is analyzed on affine linear problems and the results are illustrated numerically.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
Communicated by Antonella Zanna Munthe-Kaas.
ISSN:0006-3835
1572-9125
1572-9125
DOI:10.1007/s10543-023-00953-3