Summary
Consider a polynomialP(z) of degreeN whose zeros are known to lie insideN closed disks, each disk containing one and only one root. In this paper we show that if the given disks are “sufficiently well separated”, then the first derivative ofP(z) never vanishes inside the initial inclusion regions. The formulation of the square-root iteration in terms of circular regions is then possible and leads to an iterative scheme with degree four convergence. The corresponding algorithm makes use of circular arithmetic and in particular of the definition of square root of a disk. A criterion for the selection of the appropriate square-root set is also given. The procedure can be used to simultaneously refine all (complex or real) roots ofP(z) together with their error bounds.
Similar content being viewed by others
References
Gargantini, I.: Parallel Square-root Iterations. In: Interval Mathematics (ed. K. Nickel), Berlin: Springer-Verlag 1975, pp. 196–204
Henrici, P.: Applied and Computational Complex Analysis, Vol. I, New York: Wiley-Interscience 1974
Author information
Authors and Affiliations
Additional information
This work was partially supported through the Canada Council 1974–1975 Award No. W740421
Rights and permissions
About this article
Cite this article
Gargantini, I. Parallel laguerre iterations: The complex case. Numer. Math. 26, 317–323 (1976). https://doi.org/10.1007/BF01395948
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01395948