Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration

Abstract We propose a new algorithm for the classical and still practically important problem of approximating zeros zj of an nth degree polynomial p(x) within error bound 2−b maxj |zj|. The algorithm uses O((n2 log n) log(bn)) arithmetic operations and comparisons for approximating all the n zeros and O((kn log n) log(bn)) for approximating the k zeros lying in a fixed domain (disc or square) and isolated from the other zeros. Unlike the previous fast algorithms of this kind, the new algorithm has its simple elementary description, is convenient for practical implementation, and allows the users to adapt the computational precision to the current level of approximation achieved in the process of computing and ultimately to the requirements to the output precision for each zero of p(x). The algorithm relies on our novel versions of Weyl's quadtree construction and Newton's iteration.

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

[2]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

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

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

[5]  M. A. Jenkins,et al.  Algorithm 419: zeros of a complex polynomial [C2] , 1972, CACM.

[6]  Myong-Hi Kim,et al.  Polynomial Root-Finding Algorithms and Branched Covers , 1994, SIAM J. Comput..

[7]  S. Smale,et al.  Complexity of Bézout’s theorem. I. Geometric aspects , 1993 .

[8]  E. Hansen,et al.  Some modifications of Laguerre's method , 1977 .

[9]  William W. Hager.  A modified fast Fourier transform for polynomial evaluation and the jenkins-Traub algorithm , 1986 .

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

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

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

[13]  Carl B. Boyer,et al.  A History of Mathematics. , 1993 .

[14]  Stefan Goedecker,et al.  Remark on Algorithms to Find Roots of Polynomials , 1994, SIAM J. Sci. Comput..

[15]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[16]  L. Foster.  Generalizations of Laguerre’s Method: Higher Order Methods , 1981 .

[17]  by Arch. Rat. Mech. Anal. , 2022 .

[18]  Alfred V. Aho,et al.  Evaluating Polynomials at Fixed Sets of Points , 1975, SIAM J. Comput..

[19]  J. Schröder,et al.  Über das Newtonsche verfahren , 1957 .

[20]  V. Pan.  Optimal and nearly optimal algorithms for approximating polynomial zeros , 1996 .

[21]  Victor Y. Pan.  Weyl's Quadtree Algorithm for the Unsymmetric Eigenvalue Problem , 1995 .

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

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

[24]  F. Uhlig,et al.  The ${\cal {D Q R}}$ algorithm, basic theory, convergence, and conditional stability , 1997 .

[25]  H. Weyl.  Randbemerkungen zu Hauptproblemen der Mathematik , 1924 .

[26]  Victor Y. Pan.  Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[28]  Victor Y. Pan.  New techniques for approximating complex polynomial zeros , 1994, SODA '94.

[29]  L. Greengard.  The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .

[30]  L. Ahlfors.  Complex Analysis , 1979 .

[31]  D. H. Lehmer.  A Machine Method for Solving Polynomial Equations , 1961, JACM.

[32]  Immo O. Kerner,et al.  Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen , 1966 .

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

[34]  Victor Y. Pan,et al.  On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors , 1996, J. Complex..

[35]  J. McNamee.  A bibliography on roots of polynomials , 1993 .

[36]  Alexandre Ostrowski.  Recherches sur la méthode de graeffe et les zéros des polynomes et des séries de laurent , 1940 .

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

[38]  J. N. Lyness,et al.  A Numerical Method for Locating the Zeros of an Analytic Function , 1967 .

[39]  E. Bell.  The development of mathematics , 1941 .

[40]  S. Smale,et al.  Complexity of Bezout's theorem IV: probability of success; extensions , 1996 .

[41]  Helmut Alt,et al.  Multiplication is the easiest nontrivial arithmetic function , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[42]  Victor Y. Pan,et al.  Parallel complexity of tridiagonal symmetric Eigenvalue problem , 1991, SODA '91.

[43]  James Renegar,et al.  Unified complexity analysis for Newton LP methods , 1992, Math. Program..

[44]  Gene H. Golub,et al.  Matrix computations , 1983 .

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

[46]  Stephen Smale,et al.  Complexity of Bezout's Theorem: III. Condition Number and Packing , 1993, J. Complex..

[47]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[48]  A. A. Grau.  The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial , 1971 .

[49]  Peter Henrici,et al.  Constructive aspects of the fundamental theorem of algebra : proceedings of a symposium conducted at the IBM Research Laboratory, Zürich-Rüschlikon, Switzerland, June 5-7, 1967 , 1972 .

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

[51]  John Reid,et al.  Fortran Subroutines for Finding Polynomial Zeros , 1975 .

[52]  S. Smale,et al.  Complexity of Bezout’s Theorem II Volumes and Probabilities , 1993 .

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

[54]  V. Pan.  On Approximating Complex Polynomial Zeros: Modified Quadtree (Weyl's) Construction and Improved Newton's Iteration , 1996 .

[55]  Victor Y. Pan,et al.  Complexity of Computations with Matrices and Polynomials , 1992, SIAM Rev..

[56]  Ahmed Saoudi,et al.  A Quadtree Algorithm for Template Matching on a Pyramid Computer , 1994, Theor. Comput. Sci..

[57]  S. Lang.  Complex Analysis , 1977 .

[58]  Stephen Smale,et al.  Complexity of Bezout's Theorem V: Polynomial Time , 1994, Theor. Comput. Sci..

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

[60]  Victor Y. Pan,et al.  Solving a Polynomial Equation: Some History and Recent Progress , 1997, SIAM Rev..

[61]  Victor Y. Pan,et al.  Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real , 1998, SIAM J. Comput..

[62]  M. A. Jenkins,et al.  A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration , 1970 .

[63]  K. Madsen.  A root-finding algorithm based on Newton's method , 1973 .