ANZIAM J. 45(E) ppC578--C591, 2004.

Adaptive stepsize implementations of implicit stochastic Runge Kutta methods with modified Wiener increment

Abstract

An adaptive stepsize algorithm is implemented on a stochastic implicit strong order 1 method, namely a stiffly accurate diagonal implicit stochastic Runge-Kutta method where a modified Wiener increment [`(DW<sub>n</sub>)] is involved instead of a regular DW<sub>n</sub> = bÖh, b   N(0,1) to avoid unboundedness. The modified Wiener increment is equal to the regular one only if |b| £ A<sub>h</sub> , otherwise [`(DW)] = -A_hÖh or A_hÖh if b < -A_h or b > A_h , respectively. The parameter A_h is determined based on a strong order inequality requirement (Milstein et al., 2002)

E( - b   - b)2 £ hk ,     k ³ 1 .

The variable stepsize algorithm is based on Richardson's extrapolation. For every step change additional work is required to compute [`(DW_n)] so that the correct Brownian path is maintained from simulation to simulation. Numerical experiments in solving nonlinear and linear stochastic differential equation problems demonstrate that better approximations are obtained with the modified Wiener increment compared to using the regular Wiener increment.

Download to your computer

• Click here for the PDF article (238 kbytes) We suggest printing 2up.
• Click here for its BiBTeX record

Authors

R. Herdiana

Faculty of Computer Science, University of Indonesia, Depok 16424. mailto:ratna@cs.ui.ac.id

K. Burrage

Department of Mathematics, University of Queensland, Australia 4072. mailto:kb@maths.uq.edu.au

Published July 1, 2004. ISSN 1446-8735