On the computation and verification of using BBP-type formulas
From MaRDI portal
Publication:2301911
Cites work
- A class of digit extraction BBP-type formulas in general binary bases
- A Simple Formula for π
- Analysis of PSLQ, an integer relation finding algorithm
- Calculation of π to 100,000 Decimals
- scientific article; zbMATH DE number 5552087 (Why is no real title available?)
- John Machin and Robert Simson on inverse-tangent series for
- On the rapid computation of various polylogarithmic constants
- Parallel integer relation detection: techniques and applications
Cited in
(7)- 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
- Some BBP-type series for polylog integrals
- Alternating Euler sums and BBP-type series
- scientific article; zbMATH DE number 5497766 (Why is no real title available?)
- New proofs of Borwein-type algorithms for Pi
- Closed-form expressions for polylogarithmic integrals and related harmonic sums
This page was built for publication: On the computation and verification of \(\pi\) using BBP-type formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301911)