论文信息 - Simultaneous calculation of Fourier-bessel transforms up to order N

Simultaneous calculation of Fourier-bessel transforms up to order N

Abstract In many practical applications it is necessary to calculate the first N Fourier-Bessel transforms. This paper describes procedures allowing the simultaneous evaluation of these transforms. The calculation involves a basic one-dimensional Fourier transform, repeated selection of suitable Fourier components followed by successive evaluation of Fourier series coefficients. Determination of L samples of the first N Fourier-Bessel transforms requires of the order of 2 LN log 2 N operations and this number is comparable to the operation count corresponding to a two-dimensional discrete Fourier transform.

S. Candel | Sébastien Candel

[1] S. Candel,et al. An algorithm for the Fourier-Bessel transform , 1981 .

[2] E. O. Brigham,et al. The Fast Fourier Transform , 1967, IEEE Transactions on Systems, Man, and Cybernetics.

[3] W. W. Bell,et al. Special Functions for Scientists and Engineers , 1968 .

[4] S. Sheng. Studies of laser resonators and beam propagation using fast transform methods , 1980 .

[5] A. Oppenheim,et al. Computation of the Hankel transform using projections , 1980 .

[6] S. Candel,et al. Dual algorithms for fast calculation of the Fourier-Bessel transform , 1981 .

[7] A. Siegman. Quasi fast Hankel transform. , 1977, Optics letters.

[8] E. Cavanagh,et al. Numerical evaluation of Hankel transforms via Gaussian-Laguerre polynomial expansions , 1979 .

[9] J. D. Talman,et al. Numerical Fourier and Bessel transforms in logarithmic variables , 1978 .

[10] J. Nachamkin,et al. A fourier bessel transform method for efficiently calculating the magnetic field of solenoids , 1980 .