Skip to main content
Article thumbnail
Location of Repository

Iterative methods for roots of polynomials

By W. R. Mekwi

Abstract

We describe iterative methods for polynomial zero finding and, specifically, the Laguerre method and how it is used in the NAG subroutine C02AFF. We also investigate a bug that has been in this subroutine for ten years. In chapter two, we give a brief survey of some zero finding methods. These include Bairstow's method, Bernoulli's method, Graeffe's root-squaring method, Müller's method, the Newton-Raphson method and the Jenkins-Traub and Laguerre methods. In chapter three, we look at the Laguerre method as used in C02AFF in further detail, describe the behaviour of the bug and how the problem has been solved. We also describe general tests for zero finding algorithms and results of comparisons between NAG's C02AFF and other zero finding programs. Chapter 4 involves comparisons of C02AFF with other methods and a note on error bounds. Finally, we make our proposals and conclusions in chapter 5

Topics: Computer science, Numerical analysis
Year: 2001
OAI identifier: oai:generic.eprints.org:16/core69

Suggested articles

Citations

  1. (1993). A bibliography on roots of polynomials.
  2. (1977). A family of root-finding methods.
  3. (1994). A fast and efficient program for finding all polynomial roots.
  4. (1978). A First Course in Numerical Analysis.
  5. (1967). A generalized Bairstow algorithm.
  6. (1970). A three-stage algorithm for real polynomials using quadratic iteration.
  7. (1970). A three-stage variable-shift iteration for polynomial zeros in relation to generalized Rayleigh iteration.
  8. (1967). A zerofinding algorithm for polynomials using Laguerre’s method.
  9. (1962). An Introduction to the Theory of Functions of a Complex Variable.
  10. (1974). Applied and Computational Complex Analysis,
  11. (2001). Companion matrices and polynomial zeros. (Unpublished draft section of book to appear),
  12. (1982). Essentials of Numerical Analysis with Pocket Calculator Demonstrations.
  13. (1964). Essentials of Numerical Analysis.
  14. (1972). Extension of Bairstow’s method for multiple quadratic factors.
  15. (1964). Iterative Methods for the Solution of Equations.
  16. (1963). Laguerre’s method applied to the matrix eigenvalue problem.
  17. (1997). Numerical Analysis: An Introduction. Birkha¨user,
  18. (1985). Numerical Mathematics.
  19. (1974). Numerical Methods.
  20. (1986). Numerical Recipes.
  21. (1975). On Bairstow’s method for the solution of polynomial equations.
  22. (1995). Polynomial roots from companion matrix eigenvalues.
  23. (1974). Principles for testing polynomial zerofinding programs.
  24. (1994). Pseudozeros of polynomials and pseudospectra of companion matrices. doi
  25. (1994). Remark on algorithms to find roots of polynomials.
  26. (1991). ROOTS–Of polynomials, that is.
  27. (1963). Rounding Errors in Algebraic Processes. Her Majesty’s Stationary Office,
  28. (1960). Solution of Equations and System of Equations.
  29. (1973). Solution of Equations in Euclidean and Banach Spaces.
  30. (1997). Solving a polynomial equation: Some history and recent progress.
  31. (1977). Some modifications of Laguerre’s method.
  32. (1965). The Algebraic Eigenvalue Problem. doi
  33. (1963). The complete root-squaring method.
  34. (1967). The Numerical Solution of Equations.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.