Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Approximate zeros of quadratically convergent algorithms

Author: Pengyuan Chen
Journal: Math. Comp. 63 (1994), 247-270
MSC: Primary 65H05; Secondary 65E05, 65Y20
MathSciNet review: 1240655
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Smale's condition for a point to be an approximate zero of a function for Newton's method is extended to the general quadratically convergent iterative algorithm. It is shown in which way the bound in the condition is affected by the characteristics of the algorithm. This puts the original condition of Smale for Newton's method in a more general perspective. The results are also discussed in the light of numerical evidence.

References [Enhancements On Off] (What's this?)

  • [1] J. H. Curry, On zero finding methods of higher order from data at one point, J. Complexity 5 (1989), 219-237. MR 1006107 (91a:65134)
  • [2] J. H. Curry and E.S. Van Vleck, On the theory and computation of approximate zeros, preprint.
  • [3] M. Kim, On approximate zeros and rootfinding algorithms for a complex polynomial, Math. Comp. 51 (1988), 707-719. MR 958638 (90f:65073)
  • [4] M. Shub and S. Smale, Computational complexity: on the geometry of polynomials and a theory of costs. I, Ann. Sci. École Norm. Sup. (4) 18 (1985), 107-142. MR 803197 (87m:68043)
  • [5] -, Computational complexity: on the geometry of polynomials and a theory of costs. II, SIAM J. Comput. 15 (1986), 145-161. MR 822199 (87m:68044)
  • [6] S. Smale, The fundamental theorem of algebra and complexity theory, Bull. Amer. Math. Soc. (N.S.) 4 (1981), 1-36. MR 590817 (83i:65044)
  • [7] -, On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. (N.S.) 13 (1985), 87-121. MR 799791 (86m:65061)
  • [8] -, Newton's method estimates from data at one point, The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics (Richard E. Ewing, Kenneth I. Gross, and Clyde F. Martin, eds.), Springer-Verlag, 1986, pp. 185-196.
  • [9] -, Algorithms for solving equations, Proc. Internat. Congr. Math. (Berkeley, CA, 1986), Amer. Math. Soc., Providence, RI, 1987, pp. 172-195. MR 934223 (89d:65060)
  • [10] W.C. Rheinboldt, On a theorem of S. Smale about Newton's method for analytic mappings, Appl. Math. Lett. 1 (1988), 69-72. MR 947170 (89h:65079)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65H05, 65E05, 65Y20

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

Additional Information

Article copyright: © Copyright 1994 American Mathematical Society

American Mathematical Society