A fast algorithm for computing the Hankel transform of order 1
From MaRDI portal
Publication:3474252
Recommendations
- Fast Hankel transform algorithm
- scientific article; zbMATH DE number 5694280
- Fast computation of zero order Hankel transform
- An efficient and stable algorithm for numerical evaluation of Hankel transforms
- A dual algorithm for fast calculation of the \(H^ 1_ 0\)-transform
- Algorithms to numerically evaluate the Hankel transform
- An algorithm for the numerical evaluation of the Hankel and Abel transforms
- An algorithm for fast Hilbert transform of real functions
- Fast Laguerre projection method for finite Hankel transform of arbitrary order
- Fast discrete cosine transform algorithm for Hankel matrices
Cited in
(10)- Fast computation of zero order Hankel transform
- Fast Hankel transform by fast sine and cosine transforms: The Mellin connection
- A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
- scientific article; zbMATH DE number 5694280 (Why is no real title available?)
- An algorithm for the numerical evaluation of the Hankel and Abel transforms
- Fast Hankel transform algorithm
- An algorithm for fast Hilbert transform of real functions
- Fast Laguerre projection method for finite Hankel transform of arbitrary order
- Fractionalization of a discrete Hankel transform based on an involutory symmetric kernel matrix
- Matrix-based evaluation of the fractional Hankel transform by Bessel series expansion
This page was built for publication: A fast algorithm for computing the Hankel transform of order 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474252)