Related papers: Computation of highly oscillatory Bessel transform…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
This paper develops a constructive numerical scheme for Fourier-Bessel approximations on disks compatible with convolutions supported on disks. We address accurate finite Fourier-Bessel transforms (FFBT) and inverse finite Fourier-Bessel…
We present a collection of integral equation methods for the solution to the two-dimensional, modified Helmholtz equation, $u(\x) - \alpha^2 \Delta u(\x) = 0$, in bounded or unbounded multiply-connected domains. We consider both Dirichlet…
The fractional Laplacian $(-\Delta)^{\alpha/2}$ is a non-local operator which depends on the parameter $\alpha$ and recovers the usual Laplacian as $\alpha \to 2$. A numerical method for the fractional Laplacian is proposed, based on the…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
In this paper, we introduce and analyze arbitrarily high-order quadrature rules for evaluating the two-dimensional singular integrals of the forms \begin{align} I_{i,j} = \int_{\mathbb{R}^2}\phi(x)\frac{x_ix_j}{|x|^{2+\alpha}} \d x, \quad…
Using the shift-operator technique, a compact formula for the Fourier transform of a product of two Slater-type orbitals located on different atomic centers is derived. The result is valid for arbitrary quantum numbers and was found to be…
This paper concerns the fast evaluation of the matvec $g=Kf$ for $K\in \mathbb{C}^{N\times N}$, which is the discretization of the oscillatory integral transform $g(x) = \int K(x,\xi) f(\xi)d\xi$ with a kernel function…
In this paper, on the complex field $\mathbb{C}$, we prove two integral formulae for the Hankel-Mellin transform and the double Fourier-Mellin transform of Bessel functions, both resulting the hypergeometric function. As two applications,…
We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or…
Features in the inflaton potential that are traversed in much less than an e-fold of the expansion can produce observably large non-Gaussianity. In these models first order corrections to the curvature mode function evolution induce effects…
We present a fast and accurate algorithm for the evaluation of nonlocal (long-range) Coulomb and dipole-dipole interactions in free space. The governing potential is simply the convolution of an interaction kernel $U(\bx)$ and a density…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…
We propose an efficient algorithm for the approximation of fractional integrals by using Runge--Kutta based convolution quadrature. The algorithm is based on a novel integral representation of the convolution weights and a special…
A practical and simple stable method for calculating Fourier integrals is proposed, effective both at low and at high frequencies. An approach based on the fruitful idea of Levin, to use of the collocation method to approximate the slowly…
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…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
Highly oscillatory integrals of composite type arise in electronic engineering and their calculations is a challenging problem. In this paper, we propose two Gaussian quadrature rules for computing such integrals. The first one is…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…