
Accession Number : AD0760005
Title : Computational Complexity of OnePoint and Multipoint Iteration,
Corporate Author : CARNEGIEMELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Personal Author(s) : Kung,H. T. ; Traub,J. F.
Report Date : APR 1973
Pagination or Media Count : 24
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)
Descriptors : (*ITERATIONS, THEOREMS), INTERPOLATION, APPROXIMATION(MATHEMATICS), TRANSCENDENTAL FUNCTIONS, ANALYTIC FUNCTIONS, COMPUTER PROGRAMMING, EFFICIENCY
Subject Categories : Numerical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE