New Practical Advances in Polynomial Root Clustering
From MaRDI portal
Publication:5014669
DOI10.1007/978-3-030-43120-4_11OpenAlexW3013800652MaRDI QIDQ5014669FDOQ5014669
Authors: Rémi Imbach, Victor Y. Pan 
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
Recommendations
- Roots of composite polynomials - an application to root clustering
- Root clustering for convex combination of complex polynomials
- Computing clustered close-roots of univariate polynomials
- Complexity Analysis of Root Clustering for a Complex Polynomial
- A symmetric matrix criterion for polynomial root clustering
- Implementation of a near-optimal complex root clustering algorithm
- Root clustering of interval polynomials in the left-sector
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
- New progress in real and complex polynomial root-finding
- Necessary and sufficient conditions for root clustering of a polytope of polynomials in a simply connected domain
Cites Work
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Solving secular and polynomial equations: a multiprecision algorithm
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Counting roots of a polynomial in a convex compact region by means of winding number calculation via sampling
- Computing real roots of real polynomials
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- On the boolean complexity of real root refinement
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Nearly optimal refinement of real roots of a univariate polynomial
- Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis
- Complexity Analysis of Root Clustering for a Complex Polynomial
- 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
- Computing Real Roots of Real Polynomials ... and now For Real!
- Title not available (Why is that?)
- Old and new nearly optimal polynomial root-finders
Cited In (5)
- Zero-clusters of polynomials: best approach in supercomputing era
- New practical advances in polynomial root clustering
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
- Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
- Complexity Analysis of Root Clustering for a Complex Polynomial
Uses Software
This page was built for publication: New Practical Advances in Polynomial Root Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014669)
