arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.0195math.NAcs.NAmath.AP
收藏

基于运算分裂和延迟校正的高阶方案用于刚性时依赖偏微分方程

High order schemes based on operator splitting and deferred corrections for stiff time dependent PDEs

Center for Computational Sciences and Engineering, Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室计算科学与工程中心);CD-adapco

Max Duarte, Matthew Emmett

AI总结:

本文提出基于运算分裂和延迟校正的高阶方案,用于求解刚性时依赖偏微分方程,通过迭代延迟校正提高精度,结合隐式Runge-Kutta方案保证稳定性,数值验证了方法的有效性。

摘要:

我们考虑基于Radau型、L-稳定隐式Runge-Kutta方案的高阶时间积分公式,用于求解时间依赖的刚性偏微分方程。为了避免求解大规模非线性方程组,我们开发了一种方法,通过迭代延迟校正计算积分公式中的插值节点解。数值稳定性由专门的运算分裂技术保证,该技术高效处理偏微分方程的刚性,并为迭代方案提供初始和中间解。通过这种方式,利用低阶分裂求解器的低算法复杂度计算低阶近似,通过迭代校正获得基于积分公式的高阶解。在有限维框架下,对数值误差和局部阶数进行了数学分析,并为一般半离散问题构思了时间步进策略,以控制时间积分相关的数值误差。数值证据证实了理论发现,并在刚性反应扩散方程的情况下评估了该方法的性能。

英文摘要:

We consider quadrature formulas of high order in time based on Radau-type, L-stable implicit Runge-Kutta schemes to solve time dependent stiff PDEs. Instead of solving a large nonlinear system of equations, we develop a method that performs iterative deferred corrections to compute the solution at the collocation nodes of the quadrature formulas. The numerical stability is guaranteed by a dedicated operator splitting technique that efficiently handles the stiffness of the PDEs and provides initial and intermediate solutions to the iterative scheme. In this way the low order approximations computed by a tailored splitting solver of low algorithmic complexity are iteratively corrected to obtain a high order solution based on a quadrature formula. The mathematical analysis of the numerical errors and local order of the method is carried out in a finite dimensional framework for a general semi-discrete problem, and a time-stepping strategy is conceived to control numerical errors related to the time integration. Numerical evidence confirms the theoretical findings and assesses the performance of the method in the case of a stiff reaction-diffusion equation.

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

↑