Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Liu et al. (1999) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: