Carrel Benjamin, Gander Martin J, Vandereycken Bart
Section of Mathematics, University of Geneva, Geneva, Switzerland.
BIT Numer Math. 2023;63(1):13. doi: 10.1007/s10543-023-00953-3. Epub 2023 Feb 4.
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.
在这项工作中,将并行实时算法应用于允许良好低秩近似且可将动态低秩近似(DLRA)用作时间步长器的演化问题。最近基于拆分投影向量场或应用投影龙格 - 库塔方法提出了许多用于DLRA的离散积分器。这些方法的成本和精度主要由近似所选的秩决定。这些特性被用于一种名为低秩并行实时的新方法中,以获得用于演化问题的时间并行DLRA求解器。在仿射线性问题上对该算法进行了分析,并通过数值示例进行了说明。