In mathematics of stochastic systems, the Runge–Kutta method is a technique for the approximate numerical solution of a stochastic differential equation. It is a generalisation of the Runge–Kutta method for ordinary differential equations to stochastic differential equations (SDEs). Importantly, the method does not involve knowing derivatives of the coefficient functions in the SDEs.

Most basic scheme

Consider the Itō diffusion ${\displaystyle X}$ satisfying the following Itō stochastic differential equation

with initial condition ${\displaystyle X_{0}=x_{0}}$, where ${\displaystyle W_{t}}$ stands for the Wiener process, and suppose that we wish to solve this SDE on some interval of time ${\displaystyle [0,T]}$. Then the basic Runge–Kutta approximation to the true solution ${\displaystyle X}$ is the Markov chain ${\displaystyle Y}$ defined as follows: ^[1]

• partition the interval ${\displaystyle [0,T]}$ into ${\displaystyle N}$ subintervals of width ${\displaystyle \delta =T/N>0}$:
  $${\displaystyle 0=\tau _{0}<\tau _{1}<\dots <\tau _{N}=T;}$$

  
• set ${\displaystyle Y_{0}:=x_{0}}$;
• recursively compute ${\displaystyle Y_{n}}$ for ${\displaystyle 1\leq n\leq N}$ by
  $${\displaystyle 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})\right)\left((\Delta W_{n})^{2}-\delta \right)\delta ^{-1/2},}$$

  
  where ${\displaystyle \Delta W_{n}=W_{\tau _{n+1}}-W_{\tau _{n}}}$ and ${\displaystyle {\hat {\Upsilon }}_{n}=Y_{n}+a(Y_{n})\delta +b(Y_{n})\delta ^{1/2}.}$

The random variables ${\displaystyle \Delta W_{n}}$ are independent and identically distributed normal random variables with expected value zero and variance ${\displaystyle \delta }$.

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

The functions ${\displaystyle a}$ and ${\displaystyle 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.

Variation of the Improved Euler is flexible

A newer Runge—Kutta scheme also of strong order 1 straightforwardly reduces to the improved Euler scheme for deterministic ODEs. ^[2] Consider the vector stochastic process ${\displaystyle {\vec {X}}(t)\in \mathbb {R} ^{n}}$ that satisfies the general Ito SDE

where drift ${\displaystyle {\vec {a}}}$ and volatility ${\displaystyle {\vec {b}}}$ are sufficiently smooth functions of their arguments. Given time step ${\displaystyle h}$, and given the value ${\displaystyle {\vec {X}}(t_{k})={\vec {X}}_{k}}$, estimate ${\displaystyle {\vec {X}}(t_{k+1})}$ by ${\displaystyle {\vec {X}}_{k+1}}$ for time ${\displaystyle t_{k+1}=t_{k}+h}$ via

• where ${\displaystyle \Delta W_{k}={\sqrt {h}}Z_{k}}$ for normal random ${\displaystyle Z_{k}\sim N(0,1)}$;
• and where ${\displaystyle S_{k}=\pm 1}$, each alternative chosen with probability ${\displaystyle 1/2}$.

The above describes only one time step. Repeat this time step ${\displaystyle (t_{m}-t_{0})/h}$ times in order to integrate the SDE from time ${\displaystyle t=t_{0}}$ to ${\displaystyle t=t_{m}}$.

The scheme integrates Stratonovich SDEs to ${\displaystyle O(h)}$ provided one sets ${\displaystyle S_{k}=0}$ throughout (instead of choosing ${\displaystyle \pm 1}$).

Higher order Runge-Kutta schemes

Higher-order schemes also exist, but become increasingly complex. Rößler developed many schemes for Ito SDEs, ^{[3] [4]} whereas Komori developed schemes for Stratonovich SDEs. ^{[5] [6] [7]} Rackauckas extended these schemes to allow for adaptive-time stepping via Rejection Sampling with Memory (RSwM), resulting in orders of magnitude efficiency increases in practical biological models, ^[8] along with coefficient optimization for improved stability. ^[9]

References