Abstract
Two modifications of Laguerre's method are given. They define methods for simultaneously approximating all the zeros of a given polynomial. The asymptotic behavior of the methods is studied. The possibilities of both sequential and parallel implementations of the methods are considered.
Similar content being viewed by others
References
Dobrilo D. Tošić and Gradimir V. Milovanović,An application of Newton's method to simultaneous determination of zeros of a polynomial, Univ. Beograd Publ. Elektrotechn. Fak. Mat. Fiz., 448 (1973), 175–177.
Irene Gagarantini,Parallel square root iterations InInterval Mathematics, Lecture Notes in Computer Science, Springer-Verlag, 1975.
G. Alefeld and J. Herzberger,On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots, SIAM J. Numer. Anal., 11 (1974), 237–243.
J. Herzberger,Über ein Verfahren zur Bestimmung reeller Nullstellen mit Anwendung auf Parallelrechnung, Electronische Rechenanlagen, 14 (1972), 250–254.
D. Braess and K. Hadeler,Simultaneous inclusion of the zeros of a polynomial, Numer. Math., 21 (1973), 161–165.
A. M. Ostrowski,Solution of equations in Euclidean and Banach Spaces, 3rd edition, Academic Press, 1973.
Beresford Parlett,Laguerre's method applied to the matrix eigenvalue problem, Math. Comp. 18 (1964), 464–485.
J. F. Traub,Iterative methods for the solution of equations, Prentice-Hall, 1964.
E. Hansen and M. Patrick,A family of root finding methods, Numer. Math. 27 (1977), 257–269.
E. Hansen and M. Patrick,Estimating the multiplicity of a root, Numer. Math. 27 (1976), 121–131.
Author information
Authors and Affiliations
Additional information
This research was supported by the National Science Foundation under grant number NSF-DCR-74-10042.
Rights and permissions
About this article
Cite this article
Hansen, E., Patrick, M. & Rusnak, J. Some modifications of Laguerre's method. BIT 17, 409–417 (1977). https://doi.org/10.1007/BF01933450
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933450