BIT Numerical Mathematics

, Volume 13, Issue 2, pp 153–159 | Cite as

A new class of highly-stable methods:A0-stable methods

  • Colin W. Cryer


A linear multistep method (ζ,σ) is defined to beA0-stable if when it is applied to the equation\(\dot x(t) = - \lambda x(t)\) the approximate solutionx h (t n ) tends to zero ast n → ∞ for all values of the stepsizeh and allλ∈(0, ∞).

Various properties ofA0-stable methods are derived. It is shown that most of the properties ofA(α)-stable methods are shared byA0-stable methods. It is proved that there existA0-stable methods of arbitrarily high order.


Computational Mathematic Stable Method Multistep Method Linear Multistep Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. Bjurel, G. Dahlquist, B. Lindberg, S. Linde, and L. Oden,Survey of stiff ordinary differential equations, Report No. NA 70.11, Department of Information Processing, The Royal Institute of Technology Stockholm, 1970.Google Scholar
  2. 2.
    C. W. Cryer,On the instability of high order backward-difference multistep methods, BIT 12 (1972), 17–25.CrossRefGoogle Scholar
  3. 3.
    C. W. Cryer,Necessary and sufficient criteria for A-stability of linear multistep integration formulae, Technical Report No. 147, Computer Sciences Dept., University of Wisconsin, Madison, Wisconsin, 1972.Google Scholar
  4. 4.
    G. G. Dahlquist,A special stability problem for linear multistep methods, BIT 3 (1963), 27–43.Google Scholar
  5. 5.
    C. Dill and C. W. Gear,A graphical search for stiffly stable methods for ordinary differential equations, J. Assoc. Comp. Mach. 18 (1971), 75–79.Google Scholar
  6. 6.
    C. W. Gear,Numerical Initial Value Problems in Ordinary Differential Equations, Englewood Cliffs: Prentice-Hall, 1971.Google Scholar
  7. 7.
    M. K. Jain and V. K. Srivastava,High order stiffly stable methods for ordinary differential equations, Report No. 394, Department of Computer Science, University of Illinois, Urbana, Illinois, 1970.Google Scholar
  8. 8.
    L. Lapidus and J. H. Seinfeld,Numerical Solution of Ordinary Differential Equations, New York: Academic Press, 1971.Google Scholar
  9. 9.
    N. Obreschkoff,Verteilung und Berechnung der Nullstellen Reeller Polynome, Berlin: VEB Deutscher Verlag der Wissenschaften, 1963.Google Scholar
  10. 10.
    O. B. Widlund,A note on unconditionally stable linear multistep methods, BIT 7 (1967), 65–70.Google Scholar

Copyright information

© BIT Foundations 1973

Authors and Affiliations

  • Colin W. Cryer
    • 1
  1. 1.Computing LaboratoryOxford UniversityOxfordEngland

Personalised recommendations