New Practical Advances in Polynomial Root Clustering

DOI10.1007/978-3-030-43120-4_11OpenAlexW3013800652MaRDI QIDQ5014669

Pan, Victor Y., Rémi Imbach

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Related Items

Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues, Accelerated subdivision for clustering roots of polynomials given by evaluation oracles

Uses Software

• na20

Cites Work

• Unnamed Item
• Computing real roots of real polynomials
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Nearly optimal refinement of real roots of a univariate polynomial
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• 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
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• Old and new nearly optimal polynomial root-finders
• Counting roots of a polynomial in a convex compact region by means of winding number calculation via sampling
• Solving secular and polynomial equations: a multiprecision algorithm
• On the boolean complexity of real root refinement
• Complexity Analysis of Root Clustering for a Complex Polynomial
• Computing Real Roots of Real Polynomials ... and now For Real!
• Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis