QUADPACK

Software library for numerical integration From Wikipedia, the free encyclopedia

QUADPACK is a FORTRAN 77 library for numerical integration (quadrature) of one-dimensional functions.[2] It was included in the SLATEC Common Mathematical Library and is therefore in the public domain.[3] The individual subprograms are also available on netlib.[4]

Original authorsRobert Piessens
Elise deDoncker-Kapenga
Christoph W. Überhuber
David Kahaner
Initial releaseMay 1981 (1981-05)
Stable release
11 October 2021[1]
Written inFORTRAN 77
Quick facts Original authors, Initial release ...
QUADPACK
Original authorsRobert Piessens
Elise deDoncker-Kapenga
Christoph W. Überhuber
David Kahaner
Initial releaseMay 1981 (1981-05)
Stable release
11 October 2021[1]
Written inFORTRAN 77
TypeLibrary
LicensePublic domain
Websitenines.cs.kuleuven.be/software/QUADPACK/
Close

The GNU Scientific Library reimplemented the QUADPACK routines in C. SciPy provides a Python interface to part of QUADPACK.[5][6]

Routines

The main focus of QUADPACK is on automatic integration routines in which the user inputs the problem and an absolute or relative error tolerance and the routine attempts to perform the integration with an error no larger than that requested. There are nine such automatic routines in QUADPACK, in addition to a number of non-automatic routines. All but one of the automatic routines use adaptive quadrature.[7]

More information Prefix, if present, 1st letter ...
Summary of naming scheme for automatic routines[8]
Prefix, if present 1st letter2nd letter3rd letter4th letter, if present suffix
DDouble precision
QQuadrature
NNon-adaptive
AAdaptive
GGeneral integrand
WWeight function of specified form
Simple integrator
SSingularities handled
PSpecified points of local difficulty (singularities, discontinuities …)
IInfinite interval
OOscillatory weight function (cos or sin) over a finite interval
FFourier transform (cos or sin)
CCauchy principal value
basic version
Eextended parameter choices
Close

General-purpose routines

The two general-purpose routines most suitable for use without further analysis of the integrand are QAGS for integration over a finite interval and QAGI for integration over an infinite interval.[7] These two routines are used in GNU Octave (the quad command)[5] and R (the integrate function).[9]

QAGS
uses global adaptive quadrature based on 21-point Gauss–Kronrod quadrature within each subinterval, with acceleration by Peter Wynn's epsilon algorithm.[7][10]
QAGI
is the only general-purpose routine for infinite intervals, and maps the infinite interval onto the semi-open interval (0,1] using a transformation then uses the same approach as QAGS, except with 15-point rather than 21-point Gauss–Kronrod quadrature.[2] For an integral over the whole real line, the transformation used is :[2] This is not the best approach for all integrands: another transformation may be appropriate, or one might prefer to break up the original interval and use QAGI only on the infinite part.[7]

Brief overview of the other automatic routines

QNG
simple non-adaptive integrator
QAG
simple adaptive integrator
QAGP
similar to QAGS but allows user to specify locations of internal singularities, discontinuities etc.
QAWO
integral of cos(ωx) f(x) or sin(ωx) f(x) over a finite interval
QAWF
Fourier transform
QAWS
integral of w(x) f(x) from a to b, where f is smooth and w(x) = (xa)α (bx)β logk(xa) logl(bx), with k, l = 0 or 1 and α, β > –1
QAWC
Cauchy principal value of the integral of f(x)/(xc) for user-specified c and f [2]

See also

References

Further reading

Related Articles

Wikiwand AI