Rapid evaluation of integer-order Bessel functions using an FFT algorithm

A rapid, accurate, and stable method for computing integer-order Bessel functions is presented. In contrast to the iterative procedures normally used in the numerical evaluation of Bessel functions, this approach requires little more than a commonly available fast Fourier transform algorithm, and yet, for a given argument, can provide many J/sub n/s in a single pass.<
>