Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra

Electronic Notes in Theoretical Computer Science

Volumn 202, Issue C, 2008, Pages 201-218

  Batra, Prashant ^a  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

constructive proofs; factorization approach; global methods; Subdivision schemes

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; FACTORIZATION; PROBABILISTIC LOGICS; THEOREM PROVING;

ALGEBRAIC NEWTON ITERATION; CONSTRUCTIVE PROOFS; FACTORIZATION APPROACH; FUNDAMENTAL THEOREM OF ALGEBRA; GLOBAL METHODS; PROBABILISTIC CONVERGENCE; SUBDIVISION SCHEMES;

NEWTON-RAPHSON METHOD;

EID: 40749087101     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.03.016     Document Type: Article

References (32)

1. Batra P. Improvement of a convergence condition for the Durand-Kerner iteration. JCAM 96 (1998) 117-125
2. Bhatia R., Elsner L., and Krause G. Bounds for the Variation of the Roots of a Polynomial and the Eigenvalues of a Matrix. Linear Algebra and its Applications 142 (1990) 195-209
3. Buckholtz J.D. Sums of powers of complex numbers. J. Math. Anal. Apl. 17 (1967) 269-279
4. Bugeaud Y., and Mignotte M. On the distance between roots of integer polynomials. Proc. Edinburgh Mathematical Society 47 (2004) 553-556
5. e série, reprint of 1897 edition
6. Gargantini I., and Henrici P. Circular arithmetic and the determination of polynomial zeros. Numerische Mathematik 18 (1972) 305-320
7. Hirsch M.W., and Smale S. On Algorithms for Solving f (x) = 0. Communications on Pure and Applied Mathematics XXXII (1979) 281-312
8. Kirrinnis P. Partial Fraction Decomposition in C (z) and Simultaneous Newton Iteration for Factorization in C [z]. Journal of Complexity 14 (1998) 378-444
9. Kneser H. Der Fundamentalsatz der Algebra und der Intuitionismus. Math. Zeitschrift 46 (1940) 287-302
10. Kneser M. Ergänzung zu einer Arbeit von Hellmuth Kneser über den Fundamentalsatz der Algebra. Math. Zeitschrift 177 (1981) 285-287
11. Landau E. Sur quelques théorèmes de M. Pétrovitch relatifs aux zéros des fonctions analytiques. Bull. Soc. Math. Franc. 33 (1905) 251-261
12. Lehmer D.H. A machine method for solving polynomial equations. Journal of the ACM 8 (1961) 151-162
13. Mahler K. An inequality for the discriminant of a polynomial. Michigan Math. Journal 11 (1964) 257-262
14. McMullen C. Families of rational maps and iterative root-finding algorithms. Annals of Mathematics 125 (1987) 467-493
15. Neff C.A., and Reif J.H. An efficient algorithm for the complex roots problem. Journal of Complexity 12 (1996) 81-115
16. Netto E. Die vier Gauss'schen Beweise für die Zerlegung ganzer algebraischer Funktionen in reelle Factoren ersten oder zweiten Grades (1799-1849). OSTWALD's KLASSIKER DER EXAKTEN WISSENSCHAFTEN. 3rd edition volumeno 14 (1913), Verlag von Wilhelm Engelmann, Leipzig und Berlin Akademische Verlagsgesellschaft m.b.H. in Leipzig
17. Ostrowski A. Solution of Equations in Euclidean and Banach Spaces (1973), Academic Press, New York
18. Pan V.Y. New techniques for approximating complex zeros. Proeedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Va. (1994), ACM 260-270
19. Pan V.Y. Solving a polynomial equation: Some history and recent progress. SIAM Review 39 2 (1997) 187-220
20. Pan, V.Y. On approximating complex polynomial zeros: Modified quadtree (Weyl's) construction and improved Newton's iteration. Technical Report 2894, INRIA, Sophia-Antipolis, 1996
21. Renegar J. On the efficiency of Newton's method in approximating all zeros of sytems of polynomials. Mathematics of Operations Research 12 (1987) 121-148
22. Renegar J. On the worst-case arithmetic complexity of approximating zeros of polynomials. Journal of Complexity 13 (1987) 90-113
23. Rheinboldt W.C. On a theorem of S. Smale about Newton's method for analytic mappings. Appl. Math. Lett. 1 1 (1988) 69-72
24. Schönhage A. The fundamental theorem of algebra in term of computational complexity. !Preliminary report, URL: (August 1982). http://www.informatik.uni-bonn.de/~schoe/fdthmrep.ps.gz
25. Sendov Bl., Andreev A., and Kjurkchiev N. Numerical solution of polynomial equations. In: Ciarlet P.G., and Lions J.L. (Eds). Handbook of Numerical Analysis volumeno III (1994), Elsevier Science, Amsterdam 625-778
26. Shub M., and Smale S. Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II. SIAM J. Computing 15 1 (1986) 145-161
27. Shub M., and Smale S. Complexity of Bezout's Theorem. I: Geometric Aspects. Journal of the AMS 6 2 (1993) 459-501
28. Smale S. The Fundamental Theorem of Algebra and Complexity Theory. Bull. AMS (N.S.) 4 1 (1981) 1-36
29. Smale S. On the Efficiency of Algorithms of Analysis. Bull. AMS (N.S.) 13 2 (1985) 87-121
30. Tilli P. Polynomial root finding by means of continuation. Computing 59 4 (1997) 307-324
31. Wang X., Shen G., and Han D. Some Remarks on Smale's "Algorithms for Solving Equations". Acta Mathematica Sinica, New Series 8 4 (1992) 337-348
32. Yap C.K. Fundamental Problems of Algorithmic Algebra (2000), Oxford University Press, New York, N.Y.