Abstract
Two algorithms of polynomial factorization, quadratically and cubically convergent, are presented corresponding respectively to two algorithms of polynomial root finding known as Durand-Kerner method and Aberth’s method. To apply these algorithms to the problem of factorization of a polynomial with real coefficients into at most quadratic factors within real arithmetic, a default starting value is proposed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O. Aberth, Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comp.,23 (1973), 339–344.
M. Iri, H. Yamashita, T. Terano and H. Ono, An algebraic-equation solver with global convergence property. RIMS Kokyuroku 399, 1978, 43–69.
M. Iri, Numerical Methods (Suuchi Keisan). Asakura Shoten, Tokyo, 1981.
I. O. Kerner, Ein Gesamtschrittverfahren zur Berechung der Nullstellen von Polynomen. Numer. Math.,8 (1966), 290–294.
T. Sakurai, T. Torii and H. Sugiura, A simultaneous method for solving real-coefficient algebraic equations and its interpretation via Coulomb field. RIMS Kokyuroku 585, 1986, 1–25.
Author information
Authors and Affiliations
About this article
Cite this article
Ando, S. Real arithmetic versions of simultaneous iteration methods for polynomial root finding. Japan J. Appl. Math. 6, 67–76 (1989). https://doi.org/10.1007/BF03167915
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03167915