Premium
The fast Hankel transform 1
Author(s) -
Mohsen Adel A.,
Hashish E.A.
Publication year - 1994
Publication title -
geophysical prospecting
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.735
H-Index - 79
eISSN - 1365-2478
pISSN - 0016-8025
DOI - 10.1111/j.1365-2478.1994.tb00202.x
Subject(s) - hankel transform , bessel function , fourier transform , cyclotomic fast fourier transform , bessel filter , filter (signal processing) , discrete fourier transform (general) , algorithm , order (exchange) , function (biology) , mathematics , computer science , fourier analysis , mathematical analysis , fractional fourier transform , classical orthogonal polynomials , gegenbauer polynomials , evolutionary biology , computer vision , orthogonal polynomials , biology , finance , economics
An efficient algorithm is presented to compute the Hankel transform. The algorithm yields simultaneously all the required weights for a given order of the Bessel function using the fast Fourier transform. An additional shift is introduced to the filter abscissa besides Koefoed's shift to give a better filter performance.