For and , the explicit midpoint method multiplies the current value by . Starting from one, induction gives
Let and . The Taylor theorem with Lagrange remainder for the exponential function gives
The difference of powers identity gives . Every summand lies between one and . Since , the global error therefore satisfies
The same inequalities hold at , where the error vanishes. At the fixed endpoint , the lower bound prevents any higher order of a numerical method, while the upper bound is . Thus the convergence order is exactly two.
Fix the following normalization of the local truncation error, also called the consistency error: insert a smooth exact solution into the linear multistep method and divide the residual by ,
Thus the unscaled defect is . Consistency of a numerical method means that uniformly over mesh points in each fixed interval for every sufficiently smooth exact solution. Write the characteristic polynomials of a linear multistep method as
By Taylor's theorem, consistency of a numerical method is equivalent to
or and .
Second-order accuracy means for smooth solutions, equivalently an unscaled local truncation error . In addition to the two consistency conditions, its order conditions require
An order of a numerical method of exactly two additionally requires that the next order condition fails. These statements concern the local defect; a second-order global error requires stability and suitably accurate starting values as well.
The coefficients of this linear multistep method are , , and , . Substitution into the order of a numerical method conditions gives
The second equation gives ; substituting this into the third gives . Consequently there is exactly one second-order choice,
The resulting scheme is the BDF2 method,
For a exact solution, Taylor's theorem in the original normalization gives the exact leading order defect
In particular the coefficient is nonzero: the method has formal order exactly two, rather than three. Bounded third derivatives already suffice for the uniform estimate ; the stronger smoothness above only makes the displayed remainder immediate. Multiplying the recurrence by instead gives the common derivative normalization with leading defect .
The first of the characteristic polynomials of a linear multistep method is
Both roots are simple and lie in the closed unit disk, so the root condition for a multistep method proves zero-stability.
The Dahlquist equivalence theorem states that, for fixed-coefficient linear multistep methods on the usual class of initial value problems with a right-hand side continuous in and uniformly Lipschitz continuous in , convergence of a numerical method for every such problem and every convergent set of starting values is equivalent to consistency of a numerical method and zero-stability. The statement is on fixed finite intervals where the exact solution exists, with implicit updates well defined. Its order estimate says that a zero-stable method with and starting errors has global error under the corresponding solution smoothness and Lipschitz continuity assumptions; merely convergent starting values do not ensure the order- rate.
For this application, sufficient assumptions are a unique solution , a uniform Lipschitz continuity bound in on a neighborhood of its graph, and the nearby solution branch of each implicit update. For sufficiently small , the map
is a contraction mapping with factor at most on a suitable small closed neighborhood. The Banach fixed-point theorem supplies local solvability of the nearby update. With starting errors
the order estimate gives
Thus the BDF2 method is second-order convergent under these standard hypotheses. Exact together with one Euler method step for already gives the required starting error when is bounded, since only one starting step is taken.
The question's assumption of continuity of alone does not establish uniqueness, the needed solution smoothness, or this uniform convergence estimate. The added Lipschitz continuity condition is a sufficient hypothesis for the theorem used here; its failure does not imply that every particular initial value problem is nonunique or that its numerical approximations cannot converge.
Runge-Kutta method Created 2026-09-24 Updated 2026-10-31
A Runge-Kutta method advances an initial value problem , , by sampling its vector field at several trial states within one time step. These samples are Runge-Kutta stages; a weighted combination of their slopes produces the next state. The construction improves on the single tangent line used by the Euler method while requiring evaluations of , rather than explicit higher derivatives of the solution. It applies to scalar equations and systems of ordinary differential equations alike. The coefficient choices distinguish methods such as Heun's method, the classical fourth-order Runge-Kutta method and implicit Runge-Kutta methods.
For stages, write for the stage matrix, for relative time nodes and for output weights. A time step of length computes
Here is a slope, with units of state per time; is a state increment. Another common convention writes , so its stage states are and its output is . These are equivalent conventions: including both inside and again in the output would count the time step twice. The textbook formulation uses the increment convention.[ref]
Usually the Butcher tableau obeys , called internal consistency. Stage then combines slopes over an effective time . The second-order conditions with independent Runge-Kutta abscissae explain what changes when time nodes are specified independently. A Runge-Kutta stage is generally an auxiliary approximation, not a separate accepted solution value at its node. Several stages can even have the same time node but different state arguments, as in the classical fourth-order Runge-Kutta method.
The useful idea is to approximate the integral without knowing the intermediate exact trajectory. Trial states provide places to sample , and Butcher order conditions make the resulting combination agree with the exact Taylor expansion. More stages alone do not guarantee a higher order of a numerical method: their coefficients must satisfy the appropriate conditions. Embedded Runge-Kutta pairs reuse these same samples for a second output and a practical local error estimator.