arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.06129math.NAcs.NA
收藏

基于BDF2公式的变步长延迟校正方法的网格鲁棒稳定性与收敛性

Mesh-robust stability and convergence of variable-step deferred correction methods based on the BDF2 formula

Jiahe Yue, Hong-lin Liao, Nan Liu

AI总结:

本文为基于BDF2公式的变步长延迟校正方法建立了新的理论框架,证明其在任意时间网格上稳定并给出尖锐误差估计,表明无后效性,且放宽了步长比限制。

摘要:

我们为基于著名的BDF2公式的变步长延迟校正(DC)方法提供了新的理论框架。通过使用离散正交卷积核,根据最近的稳定性定义(SINUM, 60: 2253-2272),一些高阶BDF2-DC方法被证明在任意时间网格上是稳定的。这显著放宽了BDF2-DC方法现有的步长比限制(BIT, 62: 1789-1822)。通过考虑起始近似的数值效应,建立了相应的尖锐误差估计,这些估计表明BDF2-DC方法没有后效性,即BDF2格式的低阶起始方案不会导致高阶BDF2-DC方法精度的损失。在分级和随机时间网格上的广泛测试支持了新理论。

英文摘要:

We provide a new theoretical framework for the variable-step deferred correction (DC) methods based on the well-known BDF2 formula. By using the discrete orthogonal convolution kernels, some high-order BDF2-DC methods are proven to be stable on arbitrary time grids according to the recent definition of stability (SINUM, 60: 2253-2272). It significantly relaxes the existing step-ratio restrictions for the BDF2-DC methods (BIT, 62: 1789-1822). The associated sharp error estimates are established by taking the numerical effects of the starting approximations into account, and they suggest that the BDF2-DC methods have no aftereffect, that is, the lower-order starting scheme for the BDF2 scheme will not cause a loss in the accuracy of the high-order BDF2-DC methods. Extensive tests on the graded and random time meshes are presented to support the new theory.

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

↑