skip to main content
article

Space-efficient evaluation of hypergeometric series

Published: 01 September 2005 Publication History

Abstract

We consider the evaluation of the truncated hypergeometric series
[EQUATION]
to high precision, where <i>a, b, p</i>, and <i>q</i> are polynomials with integer coefficients, and <i>a</i>(<i>n</i>), <i>b</i>(<i>n</i>), <i>p</i>(<i>n</i>), <i>q</i>(<i>n</i>) have bit length <i>O</i>(log <i>n</i>). We also assume that the series is linearly convergent, so that the <i>n</i>th term of (1) is <i>O</i>(<i>c<sup>-n</sup></i>) with <i>c</i> &gt; 1. These series are commonly used in the high precision evaluation of elementary functions and other constants, including the exponential function, logarithms, trigonometric functions, and constants such as the Ap&eacute;ry's constant &zeta;(3) [9, 10].
"Binary splitting" is an approach that has been independently discovered and used by many authors in the computation of (1) [2, 3, 4, 5, 8, 10, 12]. Binary splitting computes the numerator and denominator of the rational number <i>S</i>(<i>N</i>). The decimal representation of <i>S</i>(<i>N</i>) is then computed by fixed-point division of the numerator by the denominator. The binary splitting approach takes advantage of the special form of the series (1) to obtain a denominator that is relatively small (of size <i>O</i>(<i>N</i> log <i>N</i>)). It also takes advantage of fast integer multiplication to obtain a time complexity of <i>O</i>((log <i>N</i>)<sup>2</sup>M(<i>N</i>)), where M(<i>N</i>) = <i>O</i>(<i>N</i> log <i>N</i> log log <i>N</i>) is the complexity of integer multiplication of two <i>N</i>-bit integers [16]. The space complexity of the algorithm is <i>O</i>(<i>N</i> log <i>N</i>), the size of the computed numerator and denominator.
Typically, the numerator and denominator computed by binary splitting have large common factors. For example, in the computation of 640000 digits of &zeta;(3), as much as 86% of the size of the computed numerator and denominator can be attributed to their common factor [7]. Empirically, we have observed that the size of the reduced numerator and denominator is <i>O</i>(<i>N</i>) instead of <i>O</i>(<i>N</i> log <i>N</i>) as computed by binary splitting. The additional digits computed not only slow down the final division but also require more memory to be used during the computation. For computing a large number of decimal digits, either the computation cannot be done at all or some data would have to be swapped out of memory, increasing the computation time dramatically.
In this poster, we study the application of well-known techniques in computer algebra to the evaluation of (1). If a bound on the size of the <i>reduced</i> numerator and denominator is known, we can compute the image of <i>S</i>(<i>N</i>) in (1) under an appropriately chosen modulus. Fast rational number reconstruction can then be applied to recover the reduced numerator and denominator [13, 14, 15, 17]. We show how to apply our techniques to the computation of &zeta;(3), including the prediction of the size of the reduced numerator and denominator. In particular, we obtain the desired <i>O</i>(<i>N</i>) bound on the size of reduced numerator and denominator, which is an interesting result by itself. The techniques used in the analysis can be applied to similar hypergeometric series.

References

[1]
T. Amdeberhan and D. Zeilberger. Hypergeometric series acceleration via the WZ method. Electronic Jl. of Combinatorics, 4, 1997.
[2]
D. J. Bernstein. Fast multiplication and its applications. To appear in Buhler-Stevenhagen Algorithmic number theory book.
[3]
J. Borwein and P. Borwein. Pi and the AGM. John Wiley and Sons, 1987.
[4]
J. M. Borwein, D. M. Bradley, and R. E. Crandall. Computational strategies for the Riemann zeta function. Journal of Computational and Applied Mathematics, 121:247--296, 2000.
[5]
R. P. Brent. Fast multiple-precision evaluation of elementary functions. Journal of the ACM, 23(2):242--251, 1976.
[6]
H. Cheng, B. Gergel, E. Kim, and E. V. Zima. Space-efficient evaluation of hypergeometric series. To appear in Communications in Computer Algebra, 2005.
[7]
H. Cheng and E. V. Zima. On accelerated methods to evaluate sums of products of rational numbers. In Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, pages 54--61, 2000.
[8]
R. W. Gosper. Strip mining in the abandoned orefields of nineteenth century mathematics. In Computers in Mathematics, pages 261--284. Dekker, New York, 1990.
[9]
X. Gourdon and P. Sebah. Numbers, constants and computation. http://numbers.computation.free.fr/Constants/constants.html.
[10]
B. Haible and T. Papanikolaou. Fast multiprecision evaluation of series of rational numbers. In J. P. Buhler, editor, Algorithmic Number Theory, Third International Symposium, ANTS-III, volume 1423 of Lecture Notes in Computer Science. Springer, 1998.
[11]
G. Hanrot, E. Thomé, and P. Zimmermann. A new algorithm for hypergeometric constants. Private Communication, 2005.
[12]
E. A. Karatsuba. Fast evaluation of &zeta;(3). Problemy Peredachi Informatsii, 27:68--73, 1993.
[13]
M. Monagan. Maximal quotient rational reconstruction: An almost optimal algorithm for rational reconstruction. In Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pages 243--249, 2004.
[14]
P. L. Montgomery. An FFT Extension of the Elliptic Curve Method of Factorization. PhD thesis, University of California, Los Angeles, 1992.
[15]
A. Schönhage. Schnelle berechnung von kettenbruchentwicklungen. Acta Informatica, 1:139--144, 1971.
[16]
A. Schönhage and V. Strassen. Schnelle multiplikation großer zahlen. Computing, 7:281--292, 1971.
[17]
X. Wang and V. Y. Pan. Acceleration of euclidean algorithm and rational number reconstruction. SIAM Journal on Computing, 32(2):548--556, 2003.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSAM Bulletin
ACM SIGSAM Bulletin  Volume 39, Issue 3
September 2005
42 pages
ISSN:0163-5824
DOI:10.1145/1113439
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 2005
Published in SIGSAM Volume 39, Issue 3

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 107
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)1
Reflects downloads up to 16 Dec 2024

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media