Abstract

In the present contribution, we develop an efficient algorithm for the recursive computation of the G n ( 1 ) transformation for the approximation of infinite-range integrals. Previous to this contribution, the theoretically powerful G n ( 1 ) transformation was handicapped by the lack of an algorithmic implementation. Our proposed algorithm removes this handicap by introducing a recursive computation of the successive G n ( 1 ) transformations with respect to the order n. This recursion, however, introduces the ( x 2 d d x ) operator applied to the integrand. Consequently, we employ the Slevinsky–Safouhi formula I for the analytical and numerical developments of these required successive derivatives. Incomplete Bessel functions, which pose as a numerical challenge, are computed to high pre-determined accuracies using the developed algorithm. The numerical results obtained show the high efficiency of the new method, which does not resort to any numerical integration in the computation.

Full Text
Paper version not known

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 call

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.