Foundations of Hankel transform algorithms
Open Access
- 1 January 1991
- journal article
- Published by American Mathematical Society (AMS) in Quarterly of Applied Mathematics
- Vol. 49 (2) , 267-279
- https://doi.org/10.1090/qam/1106392
Abstract
A brief survey of existing Hankel (Fourier-Bessel) transform algorithms is presented along with a natural way to classify these algorithms. In several cases these algorithms were derived originally by methods that were unnecessarily complicated and not sufficiently general. By using operator notation and Radon transform methods, derivations and generalizations are straightforward. These improvements and generalizations are given at the appropriate places in the discussion.Keywords
This publication has 33 references indexed in Scilit:
- Fast Nth-order Hankel transform algorithmIEEE Transactions on Signal Processing, 1991
- An algorithm for computing general integer-order Hankel transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Fast Hankel transform algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- Algorithm 588: Fast Hankel Transforms Using Related and Lagged ConvolutionsACM Transactions on Mathematical Software, 1982
- Fast Hankel Transforms Using Related and Lagged ConvolutionsACM Transactions on Mathematical Software, 1982
- An algorithm for the Fourier-Bessel transformComputer Physics Communications, 1981
- Computation of the Hankel transform using projectionsThe Journal of the Acoustical Society of America, 1980
- Theoretical and numerical Green’s function field solution in a plane multilayered mediumThe Journal of the Acoustical Society of America, 1980
- Tables for the Rapid and Accurate Numerical Evaluation of Certain Infinite Integrals Involving Bessel FunctionsMathematical Tables and Other Aids to Computation, 1957
- Note on a method for computing infinite integrals of oscillatory functionsMathematical Proceedings of the Cambridge Philosophical Society, 1956