Let . The chain rule gives along a smooth solution. Expanding every term about , the unscaled exact-solution residual of this multiderivative multistep method is
For example, at derivative degree its coefficient is
the coefficients at degrees zero, one and two vanish. Thus the formal order of a numerical method is two for , and three for , where the fourth-degree coefficient is . This order statement describes the exact-solution defect; convergence also needs zero-stability.
At the characteristic polynomial is
The root condition for a multistep method holds exactly when and . In particular has two distinct unit roots and is admissible, whereas has a repeated unit root. Applying the permitted Dahlquist equivalence theorem for this multiderivative setting, with smooth , the nearby implicit solution branch and convergent starting values, yields
All those methods have global order two, provided the starting errors are . The formally third-order choice is not zero-stable and therefore is not convergent as a method for general initial-value problems.
One can see the failure without any nonlinear difficulty. For , an error mode grows exponentially if . At , ; choosing , gives vanishing starting errors but . This also explains why a small residual alone does not rescue that degenerate choice: at the first-derivative term disappears and the formula has no zero-stable first-order evolution interpretation.
Apply the method to the Dahlquist test equation and write . The recurrence becomes
so every amplification root must satisfy
Choose , which lies strictly in the left half-plane. The polynomial then gives , hence
One root has modulus . Generic initial perturbations excite that growing recurrence mode even though the exact scalar solution decays. The method is not A-stable. There is also a singular implicit coefficient at , another obstruction inside the left half-plane.

Articles by others on the same topic (0)

There are currently no matching articles.