New progress in univariate polynomial root finding

DOI10.1145/3373207.3404063OpenAlexW3045611396MaRDI QIDQ5145980

Pan, Victor Y., Rémi Imbach

Publication date: 22 January 2021

Published in: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373207.3404063

zbMATH Keywords

subdivisionpolynomial root findingroot counting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (4)

The Weierstrass–Durand–Kerner root finder is not generally convergent ⋮ Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4997829 �ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise] ⋮ Accelerated subdivision for clustering roots of polynomials given by evaluation oracles

This page was built for publication: New progress in univariate polynomial root finding