An adaptive Euler–Maruyama scheme for SDEs: convergence and stability

The understanding of adaptive algorithms for stochastic differential equations (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 nondegenerate, so that the diffusion process is elliptic, and the drift is assumed to satisfy a coercivity condition. The SDE is then geometrically ergodic (averages converge 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.

[1]  R. Khasminskii.  Stochastic Stability of Differential Equations , 1980 .

[2]  J. Verwer,et al.  Stability of Runge-Kutta Methods for Stiff Nonlinear Differential Equations , 1984 .

[3]  R. Temam.  Infinite Dimensional Dynamical Systems in Mechanics and Physics Springer Verlag , 1993 .

[4]  D. F. Griffiths.  The dynamics of some linear multistep methods with stepsize control , 1989 .

[5]  D. Talay.  Second-order discretization schemes of stochastic differential systems for the computation of the invariant law , 1990 .

[6]  D. Broomhead,et al.  The dynamics of numerics and the numerics of dynamics , 1992 .

[7]  Andrew M. Stuart,et al.  The essential stability of local error control for dynamical systems , 1995 .

[8]  Jessica G. Gaines,et al.  Variable Step Size Control in the Numerical Solution of Stochastic Differential Equations , 1997, SIAM J. Appl. Math..

[9]  Desmond J. Higham,et al.  Does Error Control Suppress Spuriosity , 1997 .

[10]  A. Bountis.  Dynamical Systems And Numerical Analysis , 1997, IEEE Computational Science and Engineering.

[11]  R. Tweedie,et al.  Exponential Convergence of Langevin Diiusions and Their Discrete Approximations , 1997 .

[12]  Desmond J. Higham,et al.  Analysis of the dynamics of local error control via a piecewise continuous residual , 1998 .

[13]  R. Lamba.  Convergence Results for the MATLAB ode 23 , 1998 .

[14]  Andrew M. Stuart,et al.  Convergence results for the MATLAB ode23 routine , 1998 .

[15]  D. Talay.  Approximation of the invariant probability measure of stochastic Hamiltonian dissipative systems with non globally Lipschitz coefficients , 1999 .

[16]  R. Tweedie,et al.  Langevin-Type Models I: Diffusions with Given Stationary Distributions and their Discretizations* , 1999 .

[17]  Hoon Kim,et al.  Monte Carlo Statistical Methods , 2000, Technometrics.

[18]  Harbir Lamba.  Dynamical Systems and Adaptive Timestepping in ODE Solvers , 2000 .

[19]  Andrew M. Stuart,et al.  Strong Convergence of Euler-Type Methods for Nonlinear Stochastic Differential Equations , 2002, SIAM J. Numer. Anal..

[20]  Dudley,et al.  Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .

[21]  Jonathan C. Mattingly,et al.  Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise , 2002 .

[22]  Thomas Müller-Gronbach,et al.  Strong approximation of systems of stochastic differential equations , 2002 .

[23]  Niels Richard Hansen.  Geometric ergodicity of discrete-time approximations to multivariate diffusions , 2003 .

[24]  Christian P. Robert,et al.  Monte Carlo Statistical Methods , 2005, Springer Texts in Statistics.

[25]  Andrew M. Stuart.  Probabilistic and deterministic convergence proofs for software for initial value problems , 2004, Numerical Algorithms.