Spigot algorithm and reliable computation of natural logarithm

DOI10.1023/B:REOM.0000047096.58634.FEMaRDI QIDQ701962zbMATH OpenFDO

Authors Dang-Khoa Do

Publication date 17 January 2005

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:REOM.0000047096.58634.FE

zbMATH Keywords

natural logarithmreliable computationspigot algorithm

Mathematics Subject Classification ID

Elementary functions (26A09) Exponential and trigonometric functions (33B10) Numerical approximation and evaluation of special functions (33F05) Computation of special functions and constants, construction of tables (65D20)

Review text

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.

Recommendations

• A Spigot Algorithm for the Digits of &#960
• Fast and correctly rounded logarithms in double-precision
• Unbounded Spigot Algorithms for the Digits of Pi
• On the rapid computation of various polylogarithmic constants
• An algorithm for calculating logarithms through displacement

Cited in

(3)

• An algorithm for calculating logarithms through displacement
• Speculatively Redundant Continued Logarithm Representation
• Log π and Other Basic Constants

This page was built for publication: Spigot algorithm and reliable computation of natural logarithm

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