Abstract
We propose a method with raised speed of convergence for simultaneous extraction of a part of all roots of polynomials. The method is efficient for the polynomials which have well separated real roots. The proof of local convergence is shown and numerical results are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Alefeld and J. Herzberger, Introduction to Interval Computations. Academic Press, New York, 1983.
I. Berezin and N. Zhidkov, Computing Methods II. Pergamon Press, Oxford, 1965.
K. Dochev, An alternative method of Newton for simultaneous calculation of all the roots of a given algebraic equation (Bulgarian). Phys.-Math. J.,5 (1962), 136–139.
E. Durand, Solutions numérique des équations algébriques. Tome I: Équations du type F(x) = 0. Racines d’une Polynôme, Masson, Paris, 1960, 279–281.
L. Euler, Opera Omnia. Ser. I, Vol. X (eds. F. Engel and L. Schlesinger). Birkhäuser, 1913, 422–455.
A. Iliev and N. Kyurkchiev, On a generalization of Weierstrass-Dochev method for simultaneous extraction of only a part of all roots of algebraic polynomials: part I. C. R. Acad. Bulg. Sci.,55 (2002), 23–26.
A. Iliev and N. Kyurkchiev, Some methods for simultaneous extraction of only a part of all roots of algebraic polynomials part II. C. R. Acad. Bulg. Sci.,55 (2002), 17–22.
S. Kanno, N. Kjurkchiev and T. Yamamoto, On some methods for the simultaneous determination of polynomial zeros. Japan J. Indust. Appl. Math.,13, No. 2 (1996), 267–288.
N. Kyurkchiev and A. Iliev, A family of methods for simultaneous extraction of only a part of all roots of algebraic polynomials. BIT,42 (2002), 879–885.
N. Kyurkchiev, Initial Approximation and Root Finding Methods. WILEY-VCH Verlag Berlin GmbH,Vol. 104, Berlin 1998.
J. Ortega and W. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970.
M. Petković, Iterative methods for simultaneous inclusion of polynomial zeros. Lecture Notes in Mathematics1387 (eds. A. Dold and B. Eckmann), Springer-Verlag, Berlin-Heidelberg, 1989.
S. Presic, Un procédé itératif pour la factorisation des polynomes. C. R. Acad. Sci. Paris,262 (1966), 862–863.
M. Presic, Un procédé itératif pour déterminerk zéros d’un polynome. C. R. Acad. Sci. Paris,273 (1971), 446–449.
B. Sendov, A. Andreev and N. Kyurkchiev, Numerical solution of polynomial equations. Handbook of Numerical Analysis III (eds. P. Ciarlet and J. Lions), Elsevier Sci. Publ., Amsterdam, 1994.
K. Tanabe, Behavior of the sequences around multiple zeroes generated by some simultaneous methods for solving algebraic equations (Japanese). Tech. Rep. Inf. Process. Numer. Anal.,4, No. 2 (1983), 1–6.
J. Traub, Iterative Methods for the Solution of Equations. Prentice-Hall, Englewood Cliffs, NJ, 1964.
K. Weierstrass, Neuer Beweis des Satzes, dass jede ganze rationale Funktion einer Veränderlichen dargestellt werden kann als ein Product aus Linearen Functionen derselben Veränderlichen. Gesammelte Werke,3 (1903), Johnson, New York, 251–269.
T. Yamamoto, S. Kanno and L. Atanassova, Validated computation of polynomial zeros by the Durand-Kerner method. Topics in Validated Computations, North Holland, Amsterdam, 1994.
T. Yamamoto, SOR-like methods for the simultaneous determination of polynomial zeros. Numerical Methods and Error Bounds (eds. G. Alefeld and J. Herzberger), Akademie Verlag, Berlin, 1996, 287–296.
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Iliev, A., Kyurkchiev, N. & Fang, Q. On a generalization of the Euler-Chebyshev method for simultaneous extraction of only a part of all roots of polynomials. Japan J. Indust. Appl. Math. 23, 63 (2006). https://doi.org/10.1007/BF03167498
Received:
Revised:
DOI: https://doi.org/10.1007/BF03167498