Real arithmetic versions of simultaneous iteration methods for polynomial root finding
- 13 Downloads
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.
Key wordsDurand-Kerner method Aberth’s method real-coefficient polynomial polynomial factorization
- M. Iri, H. Yamashita, T. Terano and H. Ono, An algebraic-equation solver with global convergence property. RIMS Kokyuroku 399, 1978, 43–69.Google Scholar
- M. Iri, Numerical Methods (Suuchi Keisan). Asakura Shoten, Tokyo, 1981.Google Scholar
- 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.Google Scholar