Part of the book series: UNITEXT ((UNITEXTMAT,volume 148))

  • 787 Accesses

Abstract

This chapter is devoted to presenting the theory of linear stability for numerical methods solving ODEs. Characteristic properties occurring when the stepsize goes to zero do not reveal much of what happens for fixed values of the stepsize: linear stability theory is able provided insights regarding this issue. This theory relies on applying the numerical method to the so-called Dahlquist test problem and translates stability properties into stepsize restrictions. This analysis is given for multistep, multistage and multivalues numerical methods. Relevant notions (such as A-stability and L-stability) are given, also in connection with the role of Padé approximations in this theory. The analysis of the maximum attainable order of A-stable methods is given via the theory of order stars.

A method which cannot handle satisfactorily the linear test system is not a suitable candidate for incorporation into an automatic code. More precisely, linear stability theory provides a useful yardstick (if one can have a yardstick in the complex plane!) by which different linear multistep methods (or classes of such methods) can be compared as candidates for inclusion in an automatic code.

(John D. Lambert [ 242 ])

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Birkhoff, G., Varga, R.S.: Discretization errors for well-set Cauchy problems: I. J. Math. Phys. 44, 1–23 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  2. Butcher, J.C.: Linear and nonlinear stability for general linear methods. BIT 27(2), 182–189 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Butcher, J.C.: Forty-five years of A-stability. J. Numer. Anal. Ind. Appl. Math 4(1–2), 1–9 (2009)

    MathSciNet  MATH  Google Scholar 

  4. Butcher, J.C.: Numerical Methods for Ordinary Differential Equations, 3rd edn. Wiley, Chichester (2016)

    Book  MATH  Google Scholar 

  5. Cryer, C.W.: A new class of highly stable methods: \(\mbox{A}_{0}\)-stable methods. BIT 13, 153–159 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dahlquist, G.: A special stability problem for linear multistep methods. BIT 3, 27–43 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  7. Daniel, J.W., Moore, R.E.: Computation and Theory in Ordinary Differential Equations. Freeman and Co., New York (1970)

    MATH  Google Scholar 

  8. Dekker, K., Verwer, J.G.: Stability of Runge-Kutta Methods for Stiff Nonlinear Differential Equations. CWI Monographs, vol. 2. North-Holland Publishing, Amsterdam (1984)

    Google Scholar 

  9. Ehle, B.L.: On Padè approximations to the exponential function and A-stable methods for the numerical solution of initial value problems. Research Report CSRR 2019, Dept. AACS, University of Waterloo (1969)

    Google Scholar 

  10. Ehle, B.L.: A-stable methods and Padè approximations to the exponential. SIAM J. Math. Anal. 4, 671–680 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hairer, E., Wanner, G.: Solving Ordinary Differential Equations II - Stiff and Differential-Algebraic Problems. Springer, Berlin (2002)

    MATH  Google Scholar 

  12. Iserles, A., Norsett, S.P.: Order Stars. Theory and Applications. Chapman and Hall, London (1991)

    Google Scholar 

  13. Jackiewicz, Z.: General Linear Methods for Ordinary Differential Equations. Wiley, Hoboken, NJ (2009)

    Book  MATH  Google Scholar 

  14. Lambert, J.D.: Numerical Methods for Ordinary Differential Systems: The Initial Value Problem. Wiley, Chichester (1991)

    MATH  Google Scholar 

  15. LeVeque, R.J.: Finite Difference Methods for Ordinary and Partial Differential Equations: Steady-State and Time-Dependent Problems. SIAM, Philadelphia (2007)

    Book  MATH  Google Scholar 

  16. Wanner, G., Hairer, E., Nørsett, S.P.: Order stars and stability theorems. BIT 18, 475–489 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  17. Widlund, O.B.: A note on unconditionally stable linear multistep methods. BIT 7(1), 65–70 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wright, W.M.: General linear methods with inherent Runge-Kutta stability. Ph.D. thesis, The University of Auckland, Auckland (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

D’Ambrosio, R. (2023). Linear Stability. In: Numerical Approximation of Ordinary Differential Problems . UNITEXT(), vol 148. Springer, Cham. https://doi.org/10.1007/978-3-031-31343-1_6

Download citation

Publish with us

Policies and ethics

Navigation