Separable asymptotic cost of evaluating elementary functions

DOI10.1023/A:1019101512077MaRDI QIDQ1587035zbMATH OpenOpenAlexFDO

Authors Paola Favati, Grazia Lotti, Ornella Menchi, Francesco Romani

Publication date 22 November 2000

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019101512077

zbMATH Keywords

complexitycomputational costelementary functionsnumerical algorithmsperformance

Mathematics Subject Classification ID

Elementary functions (26A09) Elementary classical functions (33Bxx) Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20)

Review text

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.

Recommendations

• On asymptotic estimates for arithmetic cost functions
• Numerics of analytic functions and complexity
• Asymptotic behavior of automatic quadrature
• Efficient Multiple-Precision Evaluation of Elementary Functions
• scientific article; zbMATH DE number 1109070

Cited in

(1)

• Asymptotic bit cost of quadrature formulas obtained by variable transformation

This page was built for publication: Separable asymptotic cost of evaluating elementary functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587035)