arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2502.07040math.NAcs.NAmath.DS
收藏

鲁棒的高阶低秩BUG积分器:基于显式龙格-库塔方法

Robust high-order low-rank BUG integrators based on explicit Runge--Kutta methods

École Polytechnique Fédérale de Lausanne(洛桑联邦理工学院)

Fabio Nobile, Sébastien Riffaud

AI总结:

本文提出基于显式龙格-库塔方法的高阶鲁棒低秩BUG积分器,实现高阶精度与低秩适应性,通过理论分析和实验验证其有效性。

摘要:

在本工作中,我们引入了基于显式龙格-库塔方法的高阶基更新与伽辽金(BUG)积分器,用于大规模矩阵微分方程。这些动态低秩积分器通过在方法的每个阶段执行BUG步骤,将BUG积分器扩展到任意显式龙格-库塔方案。所得到的龙格-库塔BUG(RK-BUG)积分器对小奇异值具有鲁棒性,完全向前推进时间,并且具有高阶准确性,同时能够保持守恒性和秩适应性。我们证明RK-BUG积分器在误差达到对应于低秩截断误差的平台后保留底层龙格-库塔方法的收敛阶,当秩变为满秩时该误差消失。这一理论分析通过若干数值实验得到支持。结果展示了RK-BUG积分器的高阶收敛性和其与其他现有动态低秩积分器相比的优越精度。

英文摘要:

In this work, we introduce high-order Basis-Update & Galerkin (BUG) integrators based on explicit Runge-Kutta methods for large-scale matrix differential equations. These dynamical low-rank integrators extend the BUG integrator to arbitrary explicit Runge-Kutta schemes by performing a BUG step at each stage of the method. The resulting Runge-Kutta BUG (RK-BUG) integrators are robust with respect to small singular values, fully forward in time, and high-order accurate, while enabling conservation and rank adaptivity. We prove that RK-BUG integrators retain the order of convergence of the underlying Runge-Kutta method until the error reaches a plateau corresponding to the low-rank truncation error, which vanishes as the rank becomes full. This theoretical analysis is supported by several numerical experiments. The results demonstrate the high-order convergence of the RK-BUG integrator and its superior accuracy compared to other existing dynamical low-rank integrators.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑