Fast computation of zero order Hankel transform
From MaRDI portal
An algorithm for numerical evaluation of zero order Hankel transform is developed. The method involves one FFT evaluation and a summation of the interpolated FFT components. It compares favorably with other available techniques with regard to speed, accuracy, and ease of usage.
Recommendations
Cites work
- Computation of the Hankel transform using projections
- Dual algorithms for fast calculation of the Fourier-Bessel transform
- scientific article; zbMATH DE number 3162148 (Why is no real title available?)
- Numerical evaluation of Hankel transforms via Gaussian-Laguerre polynomial expansions
- Numerical Fourier and Bessel transforms in logarithmic variables
Cited in
(13)- A dual algorithm for fast calculation of the \(H^ 1_ 0\)-transform
- An improved method for computing a discrete Hankel transform
- Numerical evaluation of the Hankel transform
- Fast Hankel transforms algorithm based on kernel function interpolation with exponential functions
- Algorithms to numerically evaluate the Hankel transform
- Fast Hankel transform by fast sine and cosine transforms: The Mellin connection
- Accurate FFT-based Hankel transforms for predictions of outdoor sound propagation
- A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
- A fast algorithm for computing the Hankel transform of order 1
- scientific article; zbMATH DE number 5694280 (Why is no real title available?)
- Fast Hankel transform algorithm
- An algorithm for computing zero-order generalized Hankel-Clifford transforms
- Matrix-based evaluation of the fractional Hankel transform by Bessel series expansion
This page was built for publication: Fast computation of zero order Hankel transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061472)