Abstract
In this paper we derive five kinds of algorithms for simultaneously finding the zeros of a complex polynomial. The convergence and the convergence rate with higher order are obtained. The algorithms are numerically illustrated by an example of degree 10, and the numerical results are satisfactory.
Zusammenfassung
In dieser Arbeit leiten wir fünf Varianten eines Algorithmus zur parallelen Bestimmung der Nullstellen eines komplexen Polynoms her. Ihre Konvergenz und deren Rate höherer Ordung werden bestimmt. Die Algorithmen werden an einem Beispiel vom Grad 10 numerisch illustriert, die Ergebnisse sind zufriedenstellend.
This is a preview of subscription content, log in via an institution to check access.
References
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).
Gargentini, I., Henrici, P.: Circular arithmetic and the determination of polynomial zeros. Numer. Math.18, 305–320 (1972).
Milovanović, G. V., Petković, M. S.: On the convergence order of a modified method for simultaneous finding polynomial zeros. Computing30, 171–178 (1983).
Wang, Xing-hua, Zheng, Shi-ming: Parallel Halley iteration method with circular arithmetic for finding all zeros of a polynomial. A Journal of Chinese University, Numer. Math.4, 308–314 (1985).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, Dr., Wu, Yj. Some modifications of the parallel Halley iteration method and their convergence. Computing 38, 75–87 (1987). https://doi.org/10.1007/BF02253746
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02253746