Abstract

An analytical form is presented that provides a clear and computationally efficient algorithm for numerically evaluating the Hankel transform of order zero by fast-Fourier-transform techniques.

© 1995 Optical Society of America

Full Article  |  PDF Article
Related Articles
Fast Hankel transform of nth order

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

Zero-order Hankel transformation algorithms based on Filon quadrature philosophy for diffraction optics and beam propagation

Richard Barakat, Elaine Parshall, and Barbara H. Sandler
J. Opt. Soc. Am. A 15(3) 652-659 (1998)

Numerical evaluation of the Hankel transform: remarks

A. Agnesi, G. C. Reali, G. Patrini, and A. Tomaselli
J. Opt. Soc. Am. A 10(9) 1872-1874 (1993)

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Equations (3)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Metrics

You do not have subscription access to this journal. Article level metrics are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription