On the rapid computation of various polylogarithmic constants期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

On the rapid computation of various polylogarithmic constants

Authors:	David Bailey Peter Borwein Simon Plouffe

Institution:	NASA Ames Research Center, Mail Stop T27A-1, Moffett Field, California 94035-1000 ; Department of Mathematics and Statistics, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6 ; Department of Mathematics and Statistics, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6

Abstract:	We give algorithms for the computation of the -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 $\pi$ on a modest work station in a few hours run time. We demonstrate this technique by computing the ten billionth hexadecimal digit of $\pi$ , the billionth hexadecimal digits of $\pi ^{2}, \log (2)$ and $\log ^{2}(2)$ , and the ten billionth decimal digit of $\log (9/10)$ . These calculations rest on the observation that very special types of identities exist for certain numbers like $\pi$ , $\pi ^{2}$ , $\log (2)$ and $\log ^{2}(2)$ . These are essentially polylogarithmic ladders in an integer base. A number of these identities that we derive in this work appear to be new, for example the critical identity for $\pi$ : $\begin{equation}\pi = \sum _{i=0}^{\infty }\frac {1}{16^{i}}\bigr ( \frac {4}{8i+1} - \frac {2}{8i+4} - \frac {1}{8i+5} - \frac {1}{8i+6} \bigl ).\end{equation}$

Keywords:	Computation digits log polylogarithms SC $\pi $ algorithm

	点击此处可从《Mathematics of Computation》浏览原始摘要信息
	点击此处可从《Mathematics of Computation》下载免费的PDF全文

设为首页 | 免责声明 | 关于勤云 | 加入收藏