Accelerated approximation of the complex roots of a univariate polynomial
From MaRDI portal
Publication:2819725
DOI10.1145/2631948.2631973zbMath1345.65034OpenAlexW1992293430MaRDI QIDQ2819725
Pan, Victor Y., Elias P. Tsigaridas
Publication date: 29 September 2016
Published in: Proceedings of the 2014 Symposium on Symbolic-Numeric Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00980584/file/pt-cr-snc.pdf
Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)
Related Items (3)
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation
This page was built for publication: Accelerated approximation of the complex roots of a univariate polynomial
