Runge–Kutta method (SDE)

In mathematics, the Runge - Kutta method is a technique for the approximate numerical solution of a stochastic differential equation. It is a generalization of the Runge-Kutta method for ordinary differential equations to stochastic differential equations.

Consider the Itō diffusion "X" satisfying the following Itō stochastic differential equation

:$\{mathrm\{d\}\; X\_\{t\; =\; a(X\_\{t\})\; ,\; mathrm\{d\}\; t\; +\; b(X\_\{t\})\; ,\; mathrm\{d\}\; W\_\{t\},$

with initial condition "X"₀ = "x"₀, where "W"_"t" stands for the Wiener process, and suppose that we wish to solve this SDE on some interval of time [0, "T"] . Then the Runge-Kutta approximation to the true solution "X" is the Markov chain "Y" defined as follows:

* partition the interval [0, "T"] into "N" equal subintervals of width "δ" = "T" ⁄ "N" > 0:

:

* set "Y"₀ = "x"₀;

* recursively define "Y"_"n" for 1 ≤ "n" ≤ "N" by

:$Y\_\{n\; +\; 1\}\; =\; Y\_\{n\}\; +\; a(Y\_\{n\})\; delta\; +\; b(Y\_\{n\})\; Delta\; W\_\{n\}\; +\; frac\{1\}\{2\}\; left(\; b(hat\{Upsilon\}\_\{n\})\; -\; b(Y\_\{n\})\; ight)\; left(\; (Delta\; W\_\{n\})^\{2\}\; -\; delta\; ight)\; delta^\{-1/2\},$

: where

:$Delta\; W\_\{n\}\; =\; W\_\{\; au\_\{n\; +\; 1\; -\; W\_\{\; au\_\{n$

: and

:$hat\{Upsilon\}\_\{n\}\; =\; Y\_\{n\}\; +\; a(Y\_n)\; delta\; +\; b(Y\_\{n\})\; delta^\{1/2\}.$

Note that the random variables Δ"W"_"n" are independent and identically distributed normal random variables with expected value zero and variance "δ".

This scheme has strong order 1, meaning that the approximation error of the actual solution at a fixed time scales with the time step "δ". It has also weak order 1, meaning that the error on the statistics of the solution scales with the time step "δ". See the references for complete and exact statements.

The functions "a" and "b" can be time-varying without any complication. The method can be generalized to the case of several coupled equations; the principle is the same but the equations become longer. Higher-order schemes also exist, but become increasingly complex.

References

*