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. © J.C. Baltzer AG, Science Publishers.
Separable asymptotic cost of evaluating elementary functions
Favati Paola;
2000
Abstract
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. © J.C. Baltzer AG, Science Publishers.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
