Separable asymptotic cost of evaluating elementary functions (Q1587035)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Separable asymptotic cost of evaluating elementary functions |
scientific article |
Statements
Separable asymptotic cost of evaluating elementary functions (English)
0 references
22 November 2000
0 references
The computational cost, in the bit model of computation, of the evaluation of a real function \(f(x)\) is analyzed, when the number \(d\) of correct digits of the result increases asymptotically. The authors study how the cost depends on \(x\), also when \(x\) approaches a critical point for \(f\), and they investigate the hypothesis under which it is possible to give upper bounds on the cost as function of \(d\) and \(x\). In particular the case of elementary functions is examined.
0 references
complexity
0 references
elementary functions
0 references
numerical algorithms
0 references
performance
0 references
computational cost
0 references