Abstract
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.
© 1999 Optical Society of America
Full Article | PDF ArticleCorrections
Qing Huo Liu and Zhong Qing Zhang, "Nonuniform fast Hankel transform (NUFHT) algorithm: errata," Appl. Opt. 39, 1842-1842 (2000)https://opg.optica.org/ao/abstract.cfm?uri=ao-39-11-1842
More Like This
Qing Huo Liu and Zhong Qing Zhang
Appl. Opt. 39(11) 1842-1842 (2000)
Patricia K. Murphy and Neal C. Gallagher
J. Opt. Soc. Am. 73(9) 1130-1137 (1983)
José A. Ferrari, Daniel Perciante, and Alfredo Dubra
J. Opt. Soc. Am. A 16(10) 2581-2582 (1999)