Related papers: New proofs of Borwein-type algorithms for Pi
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…
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…
We use a variant of Wan's method to prove two Ramanujan-Orr type formulas for $1/\pi$. This variant needs to know in advance the formulas for $1/\pi$ that we want to prove, but avoids the need of solving a system of equations.
A family of original formulae for computing number PI and its proof are presented. An algorithm is proposed to validate the results of this new algorithm.
We provide a simple way of searching for formulas of the Bailey--Borwein--Plouffe type together with an algorithm and an implementation in \texttt{sage}. Aside from rediscovering some already known formulas, the method has been used in the…
The known WZ-proofs for Ramanujan-type series related to $1/\pi$ gave us the insight to develop a new proof strategy based on the WZ-method. Using this approach we are able to find more generalizations and discover first WZ-proofs for…
We consider some of Jonathan and Peter Borweins' contributions to the high-precision computation of $\pi$ and the elementary functions, with particular reference to their book "Pi and the AGM" (Wiley, 1987). Here "AGM" is the…
Based on the framework of the WZ theory, a new evaluation for $\varsigma (2) = \frac{\pi ^2}{6}$ and $\varsigma (4) = \frac{\pi ^4}{90}$ was given respectively, finally, a new recurrence formula for $\varsigma (2k)$ was given.
In this paper we prove some Ramanujan-type formulas for $1/\pi$ but without using the theory of modular forms. Instead we use the WZ-method created by H. Wilf and D. Zeilberger and find some hypergeometric functions in two variables which…
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…
Previously we have proposed a new method of transforming quotients into integer reciprocals in the Machin-like formulas for $\pi$. As a further development, here we show how to generate a multi-term Machin-like formula for $\pi$ with a…
In this work, we develop a new iterative method for computing the digits of $\pi$ by argument reduction of the tangent function. This method combines a modified version of the iterative formula for $\pi$ with squared convergence that we…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
The iterative algorithm recently proposed by Waxman for solving eigenvalue problems, which relies on the method of moments, has been modified to improve its convergence considerably without sacrificing its benefits or elegance. The…
Recently Z.W.Sun found over hundred conjectured formulas for 1/pi. Many of them were proved by H.H.Chan, J.Wan andW.Zudilin (see [3], [8] in the paper). Here we show that several other formulas in [6] are simple transformations of known…
We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…
We prove some "divergent" Ramanujan-type series for $1/\pi$ and $1/\pi^2$ applying a Barnes-integrals strategy of the WZ-method.
We present a new form of the Machin-like formula for $\pi$ that can be generated by using iteration. This form of the Machin-like formula may be promising for computation of the constant $\pi$ due to rapidly increasing integers at each step…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
We present an efficient method to solve the problem of the constrained least squares approximation of the rational B\'{e}zier curve by the B\'{e}zier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials,…