On approximate zeros and rootfinding algorithms for a complex polynomial

Author:
Myong-Hi Kim

Journal:
Math. Comp. **51** (1988), 707-719

MSC:
Primary 65H05; Secondary 30C15, 65E05

DOI:
https://doi.org/10.1090/S0025-5718-1988-0958638-1

MathSciNet review:
958638

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper we give criteria for a complex number to be an approximate zero of a polynomial *f* for Newton's method or for the *k*th-order Euler method. An approximate zero for the *k*th-order Euler method is an initial point from which the method converges with an order Also, we construct families of Newton (and Euler) type algorithms which are surely convergent.

**[1]**L. V. Ahlfors,*Complex Analysis*, International Series in Pure and Applied Math., 1979. MR**510197 (80c:30001)****[2]**L. De Branges, "A proof of the Bieberbach conjecture,"*Acta Math.*, v. 154, 1985, pp. 137-152. MR**772434 (86h:30026)****[3]**P. Henrici,*Applied and Computational Complex Analysis*, Wiley, New York, 1977. MR**0372162 (51:8378)****[4]**E. Hille,*Analytic Function Theory*, Ginn, Boston, Mass., 1962. MR**0201608 (34:1490)****[5]**M. Kim,*Computational Complexity of the Euler Type Algorithms for the Roots of Complex Polynomials*, Thesis, City University of New York, 1985.**[6]**M. Kim, "Improved criteria for an approximate zero and experimental results on the polynomial root finding problem," in preparation.**[7]**M. Marden,*Geometry of Polynomials*, Math. Surveys, No. 3, Amer. Math. Soc., Providence, R. I., 1966. MR**0225972 (37:1562)****[8]**C. McMullen, "Families of rational maps and iterative root-finding algorithms,"*Ann. of Math.*, v. 125, 1987, pp. 467-494. MR**890160 (88i:58082)****[9]**M. Shub & S. Smale, "Computational complexity: On the geometry of polynomials and a theory of cost; Part I,"*Ann. Sci. École Norm. Sup. Ser.*(4), v. 18, 1985, pp. 107-142. MR**803197 (87m:68043)****[10]**M. Shub & S. Smale, "Computational complexity: On the geometry of polynomials and a theory of cost; Part II,"*SIAM J. Comput.*, v. 15, 1986, pp. 145-161. MR**822199 (87m:68044)****[11]**M. Shub & S. Smale, "On the existence of generally convergent algorithms,"*J. of Complexity*, v. 2, 1986, pp. 2-11. MR**925341 (89d:65054)****[12]**S. Smale, "The fundamental theorem of algebra and complexity theory,"*Bull. Amer. Math. Soc.*, v. 4, 1981, pp. 1-36. MR**590817 (83i:65044)****[13]**S. Smael, "On the efficiency of algorithms of analysis,"*Bull. Amer. Math. Soc.*, v. 13, 1985, pp. 87-121. MR**799791 (86m:65061)****[14]**S. Smale, "Newton's method estimates from data at one point,"*The Merging Disciplines*:*New Directions in Pure, Applied and Computational Mathematics*, pp. 185 196, Springer-Verlag, 1986. MR**870648 (88e:65076)**

Retrieve articles in *Mathematics of Computation*
with MSC:
65H05,
30C15,
65E05

Retrieve articles in all journals with MSC: 65H05, 30C15, 65E05

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1988-0958638-1

Article copyright:
© Copyright 1988
American Mathematical Society