Adaptive integration on infinite interval (-Infinity,+Infinity).

Adaptive integration on semi-infinite interval (-Infinity,b).

Adaptive integration.

Adaptive integration on semi-infinite interval (a,+Infinity).

Adaptive integration with known singular points.

Adaptive integration with singularities.

Adaptive integration for Cauchy principal values.

QAWF adaptive integration for Fourier integrals.

QAWO adaptive integration for oscillatory functions

Computes the 12-th order and 24-th order Chebyshev approximations to f(x) on [a,b].

Base class for all Kronrod algorithms.

The QNG algorithm is a non-adaptive procedure which uses fixed Gauss-Kronrod abscissae to sample the integrand at a maximum of 87 points. It is provided for fast integration of smooth functions.