Related papers: A fast analysis-based discrete Hankel transform us…
We describe a fast algorithm for computing discrete Hankel transforms of moderate orders from $n$ nonuniform points to $m$ nonuniform frequencies in $O((m+n)\log\min(n,m))$ operations. Our approach combines local and asymptotic Bessel…
The numerical evaluation of an individual Bessel or Hankel function of large order and large argument is a notoriously problematic issue in physics. Recurrence relations are inefficient when an individual function of high order and argument…
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…
In this paper we present a unified framework for asymptotic analysis and computation of the finite Hankel transform. This framework enables us to derive asymptotic expansions of the transform, including the cases where the oscillator has…
The Brent-McMillan algorithm is the fastest known procedure for the high-precision computation of Euler's constant $\gamma$ and is based on the modified Bessel functions $I_0(2x)$ and $K_0(2x)$. An error estimate for this algorithm relies…
We describe a method for the rapid numerical evaluation of the Bessel functions of the first and second kinds of nonnegative real orders and positive arguments. Our algorithm makes use of the well-known observation that although the Bessel…
We propose an algorithm for the orthogonal fast discrete spherical Bessel transform on an uniform grid. Our approach is based upon the spherical Bessel transform factorization into the two subsequent orthogonal transforms, namely the fast…
We revisit the Fourier transform of a Hankel function, of considerable importance in the theory of knife edge diffraction. Our approach is based directly upon the underlying Bessel equation, which admits manipulation into an alternate…
Many standard conversion matrices between coefficients in classical orthogonal polynomial expansions can be decomposed using diagonally-scaled Hadamard products involving Toeplitz and Hankel matrices. This allows us to derive…
This paper is contributed to a fast algorithm for Hankel tensor-vector products. For this purpose, we first discuss a special class of Hankel tensors that can be diagonalized by the Fourier matrix, which is called \emph{anti-circulant}…
We consider polynomials that are orthogonal on $[-1,1]$ with respect to a modified Jacobi weight $(1-x)^\alpha (1+x)^\beta h(x)$, with $\alpha,\beta>-1$ and $h$ real analytic and stricly positive on $[-1,1]$. We obtain full asymptotic…
The aim of this paper is to derive new representations for the Hankel functions, the Bessel functions and their derivatives, exploiting the reformulation of the method of steepest descents by M. V. Berry and C. J. Howls (Berry and Howls,…
The aim of this paper is to derive new representations for the Hankel and Bessel functions, exploiting the reformulation of the method of steepest descents by M. V. Berry and C. J. Howls (Berry and Howls, Proc. R. Soc. Lond. A 434 (1991)…
We investigate a family of integrals involving modified Bessel functions that arise in the context of neutrino scattering. Recursive formulas are derived for evaluating these integrals and their asymptotic expansions are computed. We prove…
We present a straightforward discretization of the Bessel functions $J_n(x)$ to discrete counterparts $B^{(N)}_n(x_m)$, of $N$ integer orders $n$ on $N$ integer points $x_m \equiv m$, that we call discrete Bessel functions. These are built…
Several important functions, including the gamma function, as well as several infinite sums, admit integral representations involving the Hankel contour. In addition, the large $t$ asymptotic analysis of several recently derived identities…
In this paper we present a fast and accurate numerical algorithm for the computation of hyperspherical Bessel functions of large order and real arguments. For the hyperspherical Bessel functions of closed type, no stable algorithm existed…
In this paper, we study the asymptotics and fast computation of the one-sided oscillatory Hilbert transforms of the form $$H^{+}(f(t)e^{i\omega t})(x)=-int_{0}^{\infty}e^{i\omega t}\frac{f(t)}{t-x}dt,\qquad \omega>0,\qquad x\geq 0,$$ where…
Bessel and modified Bessel functions of imaginary order $i\nu$ ($\nu >0$) are studied. Asymptotic expansions are derived as $\nu \to \infty$ that are uniformly valid in unbounded complex domains, with error bounds provided. Coupled with…
We describe an efficient algorithm for computing the matrix vector products that appear in the numerical resolution of boundary integral equations in 2 space dimension. This work is an extension of the so-called Sparse Cardinal Sine…