A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
From MaRDI portal
Abstract: A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order as well as evaluating Schl"{o}milch and Fourier--Bessel expansions in operations. The algorithm is based on an asymptotic expansion for Bessel functions of large arguments, the fast Fourier transform, and the Neumann addition formula. All the algorithmic parameters are selected from error bounds to achieve a near-optimal computational cost for any accuracy goal. Numerical results demonstrate the efficiency of the resulting algorithm.
Recommendations
- An improved method for computing a discrete Hankel transform
- A unified framework for asymptotic analysis and computation of finite Hankel transform
- Fast discrete finite Hankel transform for equations in a thin annulus
- Fast discrete extrapolation via the fast Hartley transform
- Asymptotic expansions and fast computation of oscillatory Hilbert transforms
- Fast Hankel transform algorithm
- A fast algorithm for computing the Hankel transform of order 1
- Asymptotic expansions of modified Hankel transform
- An efficient and stable algorithm for numerical evaluation of Hankel transforms
- Fast discrete cosine transform algorithm for Hankel matrices
Cites work
- A Fast Algorithm for the Evaluation of Legendre Expansions
- A Fourier Bessel transform method for efficiently calculating the magnetic field of solenoids
- A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula
- Algorithm 644
- Algorithms to numerically evaluate the Hankel transform
- An algorithm for the convolution of Legendre series
- An algorithm for the rapid evaluation of special function transforms
- An improved method for computing a discrete Hankel transform
- Approximation for Bessel functions and their application in the computation of Hankel transforms
- Bounds for Zeros of Some Special Functions
- Dual algorithms for fast calculation of the Fourier-Bessel transform
- Fast Algorithms for Spherical Harmonic Expansions
- Fast algorithms for spherical harmonic expansions. II.
- Fast computation of zero order Hankel transform
- NIST handbook of mathematical functions
- Numerical evaluation of spherical Bessel transforms via fast Fourier transforms
- The fast Hankel transform as a tool in the solution of the time dependent Schrödinger equation
- The transforms and applications handbook
Cited in
(10)- Fast discrete finite Hankel transform for equations in a thin annulus
- Reducing dimensionality to model 2D rotating and standing waves in a delayed nonlinear optical system with thin annulus aperture
- Computing with functions in spherical and polar geometries. II: The disk
- Fast Expansion into Harmonics on the Disk: A Steerable Basis with Fast Radial Convolutions
- A nonuniform fast Hankel transform
- Fast adaptive Fourier integration for spectral densities of Gaussian processes
- An improved method for computing a discrete Hankel transform
- Interpolative Decomposition Butterfly Factorization
- Interpolative butterfly factorization
- A unified framework for asymptotic analysis and computation of finite Hankel transform
This page was built for publication: A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945408)