Related papers: Efficient and accurate algorithms for the computat…
This paper presents expressions for gamma values at rational points with the denominator dividing 24 or 60. These gamma values are expressed in terms of 10 distinct gamma values and rational powers of $\pi$ and a few real algebraic numbers.…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
It has long been agreed by academics that the inversion method is the method of choice for generating random variates, given the availability of the quantile function. However for several probability distributions arising in practice a…
We consider the asymptotic behavior of the incomplete gamma functions gamma(-a,-z) and Gamma(-a,-z) as a goes to infinity. Uniform expansions are needed to describe the transition area z~a in which case error functions are used as main…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
In this paper, we present an improved methodology to compute $\omega$-invariant of numerical semigroup. The approach is based on adapting a recent resolution method for optimizing a linear function over the set of efficient solutions of a…
Let $\gamma$ denote imaginary parts of complex zeros of the Riemann zeta-function $\zeta(s)$. Certain sums over the $\gamma$'s are evaluated, by using the function $G(s) = \sum_{\gamma>0}\gamma^{-s}$ and other techniques. Some integrals…
Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…
We present a mathematical analysis of transformations used in fast calculation of inverse square root for single-precision floating-point numbers. Optimal values of the so called magic constants are derived in a systematic way, minimizing…
We prove a novel type of inversion formula for elliptic hypergeometric integrals associated to a pair of root systems. Using the (A,C) inversion formula to invert one of the known C-type elliptic beta integrals, we obtain a new elliptic…
Harmonic polylogarithms $\H(\vec{a};x)$, a generalization of Nielsen's polylogarithms ${S}_{n,p}(x)$, appear frequently in analytic calculations of radiative corrections in quantum field theory. We present an algorithm for the numerical…
Matrix functions with potential applications have a major role in science and engineering. One of the fundamental matrix functions, which is particularly important due to its connections with certain matrix differential equations and other…
The generalized Marcum functions appear in problems of technical and scientific areas such as, for example, radar detection and communications. In mathematical statistics and probability theory these functions are called the noncentral…
In this article we derive, using the Lagrange inversion theorem and applying twice the Fa\`a di Bruno formula, an expression of the minimum of the Gamma function $\Gamma$ as an expansion in powers of the Euler-Mascheroni constant $\gamma$.…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
This work introduces a new inversion formula for analytical functions. It is simple, generally applicable and straightforward to use both in hand calculations and for symbolic machine processing. It is easier to apply than the traditional…
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…
Evaluating the log-sum-exp function or the softmax function is a key step in many modern data science algorithms, notably in inference and classification. Because of the exponentials that these functions contain, the evaluation is prone to…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
Various applications such as MRI, solution of PDEs, etc. need to perform an inverse nonequispaced fast Fourier transform (NFFT), i. e., compute $M$ Fourier coefficients from given $N$ nonequispaced data. In the present paper we consider…