Towards a discrete hanke! transform and its applications

摘要

A discrete transform with a Bessel function kernel is defined, as a finite sum, over the zeros of the Bessel function. The approximate inverse of this transform is derived as another finite sum. This development is in parallel to that of the discrete Fourier transform (DFT) which lead to the fast Fourier transform (FFT) algorithm. The discrete Hankel transform with kernel Jo, the Bessel function of the first kind of order zero, will be used as an illustration for deriving the discrete Hankel transform, its inverse and a number of its basic properties. This includes the convolution product which is necessary for solving boundary problems. Other applications include evaluating Hankel transforms, Bessel series and replacing higher dimension Fourier transforms, with circular symmetry, by a single Hankel transform