DocumentCode :
1114915
Title :
Rapid evaluation of integer-order Bessel functions using an FFT algorithm
Author :
Nachamkin, Jack ; Hoffman, Donald C.
Author_Institution :
OLAC, Edwards AFB, CA, USA
Volume :
33
Issue :
6
fYear :
1991
Firstpage :
33
Lastpage :
35
Abstract :
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.<>
Keywords :
Bessel functions; fast Fourier transforms; FFT algorithm; fast Fourier transform algorithm; integer-order Bessel functions; numerical evaluation; Algorithm design and analysis; Fast Fourier transforms; Fourier transforms; Geometry; Integral equations; Iterative algorithms; Iterative methods; Lifting equipment; Missiles; Sampling methods;
fLanguage :
English
Journal_Title :
Antennas and Propagation Magazine, IEEE
Publisher :
ieee
ISSN :
1045-9243
Type :
jour
DOI :
10.1109/74.107354
Filename :
107354
Link To Document :
بازگشت