Accelerated approximation of the complex roots of a univariate polynomial

DOI10.1145/2631948.2631973MaRDI QIDQ2819725zbMATH OpenOpenAlexFDO

Authors Victor Y. Pan, 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

zbMATH Keywords

Boolean complexitycomplex root refinementpolynomial

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Accelerated approximation of the complex roots and factors of a univariate polynomial
• On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
• Faster numerical univariate polynomial root-finding by means of subdivision iterations
• Efficient parallel rooting of complex polynomials on the unit circle
• The simultaneous approximation of polynomial roots
• Fast and Backward Stable Computation of Roots of Polynomials
• Finding polynomial roots: A fast algorithm convergent on the complex plane
• scientific article; zbMATH DE number 1263360
• Simple and nearly optimal polynomial root-finding by means of root radii approximation

Cited in

(15)

• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
• Faster numerical univariate polynomial root-finding by means of subdivision iterations
• Old and new nearly optimal polynomial root-finders
• Accelerated approximation of the complex roots and factors of a univariate polynomial
• Root-refining for a polynomial equation
• On the Boolean complexity of real root refinement
• Polynomial real root isolation by means of root radii approximation
• Efficient parallel rooting of complex polynomials on the unit circle
• Simple and nearly optimal polynomial root-finding by means of root radii approximation
• New progress in univariate polynomial root finding
• Fast and Backward Stable Computation of Roots of Polynomials
• Logical Approaches to Computational Barriers
• Nearly optimal refinement of real roots of a univariate polynomial
• A study of accelerated Newton methods for multiple polynomial roots

This page was built for publication: Accelerated approximation of the complex roots of a univariate polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819725)