Separable asymptotic cost of evaluating elementary functions

The computational cost, in the bit model of computation, of the evaluation of a real function in a point is analyzed, when the number d of correct digits of the result increases asymptotically. We want to study how the cost depends on also when approaches a critical point for the function f. We inve...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Numerical algorithms Ročník 24; číslo 3; s. 255 - 274
Hlavní autoři: Favati, P., Lotti, G., Menchi, O., Romani, F.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.08.2000
Témata:
Asymptotic properties
Computing costs
Critical point
Upper bounds
ISSN:1017-1398, 1572-9265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The computational cost, in the bit model of computation, of the evaluation of a real function in a point is analyzed, when the number d of correct digits of the result increases asymptotically. We want to study how the cost depends on also when 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 , that is as products of two functions, each of one variable. We examine in particular the case of elementary functions.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1023/A:1019101512077