TY - JOUR
TI - Roots of polynomials by Newton's iteration
DO - https://doi.org/doi:10.7282/t3-pj42-8v16
AU - Beaucage, David R.
PY - 1971-10
AB - An iterative method is described which finds all the roots of a square-free polynomial at once, using the original coefficients in each step (thus minimizing round off error). Since the iteration is basically Newton's, the usual convergence criteria and quadratic-convergence behavior obtain. Except for the facts about polynomial coefficients and contraction mappings, the paper is self-contained.
LA - English
ER -