Faster numerical univariate polynomial root-finding by means of subdivision iterations

DOI10.1007/978-3-030-60026-6_25OpenAlexW3095966059MaRDI QIDQ2110240

Vitaly Zaderman, Qi Luan, Wongeun Kim, Pan, Victor Y.

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-60026-6_25

zbMATH Keywords

subdivisionpolynomial rootssparse polynomialsreal polynomial root-finding

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (2)

Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues ⋮ Accelerated subdivision for clustering roots of polynomials given by evaluation oracles

This page was built for publication: Faster numerical univariate polynomial root-finding by means of subdivision iterations