New Practical Advances in Polynomial Root Clustering
From MaRDI portal
(Redirected from Publication:5014669)
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
- scientific article; zbMATH DE number 3309631 (Why is no real title available?)
- 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.
- Complexity Analysis of Root Clustering for a Complex Polynomial
- Computing Real Roots of Real Polynomials ... and now For Real!
- Computing real roots of real polynomials
- Counting roots of a polynomial in a convex compact region by means of winding number calculation via sampling
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis
- Implementation of a near-optimal complex root clustering algorithm
- Nearly optimal refinement of real roots of a univariate polynomial
- Old and new nearly optimal polynomial root-finders
- On the Boolean complexity of real root refinement
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Solving secular and polynomial equations: a multiprecision algorithm
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(6)- Zero-clusters of polynomials: best approach in supercomputing era
- 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
- New practical advances in polynomial root clustering
- Complexity of a root clustering algorithm for holomorphic functions
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)
