--- numbering: enumerator: 6.4.%s --- (section-ivp-rk)= # Runge–Kutta methods ```{index} ! Runge–Kutta method ``` We come now to one of the major and most-used types of methods for initial-value problems: **Runge–Kutta** (RK) methods.[^RK] They are one-step methods in the sense of {eq}`onestepODE`, though they are not often written in that form. RK methods boost the accuracy past first order by evaluating the ODE function $f(t,u)$ more than once per time step. [^RK]: Americans tend to pronounce these German names as "run-ghuh kut-tah." ## A second-order method Consider a series expansion of the exact solution to $u'=f(t,u)$, ```{math} :label: taylor2 \hat{u}(t_{i+1}) = \hat{u}(t_i) + h \hat{u}'(t_i) + \frac{1}{2}h^2 \hat{u}''(t_i) + O(h^3) . ``` If we replace $\hat{u}'$ by $f$ and keep only the first two terms on the right-hand side, we would obtain the Euler method. To get more accuracy we will need to compute or estimate the third term as well. Note that ```{math} \hat{u}'' = f' = \frac{d f}{d t} = \frac{\partial f}{\partial t} + \frac{\partial f}{\partial u} \frac{d u}{d t} = f_t + f_u f, ``` where we have applied the multidimensional chain rule to the derivative, because both of the arguments of $f$ depend on $t$. Using this expression in {eq}`taylor2`, we obtain ```{math} :label: rkexactexpand \begin{split} \hat{u}(t_{i+1}) &= \hat{u}(t_i) \\ & + h\left[f\bigl(t_i,\hat{u}(t_i)\bigr) + \frac{h}{2}f_t\bigl(t_i,\hat{u}(t_i)\bigr) + \frac{h}{2}f\bigl(t_i,\hat{u}(t_i)\bigr)\,f_u\bigl(t_i,\hat{u}(t_i)\bigr)\right] \\ &+ O(h^3). \end{split} ``` We have no desire to calculate and then code those partial derivatives of $f$ directly; an approximate approximation is called for. Observe that ```{math} :label: mvtaylor2 \begin{split} f\bigl(t_i+\alpha,\hat{u}(t_i)+\beta\bigr) & = f\bigl(t_i,\hat{u}(t_i)\bigr) \\ & + \alpha f_t\bigl(t_i,\hat{u}(t_i)\bigr) + \beta f_u\bigl(t_i,\hat{u}(t_i)\bigr) \\ & + O\bigl(\alpha^2 + |\alpha\beta| + \beta^2\bigr). \end{split} ``` Matching this expression to the term in brackets in {eq}`rkexactexpand`, it seems natural to select $\alpha = h/2$ and $\beta = \frac{1}{2}h f\bigl(t_i,\hat{u}(t_i)\bigr)$. Doing so, we find ```{math} \hat{u}(t_{i+1}) = \hat{u}(t_i) + h\left[f\bigl(t_i+\alpha,\hat{u}(t_i)+\beta\bigr)\right] + O(h\alpha^2 + h|\alpha \beta| + h\beta^2 + h^3). ``` Truncation of the series here results in a new one-step method. ::::{prf:definition} Improved Euler method (IE2) :label: definition-ie2 The improved Euler method is the one-step formula ```{math} :label: IE {u}_{i+1} = u_i + hf\left(t_i+\tfrac{1}{2}h,u_i+\tfrac{1}{2}h f(t_i,u_i)\right). ``` :::: Thanks to the definitions above of $\alpha$ and $\beta$, the omitted terms are of size ```{math} O(h\alpha^2 + h|\alpha \beta| + h\beta^2 + h^3) = O(h^3). ``` Therefore, $h\tau_{i+1}=O(h^3)$, and the order of accuracy of improved Euler is two. ## Implementation Runge–Kutta methods are called *multistage* methods. We can see why if we interpret {eq}`IE` from the inside out. In the first stage, the method takes an Euler half-step to time $t_i+\frac{1}{2}h$: ```{math} \begin{split} k_1 &= h f(t_i,u_i), \\ v &= u_i + \tfrac{1}{2}k_1. \end{split} ``` The second stage employs an Euler-style strategy over the whole time step, but using the value from the first stage to get the slope: ```{math} \begin{split} k_2 &= h f\left(t_i+\tfrac{1}{2}h,v\right),\\ {u}_{i+1} &= u_i + k_2. \end{split} ``` Our implementation of IE2 is shown in {numref}`Function {number} `. ``````{prf:algorithm} ie2 :label: function-ie2 `````{tab-set} ````{tab-item} Julia :sync: julia :::{embed} #function-ie2-julia ::: ```` ````{tab-item} MATLAB :sync: matlab :::{embed} #function-ie2-matlab ::: ```` ````{tab-item} Python :sync: python :::{embed} #function-ie2-python ::: ```` ````` `````` ## More Runge–Kutta methods While it is interesting to interpret IE2 as a pair of Euler-like steps, the Taylor series derivation is the only way to see that it will be more accurate than Euler, and it is also the path to deriving other methods. Moving to higher orders of accuracy requires introducing additional stages, each having free parameters so that more terms in the series may be matched. The amount of algebra grows rapidly in size and complexity, though there is a sophisticated theory for keeping track of it. We do not give the derivation details. A generic $s$-stage RK method takes the form ```{math} :label: rk \begin{split} k_1 &= h f(t_i,u_i),\\ k_2 &= h f(t_i+c_1h,u_i + a_{11}k_1),\\ k_3 &= h f(t_i+c_2h, u_i + a_{21}k_1 + a_{22}k_2),\\ &\vdots\\ k_s &= h f(t_i + c_{s-1}h, u_i + a_{s-1,1}k_1 + \cdots + a_{s-1,s-1}k_{s-1}),\\ u_{i+1} &= u_i + b_1k_1 + \cdots + b_s k_s. \end{split} ``` This recipe is completely determined by the number of stages $s$ and the constants $a_{ij}$, $b_j$, and $c_i$. Often an RK method is presented as just a table of these numbers, as in ```{math} \begin{array}{r|ccccc} 0 & & & & & \\ c_1 & a_{11} & & &\\ c_2 & a_{21} & a_{22} & & &\\ \vdots & \vdots & & \ddots & &\\ c_{s-1} & a_{s-1,1} & \cdots & & a_{s-1,s-1}&\\[1mm] \hline \rule{0pt}{2.25ex} & b_1 & b_2 & \cdots & b_{s-1} & b_s \end{array} ``` For example, IE2 is given by the tableau ```{math} \begin{array}{r|cc} \rule{0pt}{2.75ex}0 & & \\ \rule{0pt}{2.75ex}\frac{1}{2} & \frac{1}{2} &\\[1mm] \hline \rule{0pt}{2.75ex}& 0 & 1 \end{array} ``` Here are two more two-stage, second-order methods, **modified Euler** and **Heun's method**, respectively: ```{math} \text{ME2: }\quad \begin{array}{r|cc} \rule{0pt}{2.75ex}0 & & \\ \rule{0pt}{2.75ex}1 & 1 &\\[1mm] \hline \rule{0pt}{2.75ex}& \frac{1}{2} & \frac{1}{2} \end{array} \qquad \qquad \text{Heun: } \quad \begin{array}{r|cc} \rule{0pt}{2.75ex} 0 & & \\ \rule{0pt}{2.75ex} \frac{2}{3} & \frac{2}{3} &\\[1mm] \hline \rule{0pt}{2.75ex} & \frac{1}{4} & \frac{3}{4} \end{array} ``` ::::{attention} Euler, improved Euler (IE2), and modified Euler (ME2) are all distinct numerical methods.[^heun] :::: [^heun]: Some sources (including Wikipedia in 2026) give the name Ralston to what we have called Heun's method, and also give Heun's name to what we have called modified Euler. The attribution of mathematical discovery is often a [tricky business](https://en.wikipedia.org/wiki/Stigler%27s_law_of_eponymy). Until we have seen an authoritative historical treatment, we are maintaining continuity with our past naming conventions. The most commonly used RK method, and perhaps the most popular IVP method of all, is the fourth-order one given by ```{math} :label: rk4 \begin{array}{r|cccc} \rule{0pt}{2.75ex}0 & & & & \\ \rule{0pt}{2.75ex}\frac{1}{2} & \frac{1}{2} & & &\\ \rule{0pt}{2.75ex}\frac{1}{2} & 0 & \frac{1}{2} & &\\ \rule{0pt}{2.75ex}1 & 0 & 0 & 1\\[1mm] \hline \rule{0pt}{2.75ex}& \frac{1}{6} & \frac{1}{3} & \frac{1}{3} & \frac{1}{6} \end{array} ``` This formula is often referred to as *the* fourth-order RK method, even though there are many others, and we refer to it as **RK4**. Written out, the recipe is as follows. ::::{prf:definition} Fourth-order Runge–Kutta method (RK4) ```{math} :label: rk4def \begin{split} k_1 &= hf(t_i,u_i), \\ k_2 &= hf(t_i+h/2,u_i+k_1/2),\\ k_3 &= hf(t_i+h/2,u_i+k_2/2),\\ k_4 &= hf(t_i+h,u_i+k_3),\\ u_{i+1} &= u_i + \frac{1}{6} k_1 + \frac{1}{3} k_2 + \frac{1}{3} k_3 + \frac{1}{6} k_4. \end{split} ``` :::: Our implementation is given in {numref}`Function {number} `. ``````{prf:algorithm} rk4 :label: function-rk4 `````{tab-set} ````{tab-item} Julia :sync: julia :::{embed} #function-rk4-julia ::: ```` ````{tab-item} MATLAB :sync: matlab :::{embed} #function-rk4-matlab ::: ```` ````{tab-item} Python :sync: python :::{embed} #function-rk4-python ::: ```` ````` `````` ::::{prf:example} Convergence of Runge–Kutta methods :label: demo-rk-converge `````{tab-set} ````{tab-item} Julia :sync: julia :::{embed} #demo-rk-converge-julia ::: ```` ````{tab-item} MATLAB :sync: matlab :::{embed} #demo-rk-converge-matlab ::: ```` ````{tab-item} Python :sync: python :::{embed} #demo-rk-converge-python ::: ```` ````` :::: ::::{aside} `````{tab-set} ````{tab-item} Julia :sync: julia :::{div} ```{iframe} https://cdnapisec.kaltura.com/p/2358381/embedPlaykitJs/uiconf_id/57659783?iframeembed=true&entry_id=1_w43m116e&config%5Bprovider%5D=%7B%22widgetId%22%3A%221_8vzn1mx8%22%7D&config%5Bplayback%5D=%7B%22startTime%22%3A0%7D ``` ::: ```` ````{tab-item} MATLAB :sync: matlab ```` ````{tab-item} Python :sync: python ```` ````` :::: ## Efficiency As with rootfinding and integration, the usual point of view is that evaluations of $f$ are the only significant computations and are therefore to be minimized in number. One of the most important characteristics of a multistage method is that each stage requires an evaluation of $f$; that is, a single time step of an $s$-stage method requires $s$ evaluations of $f$. The error decreases geometrically as $s$ is incremented, so trading a stage for an increase in order is a good deal. But $s=5$, $6$, or $7$ gives a maximal order of accuracy of $s-1$; this decreases to $s-2$ for $s=8$ and $s=9$, etc. Fourth order is considered adequate and the sweet spot for many applications. ## Exercises % must stay as #1 ``````{exercise} :label: problem-rk-byhand ✍ For each IVP, write out (possibly using a calculator) the first time step of the improved Euler method with $h=0.2$. **(a)** $u' = -2t u, \ 0 \le t \le 2, \ u(0) = 2;\ \hat{u}(t) = 2e^{-t^2}$ **(b)** $u' = u + t, \ 0 \le t \le 1, \ u(0) = 2;\ \hat{u}(t) = -1-t+3e^t$ **(c)** $(1+x^3)uu' = x^2,\ 0 \le x \le 3, \ u(0) = 1;\ \hat{u}(x) = [1+(2/3)\ln (1+x^3)]^{1/2}$ `````` ``````{exercise} :label: problem-rk-eulermod ✍ Use the modified Euler method to solve the problems in @problem-rk-byhand. `````` ``````{exercise} :label: problem-rk-emimplement ⌨ Modify {numref}`Function {number} ` to implement the modified Euler method. Test your function on the IVP in part (a) of @problem-rk-byhand by solving with $n=30,60,90,\ldots,300$ and plotting the convergence of the error at the final time together with a line showing $O(n^{-2})$. `````` ``````{exercise} :label: problem-rk-heun ✍ Use Heun's method to solve the problems in @problem-rk-byhand. `````` ``````{exercise} :label: problem-rk-heunimplement ⌨ Modify {numref}`Function {number} ` to implement Heun's method. Test your function on the IVP in part (a) of @problem-rk-byhand by solving with $n=30,60,90,\ldots,300$ and plotting the convergence of the error at the final time together with a line showing $O(n^{-2})$. `````` ``````{exercise} :label: problem-rk-rk4 ✍ Use RK4 to solve the problems in @problem-rk-byhand. `````` ``````{exercise} :label: problem-rk-meorder ✍ Using {eq}`rkexactexpand` and {eq}`mvtaylor2`, show that the modified Euler method has order of accuracy at least 2. `````` ``````{exercise} :label: problem-rk-heunorder ✍ Using {eq}`rkexactexpand` and {eq}`mvtaylor2`, show that Heun's method has order of accuracy at least 2. `````` ``````{exercise} :label: problem-rk-converge ⌨ For each IVP, compute the solution using {numref}`Function {number} `. (i) Plot the solution for $n=300$. (ii) For $n=100,200,300,\ldots,1000$, compute the error at the final time and make a log-log convergence plot, including a reference line for fourth-order convergence. **(a)** $u''+ 9u = 9t, \: 0< t< 2\pi, \: u(0) = 1,\: u'(0) = 1; \: \hat{u}(t) = t+\cos (3t)$ **(b)** $u''+ 9u = \sin(2t), \: 0< t< 2\pi, \: u(0) = 2,\: u'(0) = 1$; $\quad \hat{u}(t) = (1/5) \sin(3t) + 2 \cos (3t)+ (1/5) \sin (2t)$ **(c)** $u''- 9u = 9t, \: 0< t< 1, \: u(0) = 2,\: u'(0) = -1; \: \hat{u}(t) = e^{3t} + e^{-3t}-t$ **(d)** $u''+ 4u'+ 4u = t, \: 0< t< 4, \: u(0) = 1,\: u'(0) = 3/4; \: \hat{u}(t) = (3t+5/4)e^{-2t} + (t-1)/4$ **(e)** $x^2 y'' +5xy' + 4y = 0,\: 1` to solve the IVP. `````` ``````{exercise} :label: problem-rk-bounded ✍ Consider the problem $u'=c u$, $u(0) = 1$ for a real constant $c$ and $t>0$. **(a)** Find an explicit formula in terms of $h$ and $c$ for $u_{i+1}/u_i$ in the modified Euler method. **(b)** Show that if $ch=-3$, then $|u_i|\to\infty$ as $i\to\infty$ while the exact solution $\hat{u}(t)$ approaches zero as $t\to\infty$. ``````