Abstract

An analytical form that provides a computationally efficient algorithm for numerical evaluation of the Hankel transform of nth order by fast-Fourier-transform techniques is presented and tested with some well-known functions.

© 1999 Optical Society of America

Full Article  |  PDF Article
OSA Recommended Articles
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)

Fast Hankel transform of order zero

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

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)

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 (5)

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