Computer Science – Symbolic Computation
Scientific paper
2007-01-25
Computer Science
Symbolic Computation
Scientific paper
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)$.
Cheng Howard
Hanrot Guillaume
Thomé Emmanuel
Zima Eugene
Zimmermann Paul
No associations
LandOfFree
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Time- and Space-Efficient Evaluation of Some Hypergeometric Constants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time- and Space-Efficient Evaluation of Some Hypergeometric Constants will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-328747