, Volume 27, Issue 3, pp 257-269

A family of root finding methods

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


A one parameter family of iteration functions for finding roots is derived. The family includes the Laguerre, Halley, Ostrowski and Euler methods and, as a limiting case, Newton's method. All the methods of the family are cubically convergent for a simple root (except Newton's which is quadratically convergent). The superior behavior of Laguerre's method, when starting from a pointz for which |z| is large, is explained. It is shown that other methods of the family are superior if |z| is not large. It is also shown that a continuum of methods for the family exhibit global and monotonic convergence to roots of polynomials (and certain other functions) if all the roots are real.

This research was supported by the National Science Foundation under grant number NSF-DCR-74-10042.