Abstract
The concept of modification used for accelerating the convergence of ordinary continued fractions is adapted to the case of the Gautschi–Aggarwal–Burgmeier algorithm for the computation of nondominant solutions of nonhomogeneous second-order linear recurrence relations.
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.
