Related papers: A Rapidly Converging Machin-like Formula for $\pi$
Let $f$ be a fixed (holomorphic or Maass) modular cusp form, with $L$-function $L(f,s)$. We describe an algorithm that computes the value $L(f,1/2+ iT)$ to any specified precision in time $O(1+|T|^{7/8})$.
A numerical method is developed to solve linear semi-infinite programming problem (LSIP) in which the iterates produced by the algorithm are feasible for the original problem. This is achieved by constructing a sequence of standard linear…
Some important applicative problems require the evaluation of functions $\Psi$ of large and sparse and/or \emph{localized} matrices $A$. Popular and interesting techniques for computing $\Psi(A)$ and $\Psi(A)\mathbf{v}$, where $\mathbf{v}$…
The need for recognition/approximation of functions in terms of elementary functions/operations emerges in many areas of experimental mathematics, numerical analysis, computer algebra systems, model building, machine learning, approximation…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
We obtain the explicit rate of convergence $N^{-1/2 + \epsilon}$ for the gaps of generalized Wigner matrices in the bulk of the spectrum, for distributions of matrix entries possibly atomic and supported on enough points. The proof proceeds…
We study the distribution of Mahler's measures of reciprocal polynomials with complex coefficients and bounded even degree. We discover that the distribution function associated to Mahler's measure restricted to monic reciprocal polynomials…
We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{\gamma+1}\simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
Sometimes only some digits of a numerical product or some terms of a polynomial or series product are required. Frequently these constitute the most significant or least significant part of the value, for example when computing initial…
A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be…
In a recent paper we have suggested that the finite temperature density matrix can be computed efficiently by a combination of polynomial expansion and iterative inversion techniques. We present here significant improvements over this…
Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…
In our recent publications we have introduced the incomplete cosine expansion of the sinc function for efficient application in sampling [Abrarov & Quine, Appl. Math. Comput., 258 (2015) 425-435; Abrarov & Quine, J. Math. Research, 7 (2)…
In his book \emph{Topics in Analytic Number Theory}, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating function for partitions of…
The arithmetic partial derivative (with respect to a prime $p$) is a function from the set of integers that sends $p$ to 1 and satisfies the Leibniz rule. In this paper, we prove that the $p$-adic valuation of the sequence of higher order…
The goal of the paper is to automatize the selection of mechanisms which are able to describe a set of measurements. In order to do so first we construct a set of possible mechanism fulfilling chemically reasonable requirements with a given…
We consider the problem of recovering a low-multilinear-rank tensor from a small amount of linear measurements. We show that the Riemannian gradient algorithm initialized by one step of iterative hard thresholding can reconstruct an…
A non-subtractive recipe of Casimir energy renormalization efficient in the presence of logarithmically divergent terms is proposed. It is demonstrated that it can be applied even in such cases, when energy levels can be obtained only…
The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…