Newton’s Method Estimates from Data at One Point
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.
Unable to display preview. Download preview PDF.
- M. Kim, Ph.D. Thesis, City University of New York, to appear, 1985.Google Scholar
- Ostrowski, Solutions of Equations in Euclidean and Banach Spaces, Academic Press, New York, 1973.Google Scholar
- 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.Google Scholar