An O(n/sup 1+/spl epsiv// log b) algorithm for the complex roots problem

Given a univariate polynomial f(z) of degree n with complex coefficients, whose real and imaginary parts can be expressed as a ratio of two integers less than 2/sup m/ in magnitude, the root problem is to find all the roots of f(z) up to specified precision 2/sup -/spl mu//. Assuming the arithmetic model for computation, we provide, for any /spl epsiv/>0, an algorithm which has complexity O(n/sup 1+/spl epsiv// log b), where b=m+/spl mu/. This improves on the previous best known algorithm for the problem which has complexity O(n/sup 2/ log b). We claim it that it follows from the fact that we can bound the precision required in all the arithmetic computations, that the complexity of our algorithm in the Boolean model of computation is O(n/sup 2+/spl epsiv//(n+b) log/sup 2/ b log log b).<<ETX>>

[1]  B. Anderson,et al.  Asymptotically fast solution of toeplitz and related systems of linear equations , 1980 .

[2]  Michael Ben-Or,et al.  Simple algorithms for approximating all roots of a polynomial with real roots , 1990, J. Complex..

[3]  John H. Reif.  An O(nlog/sup 3/ n) algorithm for the real root problem , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[4]  S. Smale.  The fundamental theorem of algebra and complexity theory , 1981 .

[5]  Victor Y. Pan,et al.  Polynomial division and its computational complexity , 1986, J. Complex..

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

[7]  Willard L. Miranker,et al.  Optimal Sequential and Parallel Seach for Finding a Root , 1977, J. Comb. Theory, Ser. A.

[8]  V. Pan.  Algebraic complexity of computing polynomial zeros , 1987 .

[9]  David Y. Y. Yun,et al.  Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.

[10]  Dario Andrea Bini.  Divide and conquer techniques for the polynomial root-finding problem , 1995 .

[11]  James Renegar,et al.  On the cost of approximating all roots of a complex polynomial , 1985, Math. Program..

[12]  Ephraim Feig,et al.  A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots , 1988, SIAM J. Comput..

[13]  C. Andrew Neff,et al.  Roots of a polynomial and its derivatives , 1994, SODA '94.

[14]  George E. Collins.  Polynomial Remainder Sequences and Determinants , 1966 .

[15]  P. Henrici,et al.  Circular arithmetic and the determination of polynomial zeros , 1971 .

[16]  C. Andrew Neff,et al.  Specified precision polynomial root isolation is in NC , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  V. Pan.  Sequential and parallel complexity of approximate evaluation of polynomial zeros , 1987 .

[18]  Victor Y. Pan,et al.  Fast and E cient Parallel Evaluation of the Zeros of a Polynomial Having Only Real Zeros , 1989 .