Summary
A Gauss-Seidel procedure for accelerating the convergence of the generalized method of the root iterations type of the (k+2)-th order (k∈N) for finding polynomial complex zeros, given in [7], is considered in this paper. It is shown that theR-order of convergence of the accelerated method is at leastk+1+σ n (k), where σ n (k)>1 is the unique positive root of the equation σn-σ-k-1 = 0 andn is the degree of the polynomial. The examples of algebraic equations in ordinary and circular arithmetic are given.
Similar content being viewed by others
References
Alefeld, G., Herzberger, J.: Einführung in die Intervallrechnung. Zürich: Bibliographisches Institut AG 1974
Alefeld, G., Herzberger, J.: On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots. SIAM J. Numer. Anal.11 237–243 (1974)
Gargantini, I., Henrici, P.: Circular arithmetic and the determination of polynomial zeros. Numer. Math.18, 305–320 (1972)
Gargantini, I.: Parallel Laguerre iterations: Complex case. Numer. Math.26, 317–323 (1976)
Glatz, G.: Newton-Algorithmen zur Bestimmung von Polynomwurzeln unter Verwendung komplexer Kreisarithmetik. In: Interval mathematics (Nickel, K., ed.), pp. 205–214. Berlin-Heidelberg-New York: Springer 1975
Ortega, J.M., Rheinboldt, W.C.: Iterative solution of nonlinear equations in several variables. New York: Academic Press 1970
Petković, M.S.: On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic. Computing27, 37–55 (1981)
Petković, M.S.: Generalised root iterations for the simultaneous determination of multiple complex zeros. Z. Angew. Math. Mech.62, 627–630 (1982)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Petković, M., Stefanović, L. On the convergence order of accelerated root iterations. Numer. Math. 44, 463–476 (1984). https://doi.org/10.1007/BF01405575
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01405575