Abstract
This paper describes computer subroutines which were developed to compute Bessel functions of the first and second kind ( J n ( z) and Y n ( z), respectively) for a complex argument z and a range of integer orders. A novel way of determ ining the starting point of backward recurrence is used, and the algorithm for Y n ( z) improves on previous algorithms in terms of accuracy and restrictions on the range of orders.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.