= Implicit Runge-Kutta method
{wiki}
An <implicit Runge-Kutta method> defines at least one <Runge-Kutta stage> using an equation that involves that stage or a later unresolved stage. In the slope convention,
$$
Y_i=y_n+h\sum_{j=1}^s a_{ij}k_j,\qquad k_i=f(t_n+c_ih,Y_i),\qquad
y_{n+1}=y_n+h\sum_{i=1}^s b_ik_i.
$$
An <Explicit Runge-Kutta method> has strictly lower-triangular $A$, so the slopes are computed sequentially. An implicit tableau instead requires one or more algebraic solves, usually nonlinear when the <vector field> is nonlinear. Existence, uniqueness and numerical accuracy of those solves are additional requirements; <A-stability> of the scalar test equation does not establish them.
For the <implicit midpoint rule>, $Y=y_n+(h/2)f(Y)$ and $y_{n+1}=y_n+hf(Y)$. On $y'=-\lambda y$ with $\lambda>0$, the stage is $Y=y_n/(1+h\lambda/2)$ and the update factor is $(1-h\lambda/2)/(1+h\lambda/2)$. This linear example needs only one division, whereas a nonlinear $f$ generally requires an iterative solve. The <stage solvability of an implicit Runge-Kutta method> gives a sufficient small-step contraction condition.
Back to article page