On the computation and verification of \(\pi\) using BBP-type formulas
From MaRDI portal
Publication:2301911
DOI10.1007/s11139-018-0104-xOpenAlexW2920707946MaRDI QIDQ2301911
Publication date: 25 February 2020
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-018-0104-x
Number-theoretic algorithms; complexity (11Y16) Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20)
Related Items (4)
Some BBP-type series for polylog integrals ⋮ Alternating Euler sums and BBP-type series ⋮ On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants ⋮ Logarithmic integrals with applications to BBP and Euler-type sums
Cites Work
- Unnamed Item
- John Machin and Robert Simson on inverse-tangent series for \(\pi\)
- Parallel integer relation detection: Techniques and applications
- A class of digit extraction BBP-type formulas in general binary bases
- On the rapid computation of various polylogarithmic constants
- Calculation of π to 100,000 Decimals
- Analysis of PSLQ, an integer relation finding algorithm
- A Simple Formula for π
This page was built for publication: On the computation and verification of \(\pi\) using BBP-type formulas