Asymptotic expansions for the truncation error in Ramanujan-type series

Abstract

Many of the fastest known algorithms to compute π involve generalized hypergeometric series, such as the Ramanujan-Sato series. In this paper, we investigate the rates of convergence for several such series and we give asymptotic expansions for the error of finite approximation. For example, when using the first n terms of the Chudnovskys' series, we obtain the finite approximation πn≈ π. It is known that the truncation error satisfies |πn-π|≈ 53360-3n. In this paper, we prove that the asymptotic expansion for the truncation error in the Chudnovskys' series is |πn-π|=53360-3n·10672010005π1672209n·(A1n+A2n2+δnn3), with 0.006907<δn<0.008429 and the exact rational values of A1 and A2: A1= -17818431974337456754505816, A2= -10800960119257100883953475199235000451148614116. Thus we demonstrate how to establish precise error bounds for the approximations for π obtained through Ramanujan-like series for 1/π. We also give asymptotic expansions for all known rational hypergeometric series for 1/π in the appendix.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…