Solving a polynomial equation: Some history and recent progress

SIAM Review

Volumn 39, Issue 2, 1997, Pages 187-220

  Pan, Victor Y ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Complex polynomial zeros; Computer algebra; Divide and conquer algorithms; Fundamental theorem of algebra; Numerical approximation; Polynomial equation; Weyl's quadtree algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLES AND ZEROS; PROBLEM SOLVING;

COMPLEX POLYNOMIAL ZEROS; DIVIDE AND CONQUER ALGORITHM; WEYL'S QUADTREE ALGORITHM;

POLYNOMIALS;

EID: 0031169815     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144595288554     Document Type: Article

References (120)

1. O. ABERTH, Iteration methods for finding all zeros of a polynomial simultaneously, Math. Comp., 27 (1973), pp. 339-344.
2. E. D. ANGELOVA AND K. I. SEMERDZIEV, Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations, USSR Comput. Math. and Math. Phys., 22 (1982), pp. 226-232.
3. L. E. J. BROUWER AND B. DE LOER, Intuitionisher Beweis des Fundamentalsatzes der Algebra, Amsterdam Konigl. Acad. Van Wetenschapen, Proc., 27 (1924), pp. 186-188 (also in L. E. J. Brouwer, Coll. Works, North-Holland, Amsterdam, 1975).
4. L. E. J. BROUWER AND B. DE LOER, Intuitionisher Beweis des Fundamentalsatzes der Algebra, Amsterdam Konigl. Acad. Van Wetenschapen, Proc., 27 (1924), pp. 186-188 (also in L. E. J. Brouwer, Coll. Works, North-Holland, Amsterdam, 1975).
5. E. T. BELL, The Development of Mathematics, McGraw-Hill, New York, 1940.
6. M. BEN-OR, E. FEIG, D. KOZEN, AND P. TIWARI, A fast parallel algorithm for determining all roots of a polynomial with real roots, SIAM J. Comput., 17 (1988), pp. 1081-1092.
7. D. BINI AND L. GEMIGNANI, On the complexity of polynomial zeros, SIAM J. Comput., 21 (1992) pp. 781-799.
8. D. BINI, Complexity of parallel polynomial computations, in Proc. Parallel Computing: Methods, Algorithms, Applications, J. Evans and C. Nodari, eds., Adam Hilger, Bristol, 1989, pp. 115-126.
9. D. BINI, Numerical computation of polynomial zeros by Aberth's method, Numer. Algorithms, to appear.
10. C. A. BOYER, A History of Mathematics, Wiley, New York, 1968.
11. J. R. BUNCH, C. P. NIELSEN, D. C. SORENSEN, Rank-one modification of the symmetric eigenproblem, Numer. Math., 31 (1978), pp. 31-48.
12. D. BINI AND V. Y. PAN, Parallel complexity of tridiagonal symmetric eigenvalue problems, in Proc. 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM Press, New York and SIAM, Philadelphia, PA, 1991, pp. 384-393.
13. D. BINI AND V. Y. PAN, Practical improvement of the divide-and-conquer eigenvalue algorithms, Computing, 48 (1992), pp. 109-123.
14. D. BINI AND V. Y. PAN, Polynomial and Matrix Computations, v. 1: Fundamental Algorithms, Birkhäuser Boston, Cambridge, MA, 1994.
15. D. BINI AND V. Y. PAN, Graeffe's, Chebyshev-like and Cardinal's processes for splitting a polynomial into factors, J. Complexity, 12 (1996), pp. 492-511.
16. D. BINI AND V. Y. PAN, Polynomial and Matrix Computations, v. 2: Selected Topics, Birkhäuser Boston, Cambridge, MA, to appear.
17. D. BINI AND V. Y. PAN, Computing matrix eigenvalues and polynomial zeros where the output is real, SIAM J. Comput., to appear.
18. W. BOERSCH-SUPAN, A priori error bounds for the zeros of polynomials, Numer. Math., (1963), pp. 380-398.
19. M. BEN-OR AND P. TIWARI, Simple algorithm for approximating all roots of a polynomial with real roots, J. Complexity, 6 (1990) pp. 417-442.
20. J. J. M. CUPPEN, A divide-and-conquer method for the symmetric tridiagonal eigenproblem, Numer. Math., 36 (1981), pp. 177-195.
21. J. F. CANNY, E. KALTOFEN, AND Y. LAKSHMAN, Solving systems of non-linear polynomial equations faster, in Proc. Ann. ACM-SIGSAM Intern. Symp. on Symbolic and Algebraic Comput. (ISSAC '89), ACM Press, New York, 1989, pp. 121-128.
22. D. COPPERSMITH AND C.A. NEFF, Roots of a polynomial and its derivatives, in Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM Press, New York and SIAM, Philadelphia, PA, 1994, pp. 271-279.
23. E. DURAND, Solutions Numeriques des Equations Algebriques, Tome I: Equations du Type F(x) = 0: Racines d'un Polynome, Masson, Paris, 1960.
24. K. DOCHEV AND P. BYRNEV, Certain modifications of Newton's method for the approximate solution of algebraic equations, Zhournal Vychisl. Mat. i Mat. Phiziki, 4 (1964), pp. 915-920 (in Russian).
25. B. DEJON AND P. HENRICI, EDS., Constructive Aspects of the Fundamental Theorem of Algebra, John Wiley, London, 1969.
26. L. M. DELVES AND J. N. LYNESS, A numerical method for locating zeros of an analytic function, Math. Comp., 21 (1967), pp. 543-560.
27. J. J. DONGARRA AND D. C. SORENSEN, A fully parallel algorithm for the symmetric eigenvalue problem, SIAM J. Sci. Stat. Comput., 8 (1987), pp. 139-154.
28. J. J. DONGARRA AND M. SIDANI, A parallel algorithm for the nonsymmetric eigenvalue problem, SIAM J. Sci. Comput., 14 (1993), pp. 542-269.
29. J.-P. DEDIEU AND J.-C. YAKOUBSOHN, Localization of an algebraic hypersurface and the exclusion algorithm, Appli. Algebra Engrg. Comm. Comput., 2 (1992), pp. 239-256.
30. L. W. ERLICH, A modified Newton method for polynomials, Communications ACM, 12 (1967), pp. 107-108.
31. I. Z. EMIRIS, On the complexity of sparse elimination, J. Complexity, 12 (1996), pp. 134-166.
32. H. EVES, An Introduction to the History of Mathematics, Saunders College Publishing, Philadelphia, PA, 1983.
33. C. ECKART AND G. YOUNG, A principal axis transformation for non-Hermitian matrices, Bull. Amer. Math. Soc. (N. S.), 45 (1939), pp. 118-121.
34. L. V. FOSTER, Generalizations of Laguerre's method: Higher order methods, SIAM J. Numer. Anal., 18 (1981), pp. 1004-1018.
35. M. R. FARMER AND G. LOIZOU, An algorithm for the total, or partial, factorization of a polynomial, Math. Proc. Cambridge Philos. Soc., 82 (1977), pp. 427-437.
36. C. F. GAUSS, Werke, Band X, Georg Olms Verlag, New York, 1973.
37. A. GEL'FOND, Differenzenrechnung, Deutscher Verlag Der Wissenschaften, Berlin, 1958 (Russian edition: Moscow, 1952).
38. L. GEMIGNANI, Polynomial root computation by means of the LR algorithm, BIT, submitted.
39. A. GOLDENSHLUGER, Nonparametric Estimation in Linear Dynamic Uncertain Systems, Ph.D. thesis, Technion Faculty of Industrial and Applied Engineering and Management, 1994.
40. S. GOEDECKER, Remark on algorithms to find roots of polynomials, SIAM J. Sci. Comput., 15 (1994), pp. 1059-1063.
41. W. B. GRAGG, The Padé table and its relation to certain algorithms of numerical analysis, SIAM Rev., 14 (1972), pp. 1-62.
42. A. A. GRAU, The simultaneous improvement of a complete set of approximate factors of a polynomial, J. Numer. Anal., 8 (1971), pp. 425-438.
43. L. GREENGARD, Rapid Evaluation of Potential Fields in Particle Systems, MIT Press, Cambridge, MA, 1988.
44. P. HENRICI, Applied and Computational Complex Analysis, 1, John Wiley, New York, 1974.
45. P. HENRICI AND I. GARGANTINI, Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial, (in [DH69]).
46. A. S. HOUSEHOLDER, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, 1970.
47. A. S. HOUSEHOLDER, Generalization of an algorithm of Sebastiao e Silva, Numer. Math., 16 (1971), pp. 375-382.
48. E. HANSEN, M. PATRICK, AND J. RUSNACK, Some modifications of Laguerre's method, BIT, 17 (1977), pp. 409-417.
49. IMSL User's Manual, version 1.0, chapter 7, 1987.
50. M. A. JENKINS AND J. F. TRAUB, A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration, Numer. Math., 14 (1970), pp. 252-263.
51. M. A. JENKINS AND J. F. TRAUB, Algorithm 419: Zeros of a complex polynomial, Comm. ACM, 15 (1972), pp. 97-99.
52. W. KAHAN, Numerical linear algebra, Canad. Math. Bull., 9 (1966), pp. 757-801.
53. I. O. KERNER, Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen, Numer. Math., 8 (1966), pp. 290-294.
54. P. KIRRINNIS, Polynomial factorization and partial fraction decomposition by simultaneous Newton's iteration, extended abstract, 1994, J. Complexity, submitted.
55. M. H. KIM, On approximate zeros and rootfinding algorithms for a complex polynomial, Math. Comp., 51 (1988), pp. 707-719.
56. D. KAPUR AND Y. N. LAKSHMAN, Elimination methods: An introduction, in Symbolic and Numerical Computation for Artificial Intelligence, B. Donald, D. Kapur, and J. Mundy, eds., Academic Press, New York, 1992, pp. 45-89.
57. D. E. KNUTH, The Art of Compupter Programming 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981 (new edition in 1997).
58. A. KARATSUBA AND YU. OFMAN, Multiplication of multidigit numbers on automata, Soviet Phys., Dokl., 7 (1963), pp. 595-596.
59. R. KARP AND V. RAMACHANDRAN, A survey of parallel algorithms for shared memory machines, Handbook for Theoretical Computer Science, J. van Leeuwen, ed., North-Holland, Amsterdam, 1990, pp. 869-941.
60. M.-H. KIM AND S. SUTHERLAND, Polynomial root-finding algorithms and branched covers, SIAM J. Comput., 23 (1994), pp. 415-436.
61. I. KUPKA, Die numerische Bestimmung mehrfacher und nahe benachbarter Polynomnullstellen nach einem Bernoulli- Verfahren, in Constructive Aspects of the Fundamental Theorem of Algebra, John Wiley, London, New York, 1974, pp. 181-191.
62. K. MADSEN, A root-finding algorithm based on Newton's method, BIT, 13 (1973), pp. 71-75.
63. H. MAHLEY, Zur Iterativen Auflösung Algebraisher Gleichungen, Z. Angew. Math. Physik, 5 (1954), pp. 260-263.
64. V. S. MILLER, Factoring polynomials via relation-finding, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 606 (1992), pp. 115-121.
65. J. M. MCNAMEE, A bibliography on roots of polynomials, J. Comput. Appl. Math., 47 (1993), pp. 391-394.
66. K. MADSEN AND J. REID, Fortran Subroutines for Finding Polynomial Zeros, Report HL75/1172 (C.13), Computer Science and Systems Division, A. E. R. E. Harwell, Oxford, 1975.
67. NAG Fortran Library Manual, Mark 13, Vol. 1, 1988.
68. C. A. NEFF, Specified precision polynomial root isolation is in NC, J. Comput. System Sci., 48 (1994), pp. 429-463.
69. O. NEUGEBAUER, The Exact Science in Antiquity, 2nd ed., Brown University Press, Providence, RI, 1957.
70. l+ε) algorithm for the complex root problem, in Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, 1994, pp. 540-547.
71. A. M. OSTROWSKI, Recherches sur la Méthode de Graeffe et les Zéros des Polynomes et des Series de Laurent, Acta Math., 72 (1940), pp. 99-257.
72. V. Y. PAN, Sequential and parallel complexity of approximate evaluation of polynomial zeros, Comput. and Math. (with Applications), 14 (1987), pp. 591-622.
73. V. Y. PAN, Algebraic complexity of computing polynomial zeros, Comput. and Math. (with Applications), 14 (1987), pp. 285-304.
74. V. Y. PAN, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, Comput. and Math. (with Applications), 17 (1989), pp. 1475-1480.
75. V. Y. PAN, Estimating the extremal eigenvalues of a symmetric matrix, Comput. and Math. (with Applications), 20 (1990), pp. 17-22.
76. V. Y. PAN, New techniques for approximating complex polynomial zeros, in Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM Press, New York and SIAM, Philadelphia, PA, 1994, pp. 260-270.
77. V. Y. PAN, New resultant inequalities and complex polynomial factorization, SIAM J. Comput., 23 (1994), pp. 934-950.
78. V. Y. PAN, Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros, in Proc. 27th Ann. ACM Symp. on Theory of Computing, ACM Press, New York, 1995, pp. 741-750.
79. V. Y. PAN, Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant, Comput. and Math. (with Applications), 30 (1995), pp. 71-94.
80. V. Y. PAN, Weyl's quadtree algorithm for the unsymmetric eigenvalue problem, Appl. Math. Lett., 8 (1995), pp. 87-88.
81. V. Y. PAN, Optimal and nearly optimal algorithms for approximating polynomial zeros, Comput. Math. Appl., 31 (1996), pp. 97-138.
82. V. Y. PAN, On Approximating Polynomial Zeros: Modified Quadtree (Weyl's) Construction and Improved Newton's Iteration, Research report 2894, INRIA, SophiaAntipolis, France, 1996.
83. V. Y. PAN, Numerical Computation of a Polynomial GCD and Extensions, Research report 2969, INRIA, Sophia-Antipolis, France, 1996.
84. n mod p(x) and an application to splitting a polynomial into factors over a fixed disc, J. Symbolic Comput., 22 (1996), pp. 377-380.
85. V. Y. PAN, Faster solution of the key equation for decoding the BCH error-correcting codes, in Proc. 29th Ann. ACM Symp. on Theory of Computing, ACM Press, New York, 1997.
86. V. Y. PAN AND J. DEMMEL, A new algorithm for the symmetric tridiagonal eigenvalue problem, J. Complexity, 9 (1993), pp. 387-405.
87. M. S. PETKOVIC AND L. V. STEFANOVIC, On some iteration function for the simultaneous computation of multiple complex polynomial zeros, BIT, 27 (1987), pp. 111-122.
88. V. Y. PAN, M.-H. KIM, A. SADIKOU, X. HUANG, AND A. ZHENG, On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors, J. Complexity, 12 (1996), pp. 572-594.
89. L. PASQUINI AND D. TRIGIANTE, A globally convergent method for simultaneously finding polynomial roots, Math. Comp., 44 (1985), pp. 135-149.
90. M. J. QUINN, Parallel Computing: Theory and Practice, McGraw-Hill, New York, 1994.
91. J. RENEGAR, On the worst-case arithmetic complexity of approximating zeros of polynomials, J. Complexity, 3 (1987), pp. 90-113.
92. J. RENEGAR, On the worst case arithmetic complexity of approximating zeros of systems of polynomials, SIAM. J. Comput., 18 (1989), pp. 350-370.
93. J. RENEGAR, On the computational complexity and geometry of the first order theory of reals, J. Symbolic Comput., 13 (1992), pp. 255-352.
94. J. RENEGAR AND M. SHUB, Unified complexity analysis for Newton LP methods, Math. Programming, 53 (1992), pp. 1-16.
95. H. SAMET, The quadtree and related hierarchical data structures, Comput. Surveys, 16 (1984), pp. 187-260.
96. A. SCHÖNHAGE, The Fundamental Theorem of Algebra in Terms of Computational Complexity, Math. Dept., University of Tübingen, Tübingen, Germany, manuscript.
97. A. SCHÖNHAGE, Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 172 (1984), pp. 436-447.
98. A. SCHÖNHAGE AND V. STRASSEN, Schnelle Multiplikation grosse Zahlen, Computing, 7 (1971), pp. 281-292.
99. J. SCHRÖDER, Uber das Newtonsche Verfahren, Arch. Rational Mech. Anal., 1 (1957), pp. 154-180.
100. H. SENOUSSI, A quadtree algorithm for template matching on pyramid computer, Theory Comp. Sci., 136 (1994), pp. 387-417.
101. J. SEBASTIAO E SILVA, Sur une Méthode d' Approximation Semblable à Celle de Graeffe, Portugal Math., 2 (1941), pp. 271-279.
102. S. SMALE, The fundamental theorem of algebra and complexity theory, Bull. Amer. Math. Soc., 4 (1981), pp. 1-36.
103. S. SMALE, On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc., 13 (1985), pp. 87-121.
104. S. SMALE, Newton's method estimates from data at one point, in The Merging of Disciplines: New Directions in Pure, Applied and Computational Mathematics, R. Ewing, K. Gross, and G. Martin, eds., Springer-Verlag, New York, 1986, pp. 185-196.
105. M. SHUB AND S. SMALE, Complexity of Bezout's theorem I: Geometric aspects, J. Amer. Math. Soc., 6 (1993), pp. 459-501.
106. M. SHUB AND S. SMALE, Complexity of Bezout's theorem II: Volumes and probabilities, Computational Algebraic Geometry, F. Eyssette and A. Galligo, eds., Progress in Mathematics 109, Birkhäuser, 1993, pp. 267-285.
107. M. SHUB AND S. SMALE, Complexity of Bezout's theorem III: Condition number and packing, J. Complexity, 9 (1993), pp. 4-14.
108. M. SHUB AND S. SMALE, Complexity of Bezout's theorem IV: Probability of success, extensions, SIAM J. Numer. Anal., to appear.
109. M. SHUB AND S. SMALE, Complexity of Bezout's theorem V: Polynomial time, Theoret. Comput. Sci., 133 (1994), pp. 141-164.
110. A. L. TOOM, The complexity of a scheme of functional elements realizing the multiplication of integers, Soviet Math. Dokl., 3 (1963), pp. 714-716.
111. K.-C. TOH AND L. N. TREFETHEN, Pseudozeros of polynomials and pseudospectra of companion matrices, Numer. Math., 68 (1994), pp. 403-425.
112. P. TURAN, On the approximate solution of algebraic functions, Comm. Math. Phys. Class Hung. Acad., XVIII (1968), pp. 223-236.
113. P. TURAN, Power sum method and approximative solution of algebraic equations, Math. Comp., 29 (1975), pp. 311-318.
114. P. TURAN, On a New Method of Analysis and Its Applications, John Wiley, New York, 1984.
115. A. VAN DER SLUIS, Upper bounds for roots of polynomials, Numer. Math., 15 (1970), pp. 250-262.
116. B. L. VAN DER WAERDEN, Modern Algebra, Frederick Ungar Publishing Co., New York, 1953.
117. K. WEIERSTRASS, Neuer Beweis des Fundamentalsatzes der Algebra, Mathematische Werker, Tome III, Mayer und Mueller, Berlin, 1903, pp. 251-269.
118. H. WEYL, Randbemerkungen zu Hauptproblemen der Mathematik, II, Fundamentalsatz der Algebra and Grundlagen der Mathematik, Math. Z., 20 (1924), pp. 131-151.
119. W. WERNER, On the simultaneous determination of polynomial roots, Lecture Notes in Math., Springer-Verlag, Berlin, 953 (1982), pp. 188-202.
120. H. S. WILF, A global bisection algorithm for computing the zeros of polynomials in the complex plane, J. ACM, 25 (1978), pp. 415-420.