Spigot algorithm and reliable computation of natural logarithm (Q701962)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Spigot algorithm and reliable computation of natural logarithm |
scientific article; zbMATH DE number 2128434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spigot algorithm and reliable computation of natural logarithm |
scientific article; zbMATH DE number 2128434 |
Statements
Spigot algorithm and reliable computation of natural logarithm (English)
0 references
17 January 2005
0 references
For details on the spigot algorithm the author refers to his previous paper [ibid. 7, No.3, 247-273 (2001; Zbl 0986.65052)], on root computing. For the logarithm, the procedure is based on the decomposition \(\ln Q= k \times \ln 2+\ln(1+p/q)\), with \(p\) and \(q\) positive integers, \(p<q\). Means for determining an upper bound for the biggest integer occurring in the process of spigot computing are provided.
0 references
spigot algorithm
0 references
reliable computation
0 references
natural logarithm
0 references
0.756883442401886
0 references
0.756883442401886
0 references
0.7419400811195374
0 references
0.7346818447113037
0 references
0.7251140475273132
0 references