ON THE RAPID COMPUTATION OF VARIOUS POLYLOGARITHMIC CONSTANTS David Bailey, Peter Borwein1 and Simon Plouffe Abstract. We give algorithms for the computation of the d-th digit of certain transcendental - Polylogarithmic - Document - PDFSEARCH.IO

First Page	Meta Content
	ON THE RAPID COMPUTATION OF VARIOUS POLYLOGARITHMIC CONSTANTS David Bailey, Peter Borwein1 and Simon Plouffe Abstract. We give algorithms for the computation of the d-th digit of certain transcendental Add to Reading List Document Date: 2012-11-07 15:21:59 Open Document File Size: 132,67 KB Share Result on Facebook Company IBM / / Country Canada / / Facility NASA Ames Research Center / / IndustryTerm binary exponentiation algorithm / integer relation algorithm / diﬀerent algorithms / above algorithm / exponentiation algorithm / / MusicGroup B.C. / / OperatingSystem L3 / / Organization NASA Ames Research Center / / Person David Bailey / Tom Hales / Robert Harley / Stan Wagon / Helaman Ferguson / Simon Plouffe / Victor Adamchik / Donald Knuth / / ProvinceOrState South Carolina / British Columbia / / PublishedMedium Mathematics of Computation / / Technology PSLQ integer relation algorithm / above algorithm / binary exponentiation algorithm / integer relation algorithm / exponentiation algorithm / favored algorithms / diﬀerent algorithms / / SocialTag Logarithms Exponentials Binary arithmetic Pi Floating point Arbitrary-precision arithmetic Factorial Approximations of π Transcendental number Mathematics

ON THE RAPID COMPUTATION OF VARIOUS POLYLOGARITHMIC CONSTANTS David Bailey, Peter Borwein1 and Simon Plouffe Abstract. We give algorithms for the computation of the d-th digit of certain transcendentalAdd to Reading List