Abstract
Using Newton’s and Halley’s corrections new simultaneous methods for solving polynomial equations, based on classical Laguerre’s method, are obtained. The convergence order of the proposed methods is five and six, respectively. Further improvements of these methods are accomplished by applying the Gauss-Seidel approach. The lower bounds of the R-order of convergence of the accelerated (single- step) methods are derived. Faster convergence of all proposed methods is attained without additional operations, which provides a high computational efficiency of these methods. Convergence analysis and numerical results are given.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alefeld, G., Herzberger, J.: On the convergence speed of some algorithms for the simultaneous approximation of polynomial zeros. SIAM J. Numer. Anal. 11, 237–243 (1974).
Alefeld, G., Herzberger, J.: Introduction to interval computations. New York: Academic Press, 1983.
Hansen, E., Patrick, M.: A family of root finding methods. Numer. Math. 27, 257–269 (1977).
Hansen, E., Patrick, M., Rusnak, J.: Some modifications of Laguerre’s method. BIT 17, 409–417 (1977).
Henrici, P.: Applied and computational complex analysis, vol I. New York: Wiley, 1974.
Milo vano vie, G. V., Petkovic, M. S.: On the convergence order of a modified method for simultaneous finding polynomial zeros. Computing 30, 171–178 (1983).
Ortega, J. M., Rheinboldt, W. C: Iterative solution of nonlinear equations in several variables. New York: Academic Press, 1970.
Ostrowski, A. M.: Solution of equations in Euclidean and Banach space. New York: Academic Press, 1973.
Parlett, B.: Laguerre’s method applied to the matrix eigenvalue problem. Math. Comput. 18, 464–485 (1964).
Petkovic, M. S.: Iterative methods for simultaneous inclusion of polynomial zeros. Berlin Heidelberg New York: Springer, 1989.
Petkovic, M. S., Milovanovic, G. V.: A note on some improvements of the simultaneous methods for the determination of polynomial zeros. J. Comput. Appl. Math. 9, 65–69 (1983).
Petkovic, M. S., Petkovic, Lj. D.: Complex interval arithmetic and its applications. Berlin: Wiley-VCH, 1998
Petkovic, M. S., Stefanovic, L. V.: On some improvements of square root iteration for polynomial complex zeros. J. Comput. Appl. Math. 15, 13–25 (1986).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Wien
About this paper
Cite this paper
Petković, M.S., Petković, L., Živković, D. (2001). Laguerre-like Methods for the Simultaneous Approximation of Polynomial Zeros. In: Alefeld, G., Chen, X. (eds) Topics in Numerical Analysis. Computing Supplementa, vol 15. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6217-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6217-0_15
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83673-6
Online ISBN: 978-3-7091-6217-0
eBook Packages: Springer Book Archive