EVALUATING RATIONAL FUNCTIONS - INFINITE PRECISION IS FINITE COST AND TRACTABLE ON AVERAGE

被引:8
作者
BLUM, L
SHUB, M
机构
[1] UNIV CALIF BERKELEY,DEPT MATH,BERKELEY,CA 94720
[2] CUNY,GRAD CTR,NEW YORK,NY 10036
[3] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
关键词
MATHEMATICAL TECHNIQUES - Function Evaluation;
D O I
10.1137/0215026
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
If one is interested in the computational complexity of problems whose natural domain of discourse is the reals, then one is led to ask: what is the 'cost' of obtaining solutions to within a prescribed absolute accuracy epsilon equals 1/2**s (or precision s equals minus log//2 epsilon )? The loss of precision intrinsic to solving a problem, independent of method of solution, gives a lower bound on the cost. It also indicates how realistic it is to assume that basic (arithmetic) operations are exact and/or take one step for complexity analyses. For the relative case, the analogous notion is the loss of significance. Some of these questions are addressed with regard to the problem of evaluating rational functions.
引用
收藏
页码:384 / 398
页数:15
相关论文
共 18 条
[1]  
Borodin A., 1975, COMPUTATIONAL COMPLE
[2]  
Federer H., 1969, GRUNDLEHREN MATH WIS
[3]  
HARDT R, 1981, DIFFERENTIAL GEOMETR, P259
[4]  
Henrici P., 1982, ESSENTIALS NUMERICAL
[5]  
KIM MH, THESIS
[6]  
Knuth D. E., 1981, ART COMPUTER PROGRAM, V2
[7]   COMPUTATIONAL-COMPLEXITY OF REAL FUNCTIONS [J].
KO, KI ;
FRIEDMAN, H .
THEORETICAL COMPUTER SCIENCE, 1982, 20 (03) :323-352
[8]  
KOSTLAN E, ESTIMATES NUMERICAL
[9]  
MOLER CB, 1978, NUMERICAL ANAL, V22, P1
[10]  
OCNEANU A, LOSS PRECISION SOLVI