By Topic

Comments ''Rapid evaluation of integer-order Bessel functions using an FFT algorithm'' (and reply)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Miller, E.K. ; Los Alamos Nat. Lab., NM, USA ; Nachamkin, J.

The commenter disagrees with a statement by J. Nachamkin and D.C. Hoffman (see ibid., vol.33, no.6, p.33-5, Dec. 1991) that complicated procedures are needed to find the initial terms in the recursion relation when backward-recursion techniques are used, and points out that the initial terms required to start backward recursion need not be calculated at J. Nachamkin agrees that in many cases using recursions is better than all the other methods.<>

Published in:

Antennas and Propagation Magazine, IEEE  (Volume:34 ,  Issue: 2 )