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

Journal of Complexity

Volumn 16, Issue 1, 2000, Pages 213-264

  Pan, Victor Y ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Complex polynomial zeros; algorithms; computational complexity

Indexed keywords

EID: 0000263259     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1999.0532     Document Type: Article

References (70)

1. Aho A. V., Steiglitz K., Ullman J. D. Evaluating polynomials at fixed set of points. SIAM J. Comput. 4:1975;533-539.
2. Ahlfors L. Complex Analysis. 1979;McGraw-Hill, New York.
3. Alt H. Multiplication is the easiest nontrivial arithmetic function. Theoret. Comput. Sci. 36:1985;333-339.
4. Bell E. T. The Development of Mathematics. 1940;McGraw-Hill, New York.
5. Ben-Or M., Feig E., Kozen D., Tiwari P. A fast parallel algorithm for determining all roots of a polynomial with real roots. SIAM J. Comput. 17:1989;1081-1092.
6. Boyer C. A. A History of Mathematics. 1968;Wiley, New York.
7. Ben-Or M., Tiwari P. Simple algorithm for approximating all roots of a polynomial with real roots. J. Complex. 6:1990;417-442.
8. Bini D., Pan V. Y. Polynomial and Matrix Computations. Vol. 1. Fundamental Algorithms. 1994;Birkhäuser, Boston.
9. Bini D., Pan V. Y. Computing matrix eigenvalues and polynomial zeros where the output is real. SIAM J. Comput. 27:1998;1099-1115.
10. D. Bini, and, V. Y. Pan, Polynomial and Matrix Computations. Vol. 2. Fundamental and Practical Algorithms, Birkhäuser, Boston, in press.
11. Durand E. Solutions Numériques des Equations Algébriques. Tome I. Equations du Type F(x)=0; Racines d'un Polynome. 1960;Masson, Paris.
12. Dejon B., Henrici P. Constructive Aspects of the Fundamental Theorem of Algebra. 1967;Wiley, London.
13. Delves L. M., Lyness J. N. A numerical method for locating zeros of an analytic function. Math. Comp. 21:1967;543-560.
14. Foster L. V. Generalizations of Laguerre's method: Higher order methods. SIAM J. Numer. Anal. 18:1981;1004-1018.
15. Gargantini I., Henrici P. Circular arithmetic and determination of polynomial zeros. Numer. Math. 18:1972;305-320.
16. Golub G. H., Van Loan C. F. Matrix Computations. 1996;Johns Hopkins Univ. Press, Baltimore.
17. Goedecker S. Remark on algorithms to find roots of polynomials. SIAM J. Sci. Comput. 15:1994;1059-1063.
18. Graham R. L. An efficient algorithm for determining the convex hull of a finite planar set. Inform. Process. Lett. 1:1972;132-133.
19. Grau A. A. The simultaneous improvement of a complete set of approximate factors of a polynomial. J. Numer. Anal. 8:1971;425-438.
20. Greengard L. Rapid Evaluation of Potential Fields in Particle Systems. 1988;MIT Press, Cambridge.
21. Householder A. S. The Numerical Treatment of a Single Nonlinear Equation. 1970;McGraw-Hill, New York.
22. Hager W. A modified fast fourier transform for polynomial evaluation and the Jenkins-Traub algorithm. Numer. Math. 50:1987;253-261.
23. Henrici P. Applied and Computational Complex Analysis. 1974;Wiley, New York.
24. Hansen E., Patrick M., Rusnack J. Some modifications of Laguerre's method. BIT. 17:1977;409-417.
25. IMSL User's Manual. 1987.
26. Jenkins M. A., Traub J. F. A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration. Numer. Math. 14:1970;252-263.
27. Jenkins M. A., Traub J. F. Algorithm 419: Zeros of a complex polynomial. Comm. ACM. 15:1972;97-99.
28. Kerner I. O. Ein Gesamtschritterfahren zur Berechnung de Nullstellen von Polynomen. Numer. Math. 8:1966;290-294.
29. Kirrinnis P. Partial fraction decomposition in C(z) and simultaneous Newton's iteration for factorization in C[z]. J. Complexity. 14:1998;378-444.
30. Karatsuba A., Ofman Yu. Multiplication of multidigit numbers on automata. Soviet Phys. Dokl. 7:1963;595-596.
31. Kim M.-H., Sutherland S. Polynomial root-finding algorithms and branched covers. SIAM J. Comput. 23:1994;415-436.
32. Lehmer D. H. A machine model for solving polynomial equations. J. ACM. 8:1961;151-162.
33. Madsen K. A root-finding algorithm based on Newton's method. BIT. 13:1973;71-75.
34. Marden M. The Geometry of the Zeros of a Polynomial in a Complex Variable. Amer. Math. Soc. Surv. III:1949;Amer. Math. Soc. New York.
35. McNamee J. M. A bibliography on roots of polynomials. J. Comput. Appl. Math. 47:1993;391-394.
36. Madsen K., Reid J. Report HL75/1172(C.13), Computer Science and Systems Division. 1975.
37. NAG Fortran Library Manual. 1988.
38. FRISCO - A Framework for Integrated Symbolic Numerical Computation. 1996;The Numerical Algorithms Group Ltd.
39. Ostrowski A. Recherches sur la Méthode de Graeffe et les Zéros des Polynomes et de Series de Laurent. Acta Math. 72:1940;99-257.
40. Pan V. Y. Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials. Proc. 26th Ann. IEEE Symp. on Foundation of Computer Science. 1985;IEEE Press, New York. p. 522-531.
41. Pan V. Y. Sequential and parallel complexity of approximate evaluation of polynomial zeros. Comput. Math. Appl. 14:1987;591-622.
42. Pan V. Y. Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros. Comput. Math. Appl. 17:1989;1475-1480.
43. Pan V. Y. Complexity of computations with matrices and polynomials. SIAM Rev. 34:1992;225-262.
44. Pan V. Y. Tech. Rep. 1993.
45. Pan V. Y. New techniques for approximating complex polynomial zeros. Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms. 1994;ACM Press, New York. p. 260-270.
46. Pan V. Y. Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros. Proc. 27th Ann. ACM Symp. on Theory of Computing. 1995;ACM Press, New York. p. 741-750.
47. Pan V. Y. Weyl's quadtree algorithm for the unsymmetric eigenvalue problem. Appl. Math. Lett. 8:1995;87-88.
48. Pan V. Y. Optimal and nearby optimal algorithms for approximating polynomial zeros. Comput. Math. Appl. 31:1996;97-138.
49. Pan V. Y. Research Report. 1996.
50. Pan V. Y. Solving a polynomial equation: some history and recent progress. SIAM Rev. 39:1997;187-220.
51. Pan V. Y., Chen Z. The complexity of the algebraic eigenproblem. Proc. 31st Ann. Symp. on Theory of Computing (STOC99). 1999;ACM Press, New York.
52. Pan V. Y., Kim M.-h., Sadikou A., Huang X., Zheng A. On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors. J. Complexity. 12:1996;572-594.
53. Pan V. Y., Linzer E. Bisection acceleration for the symmetric eigenvalue problem. Numer. Algorithms. 22:1999;13-39.
54. Preparata F. P., Shamos M. I. Computational Geometry: An Introduction, Texts and Monographs in Computer Science. 1985;Springer-Verlag, New York.
55. Renegar J. On the worst-case arithmetic complexity of approximation zeros of polynomials. J. Complexity. 3:1987;90-113.
56. Renegar J., Shub M. Unified complexity analysis for Newton LP methods. Math. Programming. 53:1992;1-16.
57. Samet H. The quadtree and related hierarchical data structures. Comput. Surveys. 16:1984;187-260.
58. A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Manuscript, Dept. of Math. Univ. of Tübingen, Tübingen, Germany, 1982.
59. Schröder J. Über das Newtonsche Verfahren. Arch. Rational Mech. Anal. 1:1957;154-180.
60. Senoussi H. A quadtree algorithm for template matching on pyramid computer. Theoret. Comput. Sci. 136:1994;387-417.
61. Sebastiao e Silva J. Sur une Méthode d'Approximation Semblable à Celle de Graeffe. Portugal Math. 2:1941;271-279.
62. Shub M., Smale S. Complexity of Bezout's theorem. I. Geometric aspects. J. Amer. Math. Soc. 6:1993;459-501.
63. Shub M., Smale S. Complexity of Bezout's theorem. II. Volumes and probabilities. Eyssette F., Galligo A. Computational Algebraic Geometry. Progress in Mathematics. 109:1993;267-285 Birkhäuser, Basel.
64. Shub M., Smale S. Complexity of Bezout's theorem. III. Condition number and packing. J. Complexity. 9:1993;4-14.
65. Shub M., Smale S. Complexity of Bezout's theorem. IV. Probability of success, extensions. SIAM J. Numer. Anal. 33:1996;128-148.
66. Shub M., Smale S. Complexity of Bezout's theorem. V. Polynomial time. Theoret. Comput. Sci. 133:1994;141-164.
67. Turan P. On a New Method of Analysis and Its Application. 1984;Wiley, New York.
68. Uhlig F. The DQR algorithm, basic theory, convergence and conditional stability. Numer. Math. 76:1997;515-553.
69. Weierstrass K. Neuer Beweis des Fundamentalsatzes der Algebra. Mathematische Werker. III:1903;Mayer und Mueller, Berlin. p. 251-269.
70. Weyl H. Randbemerkungen zu Hauptproblemen der Mathematik. II. Fundamentalsatz der Algebra and Grundlagen der Mathematik. Math. Z. 20:1924;131-151.