Implicit Runge-Kutta method
ID: implicit-runge-kutta-method
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,An Explicit Runge-Kutta method has strictly lower-triangular , 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, and . On with , the stage is and the update factor is . This linear example needs only one division, whereas a nonlinear generally requires an iterative solve. The stage solvability of an implicit Runge-Kutta method gives a sufficient small-step contraction condition.
New to topics? Read the docs here!