Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation

DOI10.1007/978-3-319-56932-1_23zbMath1397.65069arXiv1705.00729OpenAlexW2963014696MaRDI QIDQ4610020

Pan, Victor Y.

Publication date: 5 April 2018

Published in: Applications of Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.00729

zbMATH Keywords

polynomialsroot-findingroot isolationroot radii

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Nearly optimal refinement of real roots of a univariate polynomial
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
• Numerical methods for roots of polynomials. II
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• Accelerated approximation of the complex roots and factors of a univariate polynomial
• Upperbounds for roots of polynomials
• An efficient algorithm for determining the convex hull of a finite planar set
• Recherches sur la méthode de Graeffe et les zéros des polynômes et des séries de Laurent
• Accelerated approximation of the complex roots of a univariate polynomial
• On the boolean complexity of real root refinement
• Dandelin, Lobacevskii, or Graeffe
• Polynomial Real Root Isolation by Means of Root Radii Approximation
• Tangent Graeffe iteration