Acceleration of subdivision root-finding for sparse polynomials

DOI10.1007/978-3-030-60026-6_27OpenAlexW3095001782MaRDI QIDQ2110242

Pan, Victor Y.

Publication date: 21 December 2022

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

zbMATH Keywords

subdivisionsparse polynomialspolynomial root-findingexclusion testpower sums of rootsroot-counting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (3)

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

This page was built for publication: Acceleration of subdivision root-finding for sparse polynomials