• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.267-281
• /
• 2022

Herein, an algorithm for efficient evaluation of oscillatory Fourier-integrals with Jacobi-Cauchy type singularities is suggested. This method is based on the use of the traditional Clenshaw-Curtis (CC) algorithms in which the given function is approximated by the truncated Chebyshev series, term by term, and the oscillatory factor is approximated by using Bessel function of the first kind. Subsequently, the modified moments are computed efficiently using the numerical steepest descent method or special functions. Furthermore, Algorithm and programming code in MATHEMATICA^® 9.0 are provided for the implementation of the method for automatic computation on a computer. Finally, selected numerical examples are given in support of our theoretical analysis.