Skip to main content
SpringerLink
Log in

Spigot Algorithm and Reliable Computation of Natural Logarithm

  • Published:
Reliable Computing

Abstract

The spigot approach used in the previous paper (Reliable Computing 7 (3) (2001), pp. 247–273) for root computation is now applied to natural logarithms. The logarithm ln Q with Q∈\({\mathbb{Q}}\), Q > 1 is decomposed into a sum of two addends k 1× ln Q 1+k 2× ln Q 2 with k 1, k 2∈\({\mathbb{N}}\), then each of them is computed by the spigot algorithm and summation is carried out using integer arithmetic. The whole procedure is not literally a spigot algorithm, but advantages are the same: only integer arithmetic is needed whereas arbitrary accuracy is achieved and absolute reliability is guaranteed. The concrete procedure based on the decomposition \(Q = k \times \ln 2 + \ln \left( {1 + \frac{p}{q}} \right)\) with p, q∈ (\({\mathbb{N}}\)− {0}), p < q is simple and ready for implementation. In addition to the mentioned paper, means for determining an upper bound for the biggest integer occurring in the process of spigot computing are now provided, which is essential for the reliability of machine computation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdali, S. K.: Algorithm 393-Special Series Summation with Arbitrary Precision, Communications of the ACM 13(9) (1970), p. 570.

    Google Scholar 

  2. Amdeberhan, T. and Zeilberger, D.: Faster and Faster Convergent Series for ζ, The Electronic Journal of Combinatorics 3 (1995).

  3. Amdeberhan, T. and Zeilberger, D.: Hypergeometric Series Acceleration via the WZ Method, The Electronic Journal of Combinatorics 4 (2) (1997), #R3.

    Google Scholar 

  4. Do, D.-K.: Spigot Algorithm and Root Computing, Reliable Computing 7 (3) (2001), pp. 247–273.

    Google Scholar 

  5. Rabinowitz, S. and Wagon, S.: A Spigot Algorithm for the Digits of π, American Mathematical Monthly 102(3)} (1995} ), pp. 195–

    Google Scholar 

  6. Sale, A. H. J.: The Calculation of e to Many Significant Digits, Computer Journal 11 (2) (1968), pp. 229–230.

    Google Scholar 

  7. Stoschek, E. P.: Abenteuer Algorithmus, vol. 2, Dresden University Press, 1997.

  8. Walter, W.: Analysis1, 3 ed., Springer, 1992.

  9. Wilf, H. S.: Accelerated Series for Universal Constants, by the WZ Method, Discrete Mathematics and Theoretical Computer Science 3 (1999), pp. 155–158.

    Google Scholar 

  10. Zelberger, D.: Closed Form, Contemporary Mathematics 143 (1993), pp. 579–607.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Institute of Theoretical Computer Science, Dresden University of Technology, Dresden, Germany, e-mail

    Dang-Khoa Do

Authors
  1. Dang-Khoa Do
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Do, DK. Spigot Algorithm and Reliable Computation of Natural Logarithm. Reliable Computing 10, 489–500 (2004). https://doi.org/10.1023/B:REOM.0000047096.58634.fe

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:REOM.0000047096.58634.fe

Keywords

Search

Navigation