Fast Hankel Transforms Algorithm Based on Kernel Function Interpolation with Exponential Functions

The Pravin method for Hankel transforms is based on the decomposition of kernel function with exponential function. The defect of such method is the difficulty in its parameters determination and lack of adaptability to kernel function especially using monotonically decreasing functions to approximate the convex ones. This thesis proposed an improved scheme by adding new base function in interpolation procedure. The improved method maintains the merit of Pravin method which can convert the Hankel integral to algebraic calculation. The simulation results reveal that the improved method has high precision, high efficiency, and good adaptability to kernel function. It can be applied to zero-order and first-order Hankel transforms.