The QAWO algorithm is designed for integrands with an oscillatory factor, sin(wx) or cos(wx). In order to work efficiently the algorithm requires a table of Chebyshev moments which must be pre-computed with calls to the functions below. This function uses an adaptive algorithm to compute the integral of f over (a, b) with the weight function sin(wx) or cos(wx) defined by the table wf:

                       b                                   b
            I = Integral dx f(x) sin(wt)   or   I = Integral dx f(x) cos(wx)
                       a                                   a

The results are extrapolated using the epsilon-algorithm to accelerate the convergence of the integral. The function returns the final approximation from the extrapolation, result, and an estimate of the absolute error, abserr. The subintervals and their results are stored in the memory provided by workspace. The maximum number of subintervals is given by limit, which may not exceed the allocated size of the workspace. Those subintervals with "large" widths d where dw > 4 are computed using a 25-point Clenshaw-Curtis integration rule, which handles the oscillatory behavior. Subintervals with a "small" widths where dw < 4 are computed using a 15-point Gauss-Kronrod integration.

Ref.: Gnu Scientific library reference manual ()