Abstract
A problem which arises in many areas of numerical mathematics is one of finding the roots of an equation of the form f(x) = 0. The function is often non-linear and we usually cannot obtain an algebraic formula which would allow us to calculate the solution. We therefore need to use numerical methods, and in this chapter we consider some of the more obvious approaches to the problem and ways of programming them.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1987 E. J. Redfern
About this chapter
Cite this chapter
Redfern, E.J. (1987). Iterative Procedures. In: Introduction to Pascal for Computational Mathematics. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-18977-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-349-18977-9_8
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-44431-3
Online ISBN: 978-1-349-18977-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)