Referenced Items are not available for this document.
The efficiency and accuracy of a few available algorithms for the computation of integer-order Bessel functions are considered. First, the computation of integer-order Bessel functions of the first kind, using the fast Fourier transform (FFT) algorithm as opposed to recurrence techniques, is investigated. It is shown that recurrence techniques are superior to the FFT technique, both in accuracy and speed. An algorithm suggested in the literature and used in commercially available software, specifically MATLAB 3.5 and MATHEMATICA 1.2, for computing integer-order Bessel functions of the second kind is revealed to be erroneous by comparing these routines with an algorithm developed by the author. It is shown that catastrophic errors result from using the erroneous algorithm to compute high-order Bessel functions with nonreal arguments.<
Published in:
Antennas and Propagation Magazine, IEEE
(Volume:35
,
Issue:
3
)
Date of Publication: June 1993
- Page(s):
- 19 - 25
- ISSN :
- 1045-9243
- INSPEC Accession Number:
- 4473338
- Digital Object Identifier :
- 10.1109/74.250131
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- June 1993
- Sponsored by :
- IEEE Antennas and Propagation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
