Root radii and subdivision for polynomial root-finding

DOI10.1007/978-3-030-85165-1_9OpenAlexW3198881649MaRDI QIDQ831975

Rémi Imbach, Pan, Victor Y.

Publication date: 24 March 2022

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

zbMATH Keywords

real root isolationcomplex root clusteringroot radii algorithmsubdivision iterations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items

Fast evaluation and root finding for polynomials with floating-point coefficients

Uses Software

• Arb
• ANewDsc
• Ccluster

Cites Work

• Unnamed Item
• Unnamed Item
• Computing real roots of real polynomials
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Implementation of a near-optimal complex root clustering algorithm
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• On the distance between the roots of a polynomial
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• Solving secular and polynomial equations: a multiprecision algorithm
• Complexity Analysis of Root Clustering for a Complex Polynomial
• Computing Real Roots of Real Polynomials ... and now For Real!
• Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
• Finding the convex hull of a simple polygon