Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
From MaRDI portal
Publication:2109981
DOI10.1007/978-3-031-14788-3_9OpenAlexW4291170811MaRDI QIDQ2109981
Publication date: 21 December 2022
Full work available at URL: https://arxiv.org/abs/2206.08622
Related Items
Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues, Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
Cites Work
- Computing real roots of real polynomials
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- 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.
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
- Faster numerical univariate polynomial root-finding by means of subdivision iterations
- Acceleration of subdivision root-finding for sparse polynomials
- Old and new nearly optimal polynomial root-finders
- Solving secular and polynomial equations: a multiprecision algorithm
- Complexity Analysis of Root Clustering for a Complex Polynomial
- New Practical Advances in Polynomial Root Clustering
- Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders
- New progress in univariate polynomial root finding
- Quadratic interval refinement for real roots
