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

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