Abstract

The method originally proposed by Siegman [ Opt. Lett. 1, 13 ( 1977)] for evaluating numerically the Hankel transform by fast-Fourier-transform techniques is reconsidered. A novel analytical form is found that permits a numerical computation of the Hankel transform with accuracy comparable with that of Siegman’s approach without lower-end corrections; but for simplicity and numerical efficiency the original approach remains unsurpassed.

© 1993 Optical Society of America

Numerical evaluation of Hankel transforms for oscillating functions

Joanne Markham and José-Angel Conchello
J. Opt. Soc. Am. A 20(4) 621-630 (2003)

Fast Hankel transform of order zero

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

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)

Improved algorithm for the quasi-discrete Hankel transform

Aleksey Malinka
J. Opt. Soc. Am. A 38(3) 401-404 (2021)