Use the coefficient in the numerator, as verified in the PDF; the converted TeX lost its . Multiplying the method by gives the characteristic polynomials of a linear multistep method
For every admissible real , and , giving consistency of a numerical method. Factorization gives
The second root is . The root condition for a multistep method requires and forbids a repeated root at one. For real ,
At both roots equal one, violating zero-stability. For the second root lies strictly inside the unit disk. The Dahlquist equivalence theorem therefore gives
To find the order rather than only consistency, expand the exact-solution residual through the generating function:
Thus its unnormalized local truncation error begins with when , and the global method order is exactly two for every convergent parameter. For comparison, has formal order three but is not convergent because of its double unit root:
These orders assume a smooth solution, the usual local Lipschitz condition and starting approximations of the required accuracy.
Only needs consideration, by the preceding zero-stability analysis. On the Dahlquist test equation, all roots of the amplification polynomial
must satisfy the unit-disk root condition if the method is A-stable. Evaluate it at :
Take a real negative . Then , whereas the leading coefficient is positive and as . The intermediate value theorem gives a real root strictly below . Its numerical mode grows in modulus, contradicting absolute stability at this negative test parameter. Consequently
This proof detects an unstable root directly; the second-order value alone would not exclude A-stability. Equivalently the limiting derivative polynomial has an exterior root , explaining the instability for large negative .

Articles by others on the same topic (0)

There are currently no matching articles.