Accelerated approximation of the complex roots of a univariate polynomial

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., [6], [7], [4], and the bibliography therein), but this is still an area of active research. By combining some powerful techniques developed in this area we devise new algorithm for refinement of isolated complex roots that have nearly optimal Boolean complexity.

[1]  Victor Y. Pan,et al.  Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding , 2002, J. Symb. Comput..

[2]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[3]  Arnold Schönhage,et al.  The fundamental theorem of algebra in terms of computational complexity - preliminary report , 1982 .

[4]  B. Fine,et al.  The Fundamental Theorem of Algebra , 1997 .

[5]  Victor Y. Pan,et al.  Transformations of Matrix Structures Work Again , 2013, 1303.0353.

[6]  Victor Y. Pan,et al.  On the boolean complexity of real root refinement , 2013, ISSAC '13.

[7]  James Renegar,et al.  On the worst-case arithmetic complexity of approximating zeros of polynomials , 1987, J. Complex..

[8]  V. Pan,et al.  Polynomial and matrix computations (vol. 1): fundamental algorithms , 1994 .

[9]  Victor Y. Pan,et al.  Nearly optimal computations with structured matrices , 2014, Theor. Comput. Sci..

[10]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.

[11]  Kurt Mehlhorn,et al.  From approximate factorization to root isolation with application to cylindrical algebraic decomposition , 2013, J. Symb. Comput..

[12]  Victor Y. Pan,et al.  Nearly optimal refinement of real roots of a univariate polynomial , 2016, J. Symb. Comput..

[13]  Kurt Mehlhorn,et al.  From approximate factorization to root isolation , 2013, ISSAC '13.

[14]  Victor Y. Pan,et al.  TR-2014005: Fast Approximation Algorithms for Computations with Cauchy Matrices and Extensions , 2014 .

[15]  Victor Y. Pan,et al.  Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros , 1995, STOC '95.

[16]  Joris van der Hoeven.  Fast composition of numeric power series ∗ , 2008 .

[17]  Peter Kirrinnis,et al.  Partial Fraction Decomposition in (z) and Simultaneous Newton Iteration for Factorization in C[z] , 1998, J. Complex..

[18]  Victor Y. Pan,et al.  Univariate polynomials: nearly optimal algorithms for factorization and rootfinding , 2001, ISSAC '01.

[19]  Victor Y. Pan,et al.  Numerical methods for roots of polynomials , 2007 .

[20]  Michael Sagraloff,et al.  Fast Approximate Polynomial Multipoint Evaluation and Applications , 2013, ArXiv.