Old and new nearly optimal polynomial root-finders

DOI10.1007/978-3-030-26831-2_26zbMath1439.65064OpenAlexW2968614629MaRDI QIDQ2175594

Pan, Victor Y.

Publication date: 29 April 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26831-2_26

zbMATH Keywords

polynomial factorizationsubdivisiondeflationpolynomial root-findingfunctional iterationsreal root-finding

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical computation of solutions to single equations (65H05) Numerical computation of roots of polynomial equations (65H04)

Related Items (4)

Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues ⋮ Root-Squaring for Root-Finding ⋮ New Practical Advances in Polynomial Root Clustering ⋮ Accelerated subdivision for clustering roots of polynomials given by evaluation oracles

This page was built for publication: Old and new nearly optimal polynomial root-finders