Accelerated subdivision for clustering roots of polynomials given by evaluation oracles

DOI10.1007/978-3-031-14788-3_9MaRDI QIDQ2109981zbMATH OpenOpenAlexFDO

Authors Rémi Imbach, Victor Y. Pan

Publication date 21 December 2022

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

zbMATH Keywords

oracle polynomialspolynomial root findingsubdivision algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Complexity Analysis of Root Clustering for a Complex Polynomial
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• Accelerated approximation of the complex roots and factors of a univariate polynomial
• A simple but exact and efficient algorithm for complex root isolation
• Accelerated approximation of the complex roots of a univariate polynomial

Cites work

• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
• Acceleration of subdivision root-finding for sparse polynomials
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• Complexity Analysis of Root Clustering for a Complex Polynomial
• Computing real roots of real polynomials
• Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
• Faster numerical univariate polynomial root-finding by means of subdivision iterations
• Implementation of a near-optimal complex root clustering algorithm
• New Practical Advances in Polynomial Root Clustering
• New progress in univariate polynomial root finding
• Old and new nearly optimal polynomial root-finders
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• Quadratic interval refinement for real roots
• Solving secular and polynomial equations: a multiprecision algorithm
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding

Cited in

(6)

• Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
• New Practical Advances in Polynomial Root Clustering
• New progress in univariate polynomial root finding
• Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
• Root-Squaring for Root-Finding
• A new fast root-finder for black box polynomials

This page was built for publication: Accelerated subdivision for clustering roots of polynomials given by evaluation oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109981)