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

自适应并行时间Runge-Kutta方法中的容差比例性与计算稳定性

Tolerance Proportionality and Computational Stability in Adaptive Parallel-in-Time Runge-Kutta Methods

  • ELTE Eötvös Loránd University(布达佩斯罗兰大学)
  • Central European University(中欧大学)
  • HUN-REN–ELTE Research Group, Eötvös Loránd University(匈牙利科学院-罗兰大学研究组)
  • Lund University(隆德大学)

机构由 AI 辅助整理,请以论文原文为准。

Imre Fekete, Ferenc Izsák, Vendel P. Kupás, Gustaf Söderlind

中文总结 AI 辅助

本文研究自适应时间积分与并行时间方法结合对容差比例性的影响,提出调整细化因子以提升稳定性,实验证明并行解与串行解高度一致且显著减少计算时间。

中文摘要 AI 辅助

本文研究如何将自适应时间积分策略有效地与并行时间数值方法相结合,以求解常微分方程组。我们特别关注这些策略对容差比例性的影响。我们在多重网格时间约化(MGRIT)框架内考察了各种网格细化策略。结果表明,对原始细化因子进行简单调整即可显著提高计算稳定性和可靠性。通过使用XBraid库对标准测试问题进行数值实验,我们证明并行时间解与其串行对应解高度吻合。此外,使用多个处理器可显著减少计算时间。

英文摘要

In this paper, we investigate how adaptive time-integration strategies can be effectively combined with parallel-in-time numerical methods for solving systems of ordinary differential equations. Our focus is particularly on their influence on tolerance proportionality. We examine various grid-refinement strategies within the multigrid reduction-in-time (MGRIT) framework. Our results show that a simple adjustment to the original refinement factor can substantially improve computational stability and reliability. Through numerical experiments on standard test problems using the XBraid library, we demonstrate that parallel-in-time solutions closely match their sequential counterparts. Moreover, with the use of multiple processors, computing time can be significantly reduced.

补充信息

↑