Comparing the Performance of Four Sinc Methods for Numerical Indefinite Integration

Aims/ Objectives: To compare the performance of four Sinc methods for the numerical approximation of indefinite integrals with algebraic or logarithmic end-point singularities.

Methodology: The first two quadrature formulas were proposed by Haber based on the sinc method, the third is Stengers Single Exponential (SE) formula and Tanaka et al.s Double Exponential (DE) sinc method completes the number. Furthermore, an application of the four quadrature formulas on numerical examples, reveals convergence to the exact solution by Tanaka et al.s DE sinc method than by the other three formulae. In addition, we compared the CPU time of the four quadrature methods which was not done in an earlier work by the same author.

Conclusion: Haber formula A is the fastest as revealed by the CPU time.