Separable asymptotic cost of evaluating elementary functions

作     者：Favati, P Lotti, G Menchi, O Romani, F 

作者机构：Univ Pisa Dipartimento Informat I-56100 Pisa Italy CNR IMC I-56010 Pisa Italy Univ Parma Dipartimento Matemat I-43100 Parma Italy 

出 版 物：《NUMERICAL ALGORITHMS》 (数值算法)

年 卷 期：2000年第24卷第3期

页      面：255-274页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：complexity and performance of numerical algorithms elementary functions 

摘      要：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.