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.
Liu
Q H
QH
Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina 27708, USA. qhliu@ee.duke.edu
Zhang
Z Q
ZQ