✦ LIBER ✦

A fast algorithm for computing the Hankel transform of order 1

✍ Scribed by Hee Joon Kim

Book ID: 117865449
Publisher: IEEE
Year: 1989
Weight: 320 KB
Volume: 37
Category: Article
ISSN: 0096-3518
DOI: 10.1109/29.31279

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithm for the computation of th

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

✍ Murphy, Patricia K.; Gallagher, Neal C. 📂 Article 📅 1983 🏛 Optical Society of America ⚖ 798 KB

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

Fast Hankel transform of nth order

✍ Ferrari, José A.; Perciante, Daniel; Dubra, Alfredo 📂 Article 📅 1999 🏛 Optical Society of America 🌐 English ⚖ 94 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

Fast Hankel transform of nth order with

Fast Hankel transform of nth order with improved performance

✍ Perciante, César D.; Ferrari, José A. 📂 Article 📅 2004 🏛 Optical Society of America 🌐 English ⚖ 101 KB