Foundations of Hankel transform algorithms

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.