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

多自适应时间积分

Multi-Adaptive Time-Integration

Chalmers University of Technology(查尔姆斯理工大学)

Anders Logg

AI总结:

针对多时间尺度系统,提出多自适应Galerkin方法(mcG(q)和mdG(q)),通过为每个分量单独选择时间步长并基于后验误差估计进行自适应,同时引入显式时间积分的自适应稳定策略以处理刚性问题。

摘要:

对于常微分方程或含时偏微分方程的时间积分,若系统呈现不同量级的多时间尺度,且需解析系统最快时间尺度,则计算成本可能非常高。若不同时间尺度局域于不同分量(对应于PDE中空间局域化),则高效时间积分要求我们对不同分量使用不同时间步长。本文概述了作者近期在一系列论文中引入的多自适应Galerkin方法mcG(q)和mdG(q)。在这些方法中,基于全局误差的后验误差估计,为每个分量单独且自适应地选择时间步长序列。多自适应方法需要求解大型非线性代数方程组,这些方程组使用显式型迭代求解器(不动点迭代)求解。若系统是刚性的,这些迭代可能不收敛,对应于标准显式方法对刚性系统低效的已知事实。为解决此问题,我们提出了一种针对刚性常微分方程显式时间积分的自适应策略,其中显式方法通过少量小的稳定化时间步长进行自适应稳定化。

英文摘要:

Time integration of ODEs or time-dependent PDEs with required resolution of the fastest time scales of the system, can be very costly if the system exhibits multiple time scales of different magnitudes. If the different time scales are localised to different components, corresponding to localisation in space for a PDE, efficient time integration thus requires that we use different time steps for different components. We present an overview of the multi-adaptive Galerkin methods mcG(q) and mdG(q) recently introduced in a series of papers by the author. In these methods, the time step sequence is selected individually and adaptively for each component, based on an a posteriori error estimate of the global error. The multi-adaptive methods require the solution of large systems of nonlinear algebraic equations which are solved using explicit-type iterative solvers (fixed point iteration). If the system is stiff, these iterations may fail to converge, corresponding to the well-known fact that standard explicit methods are inefficient for stiff systems. To resolve this problem, we present an adaptive strategy for explicit time integration of stiff ODEs, in which the explicit method is adaptively stabilised by a small number of small, stabilising time steps.

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

↑