The Complexity of Obtaining Starting Points for Solving Operator Equations by Newton's Method.
Abstract
The complexity of searching for good starting points for iterations is studied. Global and non-asymptotic results are obtained: A useful lemma for proving lower bounds is identified, several optimal results are given for scalar equations, and upper bounds for operator equations are established by a new procedure for obtaining starting points for Newton's method.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1975
- Accession Number
- ADA020208
Entities
People
- H. T. Kung
Organizations
- Carnegie Mellon University