Complexity Analysis of Root Clustering for a Complex Polynomial
DOI10.1145/2930889.2930939zbMath1364.30011arXiv2105.05183OpenAlexW2484278949MaRDI QIDQ2985810
No author found.
Publication date: 10 May 2017
Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.05183
Newton methodlocal complexityroot findingroot isolationroot clusteringGraeffe iterationcomplexity of rootsPellet test
Programming involving graphs or networks (90C35) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)
Related Items (10)
This page was built for publication: Complexity Analysis of Root Clustering for a Complex Polynomial