Optimal and nearly optimal algorithms for approximating polynomial zeros

• Published in: Computers & mathematics with applications (1987) 1996, Vol.31 (12), p.97-138
• Main Author: Pan, V.Y.
• Format: Article
• Language: English
• Subjects: Approximation; Complex polynomial zeros; Computational complexity; Parallel algorithms; Polynomial factorization; Sequential algorithms
• ISSN: 0898-1221; 1873-7668
• DOI: 10.1016/0898-1221(96)00080-6

We substantially improve the known algorithms for approximating all the complex zeros of an n th degree polynomial p( x). Our new algorithms save both Boolean and arithmetic sequential time, versus the previous best algorithms of Schönhage [1], Pan [2], and Neff and Reif [3]. In parallel (NC) implementation, we dramatically decrease the number of processors, versus the parallel algorithm of Neff [4], which was the only NC algorithm known for this problem so far. Specifically, under the simple normalization assumption that the variable x has been scaled so as to confine the zeros of p( x) to the unit disc x : | x| ≤ 1, our algorithms (which promise to be practically effective) approximate all the zeros of p( x) within the absolute error bound 2 − b , by using order of n arithmetic operations and order of ( b + n) n 2 Boolean (bitwise) operations (in both cases up to within polylogarithmic factors). The algorithms allow their optimal (work preserving) NC parallelization, so that they can be implemented by using polylogarithmic time and the orders of n arithmetic processors or ( b + n) n 2 Boolean processors. All the cited bounds on the computational complexity are within polylogarithmic factors from the optimum (in terms of n and b) under both arithmetic and Boolean models of computation (in the Boolean case, under the additional (realistic) assumption that n = O( b)).