Hostname: page-component-7bb8b95d7b-nptnm Total loading time: 0 Render date: 2024-09-06T10:23:51.887Z Has data issue: false hasContentIssue false
  • English
  • Français

The solution of equations by iteration

Published online by Cambridge University Press:  24 October 2008

W. A. Coppel
W. A. Coppel
Affiliation:
Trinity CollegeCambridge
Get access Rights & Permissions [Opens in a new window]

Extract

The method of solving equations by iteration is very old and is discussed in many well-known books. But conditions for its validity have never been properly formulated. In the first place, it is necessary to know that the method will not carry us outside the domain of definition of our functions, and that the ‘approximations’ will not converge to something which is not a solution of the equations. These difficulties are easily forestalled; it is more difficult to ensure that the process really will converge. Our object will be to find the most general conditions under which we can set off with the certainty that we will ultimately arrive at a root, in the case of one equation with one unknown.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 51 , Issue 1 , January 1955 , pp. 41 - 43
Copyright
Copyright © Cambridge Philosophical Society 1955

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

* E.g. Whittaker, E. T. and Robinson, G., The calculus of observations (4th ed.Glasgow, 1944)Google Scholar, chap, VI or Courant, R., Differential and integral calculus (Glasgow, 1934), vol. I, p. 358.Google Scholar

* Take r to be a root of the equation f(y) = y.