Fast Hankel transform algorithm
DOI10.1109/TASSP.1985.1164579zbMATH Open0621.65132OpenAlexW2009339644MaRDI QIDQ3757346FDOQ3757346
Publication date: 1985
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tassp.1985.1164579
Recommendations
- A fast algorithm for computing the Hankel transform of order 1
- The Fast Hartley Transform Algorithm
- Fast discrete cosine transform algorithm for Hankel matrices
- Fast computation of zero order Hankel transform
- scientific article; zbMATH DE number 3951888
- Algorithms to numerically evaluate the Hankel transform
- Efficient algorithms to compute Hankel transforms using wavelets
- An efficient and stable algorithm for numerical evaluation of Hankel transforms
- An algorithm for fast Hilbert transform of real functions
- Foundations of Hankel transform algorithms
Fourier transformfast Fourier transformHankel transforminverse transformFourier-Bessel transformAbel transform
Numerical methods for trigonometric approximation and interpolation (65T40) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for integral transforms (65R10) Special integral transforms (Legendre, Hilbert, etc.) (44A15)
Cited In (14)
- A fast Hermite transform
- Efficient algorithms to compute Hankel transforms using wavelets
- A stable algorithm for Hankel transforms using hybrid of Block-pulse and Legendre polynomials
- A fast algorithm for computing the Hankel transform of order 1
- The Fast Hartley Transform Algorithm
- An improved method for computing Hankel transform
- A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
- Algorithms to numerically evaluate the Hankel transform
- An algorithm for fast Hilbert transform of real functions
- Fast Hankel transform by fast sine and cosine transforms: The Mellin connection
- Title not available (Why is that?)
- Fast computation of zero order Hankel transform
- An improved method for computing a discrete Hankel transform
- Structured matrix representations of two-parameter Hankel transforms in adaptive optics
This page was built for publication: Fast Hankel transform algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757346)