Some polynomial and Toeplitz matrix computations

Part 1. Approximate Evaluation of Polynomial Zeros O(n2(1og2n+log b)) arithmetic operations or O( n(log2n+log b) parallel steps, n processors suffice in order to approximate with absolute error ~ 2mb to all the complex zeros of an n-th degree polynomial p(x) whose coefficients have moduli < 2m• If we only need such an approximation to a single zero of p(x), then O(n log n(n+log b)) arithmetic operations or O(log n(log2n+log b)) steps and n+n/(loin+log b) processors suffice (which places the latter problem in NC); furthermore if all the zeros are real, then we arrive at the bounds O(n log n(log3n+log b)), O(log n(log3+log b)), and n, respectively. Those estimates are reached in computations with O(nb) binary bits where the polynomial· has integer coefficients. This also implies a simple proof of the Boolean circuit complexity estimates for the approximation of all the complex zeros of p(x), announced in 1982 and partly proven by Schonhage. The computations rely on recursive application of Turan's proximity test of 1968, on its more recent extensions to root radii computations, and on contour integration via FFT within our modifications of the known geometric constructions for search and exclusion.

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

[2]  Victor Y. Pan,et al.  Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices , 1985, FSTTCS.

[3]  Victor Y. Pan,et al.  Complexity of Parallel Matrix Computations , 1987, Theor. Comput. Sci..

[4]  Donald E. Knuth.  The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[5]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[6]  Maurice Mignotte,et al.  Some inequalities about univariate polynomials , 1981, SYMSAC '81.

[7]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[8]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

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

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

[11]  W. M. Gentleman,et al.  Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).

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

[13]  James R. Bunch,et al.  Stability of Methods for Solving Toeplitz Systems of Equations , 1985 .

[14]  Joachim von zur Gathen,et al.  Parallel algorithms for algebraic problems , 1983, SIAM J. Comput..

[15]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[16]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[17]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

[19]  Joachim von zur Gathen.  Parallel algorithms for algebraic problems , 1983, STOC '83.

[20]  J. Hopcroft,et al.  Fast parallel matrix and GCD computations , 1982, FOCS 1982.

[21]  Victor Y. Pan,et al.  Efficient parallel solution of linear systems , 1985, STOC '85.

[22]  L. Ljung,et al.  Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems , 1978 .

[23]  Paul Turán,et al.  On a new method of analysis and its applications , 1984 .

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

[25]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[26]  M. Fischer,et al.  STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[27]  A. Householder.  The numerical treatment of a single nonlinear equation , 1970 .

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

[29]  Ephraim Feig,et al.  A fast parallel algorithm for determining all roots of a polynomial with real roots , 1986, STOC '86.

[30]  Joachim von zur Gathen.  Representations and Parallel Computations for Rational Functions , 1986, SIAM J. Comput..