Self-replication and Borwein-like algorithms
From MaRDI portal
Evaluation of number-theoretic constants (11Y60) Classical hypergeometric functions, ({}_2F_1) (33C05) Elliptic integrals as hypergeometric functions (33C75) Numerical approximation and evaluation of special functions (33F05) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Abstract: Using a self-replicating method, we generalize with a free parameter some Borwein algorithms for the number . This generalization includes values of the Gamma function like , and of course . In addition, we give new rapid algorithms for the perimeter of an ellipse.
Recommendations
- An algorithm and self-reproducing systems
- Self-replicating loops: a survey
- Self-replications of informatic systems
- Self-Replicability of Composite Graph Reproduction System
- SOFSEM 2005: Theory and Practice of Computer Science
- Topics in Cryptology – CT-RSA 2004
- A self-adjusting algorithm for Byzantine agreement
Cites work
- A Cubic Counterpart of Jacobi's Identity and the AGM
- Easy Proofs of Some Borwein Algorithms for π
- Gauss, Landen, Ramanujan, the Arithmetic-Geometric Mean, Ellipses, π, and the Ladies Diary
- scientific article; zbMATH DE number 5552087 (Why is no real title available?)
- scientific article; zbMATH DE number 3987351 (Why is no real title available?)
- scientific article; zbMATH DE number 1049731 (Why is no real title available?)
- scientific article; zbMATH DE number 1114500 (Why is no real title available?)
- Matters computational. Ideas, algorithms, source code.
- New proofs of Borwein-type algorithms for Pi
- Pi: The Next Generation
- Ramanujan's theta functions
- Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
Cited in
(2)
This page was built for publication: Self-replication and Borwein-like algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623892)