Provider: ingentaconnect
Database: ingentaconnect
Content: application/x-research-info-systems
TY - ABST
AU - Favati, P.
AU - Lotti, G.
AU - Menchi, O.
AU - Romani, F.
TI - Separable asymptotic cost of evaluating elementary functions
JO - Numerical Algorithms
PY - 2000-03-01T00:00:00///
VL - 24
IS - 3
SP - 255
EP - 274
KW - 65Y20
KW - complexity and performance of numerical algorithms
KW - elementary functions
N2 - The computational cost, in the bit model of computation, of the evaluation of a real function f(x) in a point x is analyzed, when the number d of correct digits of the result increases asymptotically. We want to study how the cost depends on x also when x approaches a critical point for the function f. We investigate the hypotheses under which it is possible to give upper bounds on the cost as functions of “separated variables” d and x, that is as products of two functions, each of one variable. We examine in particular the case of elementary functions.
UR - http://www.ingentaconnect.com/content/klu/numa/2000/00000024/00000003/00329397
ER -