Related papers: Fast Ramanujan--type Series for Logarithms. Part I…
We make a summary of the different types of proofs adding some new ideas. In addition we conjecture some relations which could be necessary in "modular type proofs" (not still found) of the Ramanujan-like series for 1/\pi^2.
We present a new general method for performing basic arithmetic in the finite field~$\mathbb{F}_p$ for any prime $p>2$ by using traditional binary operations over~$\mathbb{F}_2$. Our new approach is efficient and competitive with current…
The verification of many algorithms for calculating transcendental functions is based on polynomial approximations to these functions, often Taylor series approximations. However, computing and verifying approximations to the arctangent…
This paper provides an introduction to the design of augmented data structures that offer an efficient representation of a mathematical sequence and fast sequential summation algorithms, which guarantee both logarithmic running time and…
In the present paper, we introduce a multiple Ramanujan sum for arithmetic functions, which gives a multivariable extension of the generalized Ramanujan sum studied by D. R. Anderson and T. M. Apostol. We then find fundamental arithmetic…
In this we paper we prove several new identities of the Rogers-Ramanujan-Slater type. These identities were found as the result of computer searches. The proofs involve a variety of techniques, including series-series identities, Bailey…
Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…
We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…
Infinite series are evaluated through the manipulation of a series for $\cos(2t \sin^{-1}x)$ resulting from Clausen's Product. Hypergeometric series equal to an expression involving $\frac{1} {\pi}$ are determined. Techniques to evaluate…
The Lp regression problem takes as input a matrix $A \in \Real^{n \times d}$, a vector $b \in \Real^n$, and a number $p \in [1,\infty)$, and it returns as output a number ${\cal Z}$ and a vector $x_{opt} \in \Real^d$ such that ${\cal Z} =…
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…
Via symbolic computation we deduce 97 new type series for powers of $\pi$ related to Ramanujan-type series. Here are three typical examples: $$\sum_{k=0}^\infty \frac{P(k) \binom{2k}k\binom{3k}k…
In this paper we present experimental ways of evaluating Ramanujan`s quantities which as someone can see are related with algebraic numbers. The good thing with algebraic numbers is that can be found in a closed form, from there…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…
In this paper, we develop RLOBPCG, an efficient method for computing a small number of singular triplets corresponding to the smallest singular values of large, tall matrices. The algorithm combines randomized preconditioner from the…
We derive 10 new Ramanujan-Sato series of $1/\pi$ by using the method of Huber, Schultz and Ye. The levels of these series are 14, 15, 16, 20, 21, 22, 26, 35, 39.
In this paper we present a probabilistic algorithm to compute the coefficients of modular forms of level one. Focus on the Ramanujan's tau function, we give out the explicit complexity of the algorithm. From a practical viewpoint, the…
The $p$-adic logarithm appears in many places in number theory. Hence having a good description of the image of the $p$-adic logarithm could be useful, and in particular, to figure out the image of $1 + \mathfrak{m}_K$, where $K$ is an…
Objectives involving bilinear forms $u^\top f(A(\theta))v$ for Hermitian $A$ arise widely in scientific computing and probabilistic machine learning. For large matrices, Lanczos efficiently approximates these quantities, but differentiating…