Evaluation of some algorithms and programs for the computation of integer-order Bessel functions of the first and second kind with complex arguments

Simple item page
dc.contributor.authorDu Toit C.F.
dc.date.accessioned2011-05-15T15:59:16Z
dc.date.available2011-05-15T15:59:16Z
dc.date.issued1993
dc.description.abstractThe purpose of this article is to provide some insight on the efficiency and accuracy of a few available algorithms for the computation of integer-order Bessel functions. First, the computation of integer-order Bessel functions of the first kind (Jn(z)), 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 efficiency. Second, an erroneous algorithm, suggested in the literature and used by commercially available software, specially MATLAB 3.5 and MATHEMATICA 1.2, for computing integer-order Bessel functions of the second kind (Yn(z)), is revealed by comparing these routines with an algorithm developed by the author. Catastrophic errors result from the use of the erroneous algorithm, for the computation of large orders with non-real arguments.
dc.description.versionArticle
dc.identifier.citationIEEE Antennas and Propagation Magazine
dc.identifier.citation35
dc.identifier.citation3
dc.identifier.issn10459243
dc.identifier.other10.1109/74.250131
dc.identifier.urihttp://hdl.handle.net/10019.1/11092
dc.subjectAlgorithms
dc.subjectAntennas
dc.subjectFast Fourier transforms
dc.subjectAntenna design
dc.subjectBessel functions
dc.subjectErroneous algorithms
dc.subjectMathematical techniques
dc.titleEvaluation of some algorithms and programs for the computation of integer-order Bessel functions of the first and second kind with complex arguments
dc.typeArticle
Files
Collections
Stellenbosch University - Scopus Publications