Abstract
Newton’s method and its modifications have long played a central role in finding solutions of non-linear equations and systems. The work of Kantorovich has been seminal in extending and codifying Newton’s method. Kantorovich’s approach, which dominates the literature in this area, has these features: (a) weak differentiability hypotheses are made on the system, e.g., the map is C 2 on some domain in a Banach space; (b) derivative bounds are supposed to exist over the whole of this domain. In contrast, here strong hypotheses on differentiability are made; analyticity is assumed. On the other hand, we deduce consequences from data at a single point. This point of view has valuable features for computation and its theory. Theorems similar to ours could probably be deduced with the Kantorovich theory as a starting point; however, we have found it useful to start afresh.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Dieudonné, Foundations of Modern Analysis, Academic Press, New York, 1960.
W. Gregg and R. Tapia, “Optimal error bounds for the Newton-Kantorovich theorem,” SIAM J. Numer. Anal., 11 (1974), 10–13.
L. Kantorovich and G. Akilov, Functional Analysis in Normed Spaces, MacMillan, New York, 1964.
M. Kim, Ph.D. Thesis, City University of New York, to appear, 1985.
S. Lang, Real Analysis, Addison-Wesley, Reading, Massachusetts, 1983.
Ostrowski, Solutions of Equations in Euclidean and Banach Spaces, Academic Press, New York, 1973.
L. Rail, “A note on the convergence of Newton’s method,” SIAM J. Numer. Anal, 11 (1974), 34–36.
J. Renegar, “On the efficiency of Newton’s method in approximating all zeroes of a system of complex polynomials,” Mathematics of Operations Research, to appear.
M. Shub and S. Smale, “Computational complexity: on the geometry of polynomials and a theory of cost, part I,” Ann. Sci. Ecole Norm. Sup. 4 serie t, 18 (1985), 107–142.
M. Shub and S. Smale, “Computational complexity: on the geometry of polynomials and a theory of cost, part II,” SIAM J. Computing, 15 (1986), 145–161.
S. Smale, “The fundamental theorem of algebra and complexity theory,” Bull. Amer. Math. Soc. (N.S.), 4 (1981), 1–36.
S. Smale, “On the efficiency of algorithms of analysis,” Bull. Amer. Math. Soc. (N.S.), 13 (1985), 87–121.
J. Traub and H. Wozniakowski, “Convergence and complexity of Newton iteration for operator equations,” J. Assoc. Comp. Mach., 29 (1979), 250–258.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
In honor of Gail Young
Rights and permissions
Copyright information
© 1986 Springer-Verlag New York Inc.
About this paper
Cite this paper
Smale, S. (1986). Newton’s Method Estimates from Data at One Point. In: Ewing, R.E., Gross, K.I., Martin, C.F. (eds) The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4984-9_13
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4984-9_13
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9385-9
Online ISBN: 978-1-4612-4984-9
eBook Packages: Springer Book Archive