Related papers: Computation of hyperspherical Bessel functions
We show how one can obtain an asymptotic expression for some special functions satisfying a second order differential equation with a very explicit error term starting from appropriate upper bounds. We will work out the details for the…
In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…
In this paper our aim is to present some subordination and superordination results, by using an operator, which involves the normalized form of the generalized Bessel functions of first kind. These results are obtained by investigating some…
The hidden subgroup problem~(HSP) is one of the most important problems in quantum computation. Many problems for which quantum algorithm achieves exponential speedup over its classical counterparts can be reduced to the Abelian HSP.…
This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we present an efficient computation of the partition function for…
We introduce a simple, general, and convergent scheme to compute generalized eigenfunctions of self-adjoint operators with continuous spectra on rigged Hilbert spaces. Our approach does not require prior knowledge about the eigenfunctions,…
We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…
The problem of evaluation of higher derivatives of Airy functions in a closed form is investigated. General expressions for the polynomials which have arisen in explicit formulae for these derivatives are given in terms of particular values…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
It is demonstrated how to use certain family of commutative hypergroups to provide a universal construction of Biane's quantum Bessel processes of all dimensions not smaller than 1. The classical Bessel processes BES$(\delta)$ are…
In this paper, we reconsider the large-argument asymptotic expansions of the Hankel, Bessel and modified Bessel functions and their derivatives. New integral representations for the remainder terms of these asymptotic expansions are found…
We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…
A strict integer Laurent polynomial in a variable $x$ is 0 or a sum of one or more terms having integer coefficients times $x$ raised to a negative integer exponent. Equations that can be transformed to certain such polynomials times…
In this work we develop the Gaussian quadrature rule for weight functions involving fractional powers, exponentials and Bessel functions of the first kind. Besides the computation based on the use of the standard and the modified Chebyshev…
We consider the problem of computing the Lebesgue volume of compact basic semi-algebraic sets. In full generality, it can be approximated as closely as desired by a converging hierarchy of upper bounds obtained by applying the Moment-SOS…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
Scientific computations or measurements may result in huge volumes of data. Often these can be thought of representing a real-valued function on a high-dimensional domain, and can be conceptually arranged in the format of a tensor of high…
The umbral restyling of hypergeometric functions is shown to be a useful and efficient approach in simplifying the associated computational technicalities. In this article, the authors provide a general introduction to the umbral version of…
The general properties of two-dimensional generalized Bessel functions are discussed. Various asymptotic approximations are derived and applied to analyze the basic structure of the two-dimensional Bessel functions as well as their nodal…
In the classical theory of cubic interpolation splines there exists an algorithm which works with only $O\left( n\right)$ arithmetic operations. Also, the smoothing cubic splines may be computed via the algorithm of Reinsch which reduces…