Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Time- and Space-Efficient Evaluation of Some Hypergeometric Constants

Abstract : The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \log^2 d)$ and space complexity of $O(d \log d)$ or $O(d)$. Following work from Cheng, Gergel, Kim and Zima, we present a new algorithm with the same asymptotic complexity, but more efficient in practice. Our implementation of this algorithm improves slightly over existing programs for the computation of $\pi$, and we announce a new record of 2 billion digits for $\zeta(3)$.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Thursday, January 25, 2007 - 2:24:04 PM
Last modification on : Friday, December 9, 2022 - 12:19:43 PM
Long-term archiving on: : Tuesday, September 21, 2010 - 11:52:39 AM


Files produced by the author(s)



Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima, Paul Zimmermann. Time- and Space-Efficient Evaluation of Some Hypergeometric Constants. [Research Report] RR-6105, INRIA. 2007. ⟨inria-00126428v2⟩



Record views


Files downloads