A Runge-Kutta method has classical order when its one-step map started from exact data agrees with the exact flow through powers for every sufficiently smooth ordinary differential equation. Its local truncation error is then , with a nonzero coefficient at that order for some problem if is the exact finite order.
For example, forward Euler method on , , returns , while the exact solution is . The first omitted term is quadratic, so the local error is and the method is first order. On a fixed time interval, Lipschitz continuity and a stable error-propagation estimate turn local defects into global error .[ref]
Numerical solution of ordinary differential equations: One step methods by André Jürgen Massing. One-step error analysis, Euler/Heun examples and local-to-global convergence
Matching the Dahlquist test equation checks only the linear stability expansion. The nonlinear Butcher order conditions must also hold; agreement on one scalar equation alone does not prove classical order. Stage accuracy is a separate property, so the number or individual precision of Runge-Kutta stages should not be substituted for the order of the final update.
For an explicit Runge-Kutta method with coefficients , put and let mean componentwise squaring. The conditions , , and match the exact flow expansion through degree three: the two cubic differentials are and . For sufficiently smooth vector fields these give local error and, under the usual finite-interval Lipschitz continuity assumptions, global error .
Articles by others on the same topic
There are currently no matching articles.