The fast Halley algorithm for finding all zeros of a polynomial

MaRDI QIDQ3441553zbMATH OpenFDO

Authors Xiangzhao Cui, Dadi Yang, Yao Long

Publication date 30 May 2007

zbMATH Keywords

algorithmcircular arithmeticconvergenceHalley circular iteration methodNumerical experimentszeros of a polynomial

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Recommendations

• The fast and parallel Halley algorithm for finding all zeros of a polynomial
• scientific article; zbMATH DE number 3976212
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• Halley-like method with corrections for the inclusion of polynomial zeros
• scientific article; zbMATH DE number 4195051

Cited in

(4)

• An algorithm for locating all zeros of a real polynomial
• AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
• The fast and parallel Halley algorithm for finding all zeros of a polynomial
• scientific article; zbMATH DE number 3976212 (Why is no real title available?)

This page was built for publication: The fast Halley algorithm for finding all zeros of a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3441553)