Skip to main content

Iterative Solution of Equations; Convergence of Sequences

  • Chapter
Guide to Numerical Analysis

Part of the book series: Macmillan Mathematical Guides ((MG))

  • 81 Accesses

Abstract

In this chapter, we are concerned with the problem of solving an equation of the form

$$f(x) = 0$$
((2.1))

. The basic principle of our methods is to generate a sequence of estimates of the required solution which we hope converges to this solution. It will therefore be necessary to study exactly what is meant by these terms and this is done later in this chapter. A much fuller treatment of the convergence of sequences has been given by Hawkins (1988).

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1989 Peter R. Turner

About this chapter

Cite this chapter

Turner, P.R. (1989). Iterative Solution of Equations; Convergence of Sequences. In: Guide to Numerical Analysis. Macmillan Mathematical Guides. Palgrave, London. https://doi.org/10.1007/978-1-349-09784-5_2

Download citation

Publish with us

Policies and ethics