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 work station in a few hours run time.
CITATION STYLE
Bailey, D., Borwein, P., & Plouffe, S. (1997). On the Rapid Computation of Various Polylogarithmic Constants. In Pi: A Source Book (pp. 663–676). Springer New York. https://doi.org/10.1007/978-1-4757-2736-4_70
Mendeley helps you to discover research relevant for your work.