Abstract
In this paper we present new local and semilocal convergence theorems for the two-point Weierstrass method for the simultaneous computation of polynomial zeros. Our local convergence result improves and complements the previous one obtained by Kanno et al. (Jpn J Indus Appl Math 13, 267–288, 1996).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abu-Alshaikh I., Sahin A.: Two-point iterative methods for solving nonlinear equations. Appl. Math. Comput. 182, 871–878 (2006)
Argyros, I.K.; González, D.: Unified majorizing sequences for Traub type multipoint iterative procedures. Numer. Algorithms. doi:10.1007/s11075-012-9678-3 (2012)
Dochev K.K.: Modified Newton method for the simultaneous computation of all roots of a given algebraic equation (in Bulgarian). Phys. Math. J. Bulg. Acad. Sci. 5, 136–139 (1962)
Dochev K., Byrnev P.: Certain modifications of Newton’s method for the approximate solution of algebraic equations. USSR Comput. Math. Math. Phys. 4(5), 174–182 (1964)
Ezquerro J.A., Gutiérrez J.M., Hernández M.A., Salanova M.A.: A biparametric family of inverse-free multipoint iterations. Comput. Appl. Math. 19(1), 109–124 (2000)
Iliev, A., Kyurkchiev, N.: Nontrivial Methods in Numerical Analysis: Selected Topics in Numerical Analysis. Lambert Acad. Publ., Saarbrucken (2010)
Grau-Sánchez M., Gutiérrez J.M.: Zero-finder methods derived from Obreshkov’s techniques. Appl. Math. Comput. 215, 2992–3001 (2009)
Kanno S., Kjurkchiev N.V., Yamamoto T.: On some methods for the simultaneous determination of polynomial zeros. Jpn. J. Indus. Appl. Math. 13, 267–288 (1996)
Nedzhibov G.H., Hasanov V.I., Petkov M.P.: On some families of multi-point iterative methods for solving nonlinear equations. Numer. Algorithms 42, 127–136 (2006)
Niell A.M.: Method for simultaneous determination of all the roots of algebraic equations. Comput. Math. Appl. 41, 1–14 (2001)
Petković, M.: Point Estimation of Root Finding Methods, Lecture Notes in Mathematics. Lecture Notes in Mathematics, vol. 1933. Springer, Berlin (2008)
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.: Relationships between different types of initial conditions for the simultaneous root finding methods (in preparation)
Sendov, B., Andreev, A., Kjurkchiev, N.: Numerical solution of polynomial equations. In: Ciarlet, P., Lions, J. (eds.) Handbook of Numerical Analysis, vol. III, pp. 625–778. Elsevier, Amsterdam (1994)
Stewart G.W.: On the convergence of multipoint iterations. Numer. Math. 68, 143–147 (1994)
Wang D., Zhao F.: On the determination of a safe initial approximation for the Durand–Kerner algorithm. J. Comput. Appl. Math. 38, 447–456 (1991)
Weierstrass, K.: Neuer Beweis des Satzes, dass jede ganze rationale Function einer Veränderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Sitzungsber. Königl. Akad. Wiss. Berlin, 1085–1101 (1891)
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Proinov, P.D., Petkova, M.D. Convergence of the two-point Weierstrass root-finding method. Japan J. Indust. Appl. Math. 31, 279–292 (2014). https://doi.org/10.1007/s13160-014-0138-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13160-014-0138-4
Keywords
- Two-point Weierstrass method
- Simultaneous methods
- Polynomialzeros
- Local convergence
- Semilocal convergence
- Error estimates