✦ LIBER ✦

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

✍ Scribed by Murphy, Patricia K.; Gallagher, Neal C.

Book ID: 115385680
Publisher: Optical Society of America
Year: 1983
Weight: 798 KB
Volume: 73
Category: Article
ISSN: 0030-3941
DOI: 10.1364/JOSA.73.001130

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast computation of zero order Hankel tr

Fast computation of zero order Hankel transform

✍ K. Gopalan; C.S. Chen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 442 KB

## An algorithmfor numerical evaluation ofzero order Hankel transform is developed. The method involves one FFT evaluation and a summation of the interpolated FFT components. It comparesfavorably with other available techniques with regard to speed, accuracy, and ease of usage.

Fast Hankel transform of order zero

✍ Ferrari, José A. 📂 Article 📅 1995 🏛 Optical Society of America 🌐 English ⚖ 229 KB

A fast algorithm for computing the Hanke

A fast algorithm for computing the Hankel transform of order 1

✍ Hee Joon Kim 📂 Article 📅 1989 🏛 IEEE ⚖ 320 KB

Nonuniform fast Hankel transform (NUFHT)

Nonuniform fast Hankel transform (NUFHT) algorithm

✍ Liu, Qing Huo ;Zhang, Zhong Qing 📂 Article 📅 1999 🏛 The Optical Society 🌐 English ⚖ 87 KB

An algorithm for computing general integ

An algorithm for computing general integer-order Hankel transforms

✍ Higgins, W.; Munson, D., Jr. 📂 Article 📅 1987 🏛 IEEE ⚖ 926 KB

Nonuniform fast Hankel transform (NUFHT)

Nonuniform fast Hankel transform (NUFHT) algorithm: errata

✍ Liu, Qing Huo ;Zhang, Zhong Qing 📂 Article 📅 2000 🏛 The Optical Society 🌐 English ⚖ 37 KB