The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence

DOI10.1145/232826.232830zbMath0884.65042OpenAlexW2077290045WikidataQ113310387 ScholiaQ113310387MaRDI QIDQ4371096

No author found.

Publication date: 2 April 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1996-22/

zbMATH Keywords

algorithmerror analysisiterative methodsquadratic convergencemultiple rootroots of a polynomialpolynomial rootfinderspolynomial zerofinder

Mathematics Subject Classification ID

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) Software, source code, etc. for problems pertaining to functions of a complex variable (30-04)

Related Items

Polynomial zerofinding iterative matrix algorithms, The Weierstrass–Durand–Kerner root finder is not generally convergent, A composite polynomial zerofinding matrix algorithm, An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli, Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence, A study of accelerated Newton methods for multiple polynomial roots, Method for finding multiple roots of polynomials