Abstract
A new technique of accurate stable computation of sequences satisfying non-homogeneous three term recurrence relations is presented. A decomposition system consisting of one non-linear and two linear first order recurrence relations is obtained. Forward or backward recursion directions of the linear relations provide additional flexibility in computation. This leads to an integrated system of three algorithms which can accurately compute the desired solution in each region of the solution set to the original second order relations. Applications are well known and numerical examples include Bessel functions of the second kind, Anger-Weber functions, and Lommel functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
