Related papers: Easy Proofs of Some Borwein Algorithms for $\pi$
Bernstein polynomials provide a constructive proof for the Weierstrass approximation theorem, which states that every continuous function on a closed bounded interval can be uniformly approximated by polynomials with arbitrary accuracy.…
Approximation algorithms are widely used in many engineering problems. To obtain a data set for approximation a factorial design of experiments is often used. In such case the size of the data set can be very large. Therefore, one of the…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
In this article, we refine and slightly strengthen the metric space version of the Borwein-Preiss variational principle due to Li, Shi, J. Math. Anal. Appl. 246, 308-319 (2000), clarify the assumptions and conclusions of their Theorem 1 as…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…
Throughout more than two millennia many formulas have been obtained, some of them beautiful, to calculate the number pi. Among them, we can find series, infinite products, expansions as continued fractions and expansions using radicals.…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
We provide a proof of the Borwein Conjecture using analytic methods.
We prove that there is a correspondence between Ramanujan-type formulas for 1/\pi, and formulas for Dirichlet L-values. The same method also allows us to resolve certain values of the Epstein zeta function in terms of rapidly converging…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
By using one of the definitions of the Bernoulli numbers, we prove that they solve particular odd and even lower triangular Toeplitz (l.t.T.) systems of equations. In a paper Ramanujan writes down a sparse lower triangular system solved by…
The beta integral is applied to accelerate the hypergeometric function $2 F 1\left\{1, B; C ; w\right\}$ to derive new infinite series for constants such as $\pi$ and values of the gamma function. A compendium of new infinite series is…
Over the past two decades, Yuri Gurevich and his colleagues have formulated axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in the new generic framework of abstract state…
The regularized Barzilai-Borwein (RBB) method represents a promising gradient-based optimization algorithm. In this paper, by splitting the gradient into two parts and analyzing the dynamical system of difference equations governing the…
Borwein et al. (2000) solved a surprise maximization problem by applying results from convex analysis and mathematical programming. Although, their proof is elegant, it requires advanced knowledge from both areas to understand it. Here, we…
Gaussian processes (GP) are a widely used model for regression problems in supervised machine learning. Implementation of GP regression typically requires $O(n^3)$ logic gates. We show that the quantum linear systems algorithm [Harrow et…
Brent and McMillan introduced in 1980 a new algorithm for the computation of Euler's constant $\gamma$, based on the use of the Bessel functions I\_0(x) and K\_0(x). It is the fastest known algorithm for the computation of $\gamma$. The…
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…
In 2015 Cristian-Silviu Radu designed an algorithm to detect identities of a class studied by Ramanujan and Kolberg. This class includes the famous identities by Ramanujan which provide a witness to the divisibility properties of $p(5n+4),$…