Skip to main content

A family of root finding methods

Summary

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 is a preview of subscription content, access via your institution.

References

  1. 1.

    Traub, J. F.: Iterative methods for the solution of equations. New York: Prentice-Hall 1964

    Google Scholar 

  2. 2.

    Ostrowski, A. M.: Solution of equations and systems of equations. 3rd ed. New York-London: Academic Press 1973

    Google Scholar 

  3. 3.

    Davies, M., Dawson, B.: On the global convergence of Halley's iteration formula. Num. Math.24, 133–135 (1975)

    Google Scholar 

  4. 4.

    Parlett, B.: Laguerre's method applied to the matrix eigenvalue problem. Math. Comp.18, 464–485 (1964)

    Google Scholar 

  5. 5.

    Kahan, W.: Where does Laguerre's method come from? Fourth Annual Princeton Conference on Information Sciences and Systems (1970)

  6. 6.

    Bodewig, E.: Sur la méthode Laguerre pour l'approximation des racines de certaines équations algébriques et sur la critique d'Hermite. Indag. Math.8, 570–580 (1946)

    Google Scholar 

  7. 7.

    Laguerre, E. N.: Oeuvres de Laguerre, Vol. 1, pp. 87–103

  8. 8.

    Dordević, L. N.: An iterative solution of algebraic equations with a parameter to accelerate convergence. Univ. Beograd. Publ. Elektrotechn. Fak. Ser. Mat. Fiz., # 449, pp. 179–182 (1973)

    Google Scholar 

  9. 9.

    Tihonov, O. N.: On the rapid computation of the largest zeros of a polynomial [Russian]. Zap. Leningrad. Gorn. In-ta48, No. 3, 36–41 (1968)

    Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

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

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Hansen, E., Patrick, M. A family of root finding methods. Numer. Math. 27, 257–269 (1976). https://doi.org/10.1007/BF01396176

Download citation

Keywords

  • Mathematical Method
  • Simple Root
  • Parameter Family
  • Finding Method
  • Euler Method