Fast Hankel transform algorithm
From MaRDI portal
Publication:3757346
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
Cited in
(17)- Accurate FFT-based Hankel transforms for predictions of outdoor sound propagation
- Fast discrete finite Hankel transform for equations in a thin annulus
- A fast Hermite transform
- A wavelet algorithm for Fourier-Bessel transform arising in optics
- 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
- scientific article; zbMATH DE number 5694280 (Why is no real title available?)
- 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)