Nonuniform fast Hankel transform (NUFHT) algorithm.
We investigate the fast computation of Hankel transforms on a set of nonuniformly spaced sample points. Previous fast Hankel transform (FHT) algorithms require the sample points to distribute uniformly in a logarithmic scale. This limitation is removed here by the use of the newly developed, to our knowledge, nonuniform fast Fourier transform algorithm. The resulting nonuniform FHT algorithm has a much higher accuracy than the previous FHT algorithms and provides important flexibility in many applications.
Volume / Issue
Start / End Page
Pubmed Central ID
Electronic International Standard Serial Number (EISSN)
International Standard Serial Number (ISSN)
Digital Object Identifier (DOI)