Zero-clusters of polynomials: best approach in supercomputing era

DOI10.1016/j.amc.2009.11.017zbMath1186.65059MaRDI QIDQ961599

Ravi P. Agarwal, Syamal K. Sen

Publication date: 31 March 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.11.017

zbMATH Keywords

numerical examples; multiple roots; randomized methods; exhaustive search algorithm; computational error; supercomputing era; computational/time complexity; deflated Newton method; real/complex zero-cluster; zero-clusters of polynomials

Mathematics Subject Classification ID

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

26C10: Real polynomials: location of zeros

65H04: Numerical computation of roots of polynomial equations

Uses Software

• BRENT