Implementation of a near-optimal complex root clustering algorithm
From MaRDI portal
Publication:1662242
DOI10.1007/978-3-319-96418-8_28zbMath1398.65095arXiv1806.10584OpenAlexW2810037454MaRDI QIDQ1662242
Rémi Imbach, Chee-Keng Yap, Pan, Victor Y.
Publication date: 17 August 2018
Full work available at URL: https://arxiv.org/abs/1806.10584
Packaged methods for numerical algorithms (65Y15) Numerical computation of roots of polynomial equations (65H04)
Related Items
Root radii and subdivision for polynomial root-finding, Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues, Clustering complex zeros of triangular systems of polynomials, New Practical Advances in Polynomial Root Clustering, Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
Uses Software