无方程投影到慢流形的精度与收敛性分析
Analysis of the accuracy and convergence of equation-free projection to a slow manifold
AI总结:
本文分析了一类无方程迭代算法在逼近多时间尺度微分方程中慢流形时的精度与收敛性,证明了对于显式快慢系统,第m次迭代的固定点逼近慢流形至O(ε^m)阶,并给出了收敛条件及稳定化方法。
摘要:
在[C.W. Gear, T.J. Kaper, I.G. Kevrekidis, and A. Zagaris, Projecting to a Slow Manifold: Singularly Perturbed Systems and Legacy Codes, SIAM J. Appl. Dyn. Syst. 4 (2005) 711-732]中,我们在无方程方法的背景下开发了一类迭代算法,用于逼近多时间尺度微分方程系统中的低维吸引慢流形。对于用户指定的有限个可观测量的值,该类算法中的第m个成员(m = 0, 1, ...)迭代地寻找剩余变量的第(m+1)阶时间导数的适当零点,并利用该根来逼近慢流形上对应于这些可观测量值的点。本文是两篇分析迭代算法精度和收敛性的文章中的第一篇。这里,我们直接处理显式快慢系统,其中存在一个显式小参数ε,用于度量时间尺度的分离。我们证明,对于每个m = 0, 1, ...,迭代算法的不动点逼近慢流形至O(ε^m)阶项。此外,对于每个m,我们明确地识别了第m次迭代算法收敛到该不动点的条件。最后,我们证明当迭代不稳定(或收敛缓慢)时,可以通过应用递归投影方法使其稳定(或加速其收敛)。或者,也可以使用牛顿-克雷洛夫广义最小残差法。在后续文章中,我们将考虑迭代算法对更广泛的一类系统(其中不一定存在显式小参数)的精度和收敛性,这些算法同样适用于这些系统。
英文摘要:
In [C.W. Gear, T.J. Kaper, I.G. Kevrekidis, and A. Zagaris, Projecting to a Slow Manifold: Singularly Perturbed Systems and Legacy Codes, SIAM J. Appl. Dyn. Syst. 4 (2005) 711-732], we developed a class of iterative algorithms within the context of equation-free methods to approximate low-dimensional, attracting, slow manifolds in systems of differential equations with multiple time scales. For user-specified values of a finite number of the observables, the m-th member of the class of algorithms (m = 0, 1, ...) finds iteratively an approximation of the appropriate zero of the (m+1)-st time derivative of the remaining variables and uses this root to approximate the location of the point on the slow manifold corresponding to these values of the observables. This article is the first of two articles in which the accuracy and convergence of the iterative algorithms are analyzed. Here, we work directly with explicit fast--slow systems, in which there is an explicit small parameter, epsilon, measuring the separation of time scales. We show that, for each m = 0, 1, ..., the fixed point of the iterative algorithm approximates the slow manifold up to and including terms of O(epsilon^m). Moreover, for each m, we identify explicitly the conditions under which the m-th iterative algorithm converges to this fixed point. Finally, we show that when the iteration is unstable (or converges slowly) it may be stabilized (or its convergence may be accelerated) by application of the Recursive Projection Method. Alternatively, the Newton-Krylov Generalized Minimal Residual Method may be used. In the subsequent article, we will consider the accuracy and convergence of the iterative algorithms for a broader class of systems-in which there need not be an explicit small parameter-to which the algorithms also apply.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。