Pages that link to "Item:Q4113885"
From MaRDI portal
The following pages link to Computation of π Using Arithmetic-Geometric Mean (Q4113885):
Displaying 30 items.
- Effiziente Berechnung spezieller Funktionen mittels asymptotischer Entwicklungen und Eliminationsprozeduren. (An efficient calculation of special functions by asymptotic expansions and elimination procedures) (Q582517) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- An explicit approximate solution to the Duffing-harmonic oscillator by a cubication method (Q665225) (← links)
- Hypergeometric analogues of the arithmetic-geometric mean iteration (Q690361) (← links)
- Complete \(p\)-elliptic integrals and a computation formula of \(\pi_p\) for \(p=4\) (Q721833) (← links)
- Analogues of the Brent-Salamin algorithm for evaluating \(\pi\) (Q746388) (← links)
- A very rapidly convergent product expansion for pi (Q787637) (← links)
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era (Q928099) (← links)
- Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation (Q991138) (← links)
- Is \(\pi\) normal ? (Q1058539) (← links)
- On square roots and their representations (Q1080408) (← links)
- Random arithmetic-geometric means and random pi: Observations and conjectures (Q1198599) (← links)
- Fast evaluation of holonomic functions (Q1274814) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- The quest for pi (Q1361163) (← links)
- Distant decimals of \(\pi \): formal proofs of some algorithms computing them and guarantees of exact computation (Q1663216) (← links)
- Birth, growth and computation of pi to ten trillion digits (Q1693543) (← links)
- An explicit cubic iteration for \(\pi\) (Q1819532) (← links)
- A noncontinuous generalization of the arithmetic-geometric mean. (Q1855091) (← links)
- On a function involving generalized complete \((p, q)\)-elliptic integrals (Q2302704) (← links)
- Learning Poisson binomial distributions (Q2345953) (← links)
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era (Q2390176) (← links)
- A fast algorithm for computing the digamma function (Q2689576) (← links)
- The Borwein Brothers, Pi and the AGM (Q3298036) (← links)
- On computation of the Bessel function by summing up the series (Q5043040) (← links)
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications (Q5928297) (← links)
- An arithmetic-geometric mean inequality (Q5947332) (← links)
- The Elliptic Integral Machine: A Collision-based Model of Computation (Q6078863) (← links)
- Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method (Q6173465) (← links)
- On the application of ergodic theory to an alternating series expansion for real numbers (Q6622344) (← links)