In the normalization used by the supplied coefficient expansion, the local truncation error of the linear multistep method is
The nonzero sum in the denominator is an explicit hypothesis. Consistency of a numerical method requires uniformly on a fixed finite time interval for every sufficiently smooth exact solution as . Equivalently, the two polynomial identities are
These follow by inserting constant and affine functions, or by setting the first two Taylor coefficients to zero.
Zero-stability means that perturbations of the starting values of the zero-step recurrence remain bounded by a fixed multiple of their initial size, uniformly as the number of steps tends to infinity on a fixed time interval. In particular solutions of obey with independent of .
The equivalent root condition for a multistep method is
A root outside the unit circle gives exponential growth of a recurrence relation mode; a repeated root on it gives polynomial growth. Repeated roots strictly inside it are harmless because their polynomial factor is dominated by decay.
The first characteristic polynomial factors as
The two quadratic roots have product one. Both can lie in the closed unit disk only if both have modulus one, requiring . At the root one is triple and ; at the root minus one is double. Both fail the root condition for a multistep method. In the intervening open interval the two quadratic roots are distinct conjugate unit-modulus roots, different from one. Thus
Using , the supplied expansion gives
Throughout the zero-stable range, , so every such method has order two. There is a unique higher-order choice:
Here and , giving exactly order four, with normalized leading truncation error . But the extra roots are , one of modulus greater than one. By the Dahlquist equivalence theorem this consistent but non-zero-stable method is not convergent for arbitrary consistent starting values.

Articles by others on the same topic (0)

There are currently no matching articles.