Accession Number:

AD0760005

Title:

Computational Complexity of One-Point and Multipoint Iteration,

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1973-04-01

Pagination or Media Count:

24.0

Abstract:

Let phi be an iteration for approximating the solution of a problem f. A new efficiency measure ephi,f is defined. For a given problem f, the authors define the optimal efficiency Ef and establish lower and upper bounds for Ef with respect to different families of iterations. An upper bound on Ef is conjectured for any iteration without memory. Author

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE