Skip to main content
SpringerLink
Log in

Stability of Finite Algorithms

  • Chapter
  • First Online:
The Concept of Stability in Numerical Mathematics

Part of the book series: Springer Series in Computational Mathematics ((SSCM,volume 45))

  • 2142 Accesses

Abstract

An algorithm is used to solve a (numerical) problem. For the mathematical formula- 4 tion of a problem (or task) we use a mapping Φ : X → Y, which is to be evaluated 5 numerically (cf. [9, Chap. 1]).

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bini, D., Lotti, G., Romani, F.: Approximate solutions for the bilinear form computational problem. SIAM J. Comput. 9, 692–697 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  2. de Jong, L.S.: Towards a formal definition of numerical stability. Numer. Math. 28, 211–219 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  3. Deuflhard, P.: A summation technique for minimal solutions of linear homogeneous difference equations. Computing 18, 1–13 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hackbusch, W.: Tensor spaces and numerical tensor calculus, Springer Series in Computational Mathematics, Vol. 42. Springer, Berlin (2012)

    Book  Google Scholar 

  5. Higham, N.J.: Accuracy and stability of numerical algorithms. SIAM, Philadelphia (1996)

    MATH  Google Scholar 

  6. Oliver, J.: The numerical solution of linear recurrence relations. Numer. Math. 11, 349–360 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  7. Plato, R.: Concise Numerical Mathematics. AMS, Providence (2003)

    MATH  Google Scholar 

  8. Quarteroni, A., Sacco, R., Saleri, F.: Numerical Mathematics, 2nd ed. Springer, Berlin (2007)

    MATH  Google Scholar 

  9. Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis. North-Holland, Amsterdam (1980)

    Google Scholar 

  10. Van der Cruyssen, P.: A reformulation of Olver’s algorithm for the numerical solution of second-order linear difference equations. Numer. Math. 32, 159–166 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  11. Wilkinson, J.H.: Rounding errors in algebraic processes. Prentice-Hall, Englewood Cliffs (1964). Reprinted by Dover Publications, New York, 1994

    Google Scholar 

  12. Wilkinson, J.H.: Rundungsfehler. Springer, Berlin (1969)

    Book  MATH  Google Scholar 

  13. Zeidler, E. (ed.): Oxford Users’ Guide to Mathematics. Oxford University Press, Oxford (2004)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MPI für Mathematik in den Naturwissenschaften, Leipzig, Germany

    Wolfgang Hackbusch

Authors
  1. Wolfgang Hackbusch
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hackbusch, W. (2014). Stability of Finite Algorithms. In: The Concept of Stability in Numerical Mathematics. Springer Series in Computational Mathematics, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39386-0_2

Download citation

Publish with us

Policies and ethics

Search

Navigation