Abstract
In this paper we investigate the local convergence of Chebyshev’s iterative method for the computation of a multiple polynomial zero. We establish two convergence theorems for polynomials over an arbitrary normed field. A priori and a posteriori error estimates are also provided. All of the results are new even in the case of simple zero.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Osada N.: Asymptotic error constants of cubically convergent zero finding methods. J. Comput. Appl. Math. 196, 347–357 (2006)
Neta B.: New third order nonlinear solvers for multiple roots. Appl. Math. Comput. 202, 162–170 (2008)
Chun C., Neta B.: A third-order modification of Newton’s method for multiple roots. Appl. Math. Comput. 211, 474–479 (2009)
Homeier H.H.H.: On Newton-type methods for multiple roots with cubic convergence. J. Comput. Appl. Math. 231, 249–254 (2009)
Proinov P.D.: General local convergence theory for a class of iterative processes and its applications to Newton’s method. J. Complex. 25, 38–62 (2009)
Ren H., Argyros I.K.: Convergence radius of the modified Newton method for multiple zeros under Hölder continuous derivative. Appl. Math. Comput. 217, 612–621 (2010)
Sharma J.R., Sharma R.: New third and fourth order nonlinear solvers for computing multiple roots. Appl. Math. Comput. 217, 9756–9764 (2011)
Bi W., Ren H., Wu Q.: Convergence of the modified Halley’s method for multiple zeros under Hölder continuous derivative. Num. Alg. 58, 497–512 (2011)
Zhou X., Chen X., Song Y.: Families of third and fourth order methods for multiple roots of nonlinear equations. Appl. Math. Comput. 219, 6030–6038 (2013)
Pan V.Y.: Solving a polynomial equation: some history and recent progress. SIAM Rev. 39, 187–220 (1997)
Kalantari B., Kalantari I., Zaare-Nahandi R.: A basic family of iteration functions for polynomial root finding and its characterizations. J. Comput. Appl. Math. 80, 209–226 (1997)
McNamee J.M.: Numerical Methods for Roots of Polynomials—Part I. Elsevier, Amsterdam (2007)
McNamee J.M., Pan V.: Numerical Methods for Roots of Polynomials—Part II. Elsevier, Amsterdam (2013)
Proinov P.D.: New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems. J. Complex. 26, 3–42 (2010)
Proinov, P.D.: General convergence theorems for iterative processes and applications to the Weierstrass root-finding method. arXiv:1503.05243 (2015)
Schröder E.: Über unendlich viele Algorithmen zur Auflösung der Gleichungen. Math. Ann. 2, 317–365 (1870)
Proinov P.D., Ivanov S.I.: On the convergence of Halley’s method for multiple polynomial zeros. Mediter. J. Math. 12, 555–572 (2015)
Obreshkov N.: On the numerical solution of equations (in Bulgarian). Annuaire Univ. Sofia Fac. Sci. Phys. Math. 56, 73–83 (1963)
Traub J.F.: Iterative Methods for the Solution of Equations, 2nd edn. Chelsea Publishing Company, New York (1982)
Chebychev, P.L.: Computation roots of an equation. In: Complete Works of P.L. Chebishev, Vol. 5, pp. 7–25. USSR Academy of Sciences, Moscow (in Russian) http://books.e-heritage.ru/book/10079542 (1838)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ivanov, S. On the Convergence of Chebyshev’s Method for Multiple Polynomial Zeros. Results. Math. 69, 93–103 (2016). https://doi.org/10.1007/s00025-015-0490-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00025-015-0490-y