On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants
From MaRDI portal
Publication:2168701
DOI10.1007/s11139-021-00475-yzbMath1497.65056OpenAlexW3184196491WikidataQ113900571 ScholiaQ113900571MaRDI QIDQ2168701
Publication date: 26 August 2022
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-021-00475-y
Number-theoretic algorithms; complexity (11Y16) Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Unnamed Item
- On the computation and verification of \(\pi\) using BBP-type formulas
- Parallel integer relation detection: Techniques and applications
- A class of digit extraction BBP-type formulas in general binary bases
- Modern Computer Arithmetic
- On the rapid computation of various polylogarithmic constants
- Modular Multiplication Without Trial Division
- Analysis of PSLQ, an integer relation finding algorithm
- A Simple Formula for π
- On the Random Character of Fundamental Constant Expansions
This page was built for publication: On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants
