arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0601029math.NAcs.NAmath.PR

随机微分方程的自适应Euler-Maruyama格式:收敛性与稳定性

An Adaptive Euler-Maruyama Scheme For SDEs: Convergence and Stability

H. Lamba, J. C. Mattingly, A. M. Stuart

AI总结:

本文提出一种仅控制时间步长漂移分量的自适应算法,并证明其收敛性与几何遍历性,解决了显式固定步长格式在漂移非线性增长时可能失去遍历性的问题。

摘要:

随机微分方程自适应算法的理解是一个开放领域,其中与算法收敛性和稳定性(长时间行为)相关的许多问题尚未解决。本文考虑一种非常简单的自适应算法,该算法仅基于控制时间步长的漂移分量。研究了收敛性和稳定性。收敛性分析的主要问题是自适应方法不一定随着用户输入容差将时间步长驱动到零。这种可能性必须被量化并证明其概率很低。稳定性分析的主要问题是遍历性。假设噪声是非退化的,因此扩散过程是椭圆的,并且漂移满足强制性条件。那么SDE是几何遍历的(指数快速收敛到统计平衡)。如果漂移不是线性有界的,则显式固定时间步长近似(如Euler-Maruyama格式)可能无法遍历。本文表明,简单的自适应时间步长策略解决了这个问题。除了证明遍历性之外,还证明了指数矩有界性,推广了已知对SDE本身成立的结果。

英文摘要:

The understanding of adaptive algorithms for SDEs is an open area where many issues related to both convergence and stability (long time behaviour) of algorithms are unresolved. This paper considers a very simple adaptive algorithm, based on controlling only the drift component of a time-step. Both convergence and stability are studied. The primary issue in the convergence analysis is that the adaptive method does not necessarily drive the time-steps to zero with the user-input tolerance. This possibility must be quantified and shown to have low probability. The primary issue in the stability analysis is ergodicity. It is assumed that the noise is non-degenerate, so that the diffusion process is elliptic, and the drift is assumed to satisfy a coercivity condition. The SDE is then geometrically ergodic (converges to statistical equilibrium exponentially quickly). If the drift is not linearly bounded then explicit fixed time-step approximations, such as the Euler-Maruyama scheme, may fail to be ergodic. In this work, it is shown that the simple adaptive time-stepping strategy cures this problem. In addition to proving ergodicity, an exponential moment bound is also proved, generalizing a result known to hold for the SDE itself.

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

↑