On the rapid computation of various polylogarithmic constants

@article{Bailey1997OnTR,
  title={On the rapid computation of various polylogarithmic constants},
  author={David Bailey and Peter Borwein and Simon Plouffe},
  journal={Math. Comput.},
  year={1997},
  volume={66},
  pages={903-913}
}
We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log(2) or _ on a modest workstation in a few hours run time. We demonstrate this technique by computing the… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 187 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
123 Citations
18 References
Similar Papers

Citations

Publications citing this paper.

187 Citations

0102030'96'01'07'13
Citations per Year
Semantic Scholar estimates that this publication has 187 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

A spigot algorithm for pi

  • S. D. Rabinowitz, S. Wagon
  • Amer. Math. Monthly
  • 1995
1 Excerpt

Structural Properties of Polylogarithms, Amer

  • L. Lewin
  • Math. Soc., RI.,
  • 1991
3 Excerpts

On the complexity of familiar functions and numbers

  • J. Borwein, P. Borwein
  • SIAM Review
  • 1988
2 Excerpts

Ramanujan , modular equations and approximations to pi , M . A . A

  • P. Borwein Borwein, D. H. Bailey
  • 1988

A taxonomy o] problems with fast parallel algorithms, Information and Control

  • S. Cook
  • 1985
2 Excerpts

Asymptotically fast algorithms for the numerical multiplication and division o] polynomials with complex coe O_cients, in: EUROCAM (1982) Marseille, Springer Lecture Notes in Computer Science, vol

  • A. SchSnhage
  • 144,
  • 1982
2 Excerpts

Similar Papers

Loading similar papers…