Abstract

We outline here a new algorithm for evaluating Hankel (Fourier–Bessel) transforms numerically with enhanced speed, accuracy, and efficiency. A nonlinear change of variables is used to convert the one-sided Hankel transform integral into a two-sided cross-correlation integral. This correlation integral is then evaluated on a discrete sampled basis using fast Fourier transforms. The new algorithm offers advantages in speed and substantial advantages in storage requirements over conventional methods for evaluating Hankel transforms with large numbers of points.

© 1977 Optical Society of America

End correction in the quasi-fast Hankel transform for optical-propagation problems

G. P. Agrawal and M. Lax
Opt. Lett. 6(4) 171-173 (1981)

Quasi-discrete Hankel transform

Li Yu, Meichun Huang, Mouzhi Chen, Wenzhong Chen, Wenda Huang, and Zhizhong Zhu
Opt. Lett. 23(6) 409-411 (1998)

Fast Hankel transform of order zero

José A. Ferrari
J. Opt. Soc. Am. A 12(8) 1812-1813 (1995)

Nonuniform fast Hankel transform (NUFHT) algorithm

Qing Huo Liu and Zhong Qing Zhang
Appl. Opt. 38(32) 6705-6708 (1999)

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)