Computational Complexity of One-Point and Multipoint Iteration,
Abstract
Let phi be an iteration for approximating the solution of a problem f. A new efficiency measure e(phi,f) is defined. For a given problem f, the authors define the optimal efficiency E(f) and establish lower and upper bounds for E(f) with respect to different families of iterations. An upper bound on E(f) is conjectured for any iteration without memory. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1973
- Accession Number
- AD0760005
Entities
People
- H. T. Kung
- Joseph F. Traub
Organizations
- Carnegie Mellon University