Skip to main content
Article
Relationships Between Order and Efficiency of a Class of Methods for Multiple Zeros of Polynomials
Journal of Computational and Applied Mathematics (1995)
  • Tjalling Ypma, Western Washington University
  • Masao Igarashi
Abstract
The behavior of a class of high order methods for solving polynomial equations is examined. It is shown that the number of iterations for local convergence to a multiple zero, to the limits of attainable accuracy, is bounded independent of the multiplicity of the zero, and decreases as the order of the method increases. For the higher order methods, the number of iterations decreases as the multiplicity increases. Computational efficiency as a function of degree, order and multiplicity is investigated, and an effective choice of order is recommended. Numerical examples are provided.
Keywords
  • Newton's method,
  • Polynomial,
  • Multiple zero,
  • Order,
  • Efficiency
Disciplines
Publication Date
1995
Publisher Statement
Copyright © 1995 Published by Elsevier B.V. doi:10.1016/0377-0427(94)00086-G
Citation Information
Tjalling Ypma and Masao Igarashi. "Relationships Between Order and Efficiency of a Class of Methods for Multiple Zeros of Polynomials" Journal of Computational and Applied Mathematics Vol. 60 Iss. 1-2 Proceedings of the International Meeting on Linear/Nonlinear Iterative Methods and Verification of Solution (1995)
Available at: http://works.bepress.com/tjalling_ypma/18/