Related papers: The Borwein brothers, Pi and the AGM
In 1987 Jonathan and Peter Borwein, inspired by the works of Ramanujan, derived many efficient algorithms for computing $\pi$. We will see that by using only a formula of Gauss's and elementary algebra we are able to prove the correctness…
This paper consists of three independent parts: First we use only elementary algebra to prove that the quartic algorithm of the Borwein brothers has exactly the same output as the Brent-Salamin algorithm, but that the latter needs twice as…
Generalized trigonometric functions are applied to the Legendre-Jacobi standard form of complete elliptic integrals, and a new form of the generalized complete elliptic integrals of the Borweins is presented. According to the form, it can…
Using a self-replicating method, we generalize with a free parameter some Borwein algorithms for the number $\pi$. This generalization includes values of the Gamma function like $\Gamma(1/3)$, $\Gamma(1/4)$ and of course…
We use a method of translation to recover Borweins' quadratic and quartic iterations. Then, by using the WZ-method, we obtain some initial values which lead to the limit $1/\pi$. We will not use the modular theory nor either the Gauss'…
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…
Algorithms for computing the classical Gaussian quadrature rules (Gauss--Jacobi, Gauss--Laguerre, and Gauss--Hermite) are presented, based on globally convergent fourth-order iterative methods combined with asymptotic approximations, which…
We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…
We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the unit interval and its application in the generation of Gauss-Legendre quadrature rules. Our focus is on making the evaluation practical for a…
Gauss's arithmetic-geometric mean (AGM) which is described by two variables iteration $(a_n, b_n)\rightarrow (a_{n+1}, b_{n+1})$ by $a_{n+1}=(a_n+b_n)/2,\ b_{n+1}=\sqrt{a_nb_n}$. We extend it to three variables iteration $(a_n, b_n,…
Gaussian processes (GPs) are important models in supervised machine learning. Training in Gaussian processes refers to selecting the covariance functions and the associated parameters in order to improve the outcome of predictions, the core…
The arithmetic mean is the mean for addition and the geometric mean is that for multiplication. Then what kind of binary operation is associated with the arithmetic-geometric mean (AGM) due to C. F. Gauss? If it is possible to construct an…
This paper studies a well-known $\pi$ machine illustrated by Fig.(1). It is shown that the $\pi$ machine can compute digits of $\pi$ if the ratio of block weights, $m_2/m_1$, satisfies certain conditions, and that dynamics of the $\pi$…
Let k be an arbitrary field, A be a standard graded Artinian Gorenstein k-algebra of embedding dimension four and socle degree three, and pi from P to A be a surjective graded homomorphism from a polynomial ring with four variables over k…
In this article, we focus on the error that is committed when computing the matrix logarithm using the Gauss--Legendre quadrature rules. These formulas can be interpreted as Pad\'e approximants of a suitable Gauss hypergeometric function.…
We study the capability of the Fast Fourier Transform (FFT) to accelerate exact and approximate matrix multiplication without using Strassen-like divide-and-conquer. We present a simple exact algorithm running in $O(n^{2.89})$ time, which…
Exact calculation and even multiplicative error estimation of matrix permanent are challenging for both classical and quantum computers. Regarding the permanents of random Gaussian matrices, the additive error estimation is closely linked…
Algebraic multigrid (AMG) is one of the fastest numerical methods for solving large sparse linear systems. For SPD matrices, convergence of AMG is well motivated in the $A$-norm, and AMG has proven to be an effective solver for many…
Using an infinite family of generalizations of the Chudnovsky brothers' series recently obtained via the analytic continuation of the Borwein brothers' formula for Ramanujan-type series of level 1, we apply the Gauss-Salamin-Brent iteration…
Fundamental mathematical constants like $e$ and $\pi$ are ubiquitous in diverse fields of science, from abstract mathematics to physics, biology and chemistry. For centuries, new formulas relating fundamental constants have been scarce and…