Accelerated Approximation of the Complex Roots of a Univariate\n Polynomial (Extended Abstract)

2014/04/18 by Victor Y. Pan, Pan, Victor Y., Elias Tsigaridas +1
Computer Science · Engineering · #Advanced Numerical Analysis Techniques #FOS: Computer and information sciences #Numerical Methods and Algorithms #Polynomial and algebraic computation #Symbolic Computation (cs.SC)

paper · pdf · doi:10.48550/arxiv.1404.4775

openalex publication_date 2014/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Highly efficient and even nearly optimal algorithms have been developed for\nthe classical problem of univariate polynomial root-finding (see, e.g.,\n citeP95, citeP02, citeMNP13, and the bibliography therein), but this\nis still an area of active research. By combining some powerful techniques\ndeveloped in this area we devise new nearly optimal algorithms, whose\nsubstantial merit is their simplicity, important for the implementation.\n

Related

• Accelerated Approximation of the Complex Roots and Factors of a Univariate Polynomial
• Simple and Nearly Optimal Polynomial Root-finding by Means of Root Radii\n Approximation
• Real Polynomial Root-finding by Means of Matrix and Polynomial Iterations
• Polynomial Root-Finding and Algebraic Eigenvalue Problem
• Iterative polynomial-root-finding procedure with enhanced accuracy