Computing clustered close-roots of univariate polynomials

DOI10.1145/1577190.1577217zbMath1356.65127OpenAlexW2076504054MaRDI QIDQ2959032

Tateaki Sasaki, Akira Terui

Publication date: 3 February 2017

Published in: Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

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

zbMATH Keywords

error boundspolynomial root-findingDurand-Kerner's methodapproximate square-free decompositionclose roots

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

Near optimal subdivision algorithms for real root isolation ⋮ Tighter bounds of errors of numerical roots

This page was built for publication: Computing clustered close-roots of univariate polynomials