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

Nonuniform fast Hankel transform (NUFHT) algorithm: errata

Qing Huo Liu and Zhong Qing Zhang
Appl. Opt. 39(11) 1842-1842 (2000)

Fast algorithm for the computation of the zero-order Hankel transform

Patricia K. Murphy and Neal C. Gallagher
J. Opt. Soc. Am. 73(9) 1130-1137 (1983)

Fast Hankel transform of nth order

José A. Ferrari, Daniel Perciante, and Alfredo Dubra
J. Opt. Soc. Am. A 16(10) 2581-2582 (1999)

Quasi fast Hankel transform

A. E. Siegman
Opt. Lett. 1(1) 13-15 (1977)

Fast Hankel transform of nth order with improved performance

César D. Perciante and José A. Ferrari
J. Opt. Soc. Am. A 21(9) 1811-1812 (2004)