For a consistent zero-stable real linear -step method with constant coefficients and only first-derivative evaluations, the attainable order is at most for odd and for even . For an explicit method the bound is . These are order barriers under the root condition for a multistep method, not bounds on multiderivative methods or on arbitrary variable-step formulations. The Second Dahlquist barrier adds the stronger bound of order two for irreducible A-stable methods.
Using Newton-Cotes closed quadrature for the integrated derivative yields the displayed linear multistep method. Its first characteristic polynomial is , whose unit-circle roots are all simple, proving zero-stability. Quadrature exactness gives order for odd and at least for even . The first Dahlquist barrier gives equality, while the Dahlquist equivalence theorem gives convergence with consistent starts. These are finite-time convergence statements, not claims of A-stability.
For a real consistent zero-stable linear multistep method, transform its first characteristic polynomial by to . The root condition for a multistep method puts all finite roots of in the closed left half-plane; real linear factors and conjugate quadratic factors consequently give nonnegative coefficients, after choosing . The order criterion requires a polynomial of degree at most to agree through degree with . The latter quotient has strictly negative nonconstant even coefficients. Its first even coefficient beyond degree includes a strictly negative multiple of and cannot vanish. This gives the stated bound.
Write . Pairing and after differentiating twice gives
The power series of has strictly positive even coefficients, and the other factor has nonnegative even coefficients. Thus every even coefficient of is negative. Since is even with , the displayed sign pattern follows. This supplies a short positivity argument for the first Dahlquist barrier.

Articles by others on the same topic (0)

There are currently no matching articles.