LAGUERRE_EXACTNESS is a C++ program which investigates the polynomial exactness of a Gauss-Laguerre quadrature rule for the semi-infinite interval [0,+oo) or [A,+oo).
Standard Gauss-Laguerre quadrature assumes that the integrand we are considering has a form like:
Integral ( A <= x < +oo ) exp(-x) f(x) dxwhere the factor exp(-x) is regarded as a weight factor.
A standard Gauss-Laguerre quadrature rule is a set of n positive weights w and abscissas x so that
Integral ( A <= x < +oo ) exp(-x) f(x) dxmay be approximated by
Sum ( 1 <= I <= N ) w(i) * f(x(i))
It is often convenient to consider approximating integrals in which the weighting factor exp(-x) is implicit. In that case, we are looking at approximating
Integral ( A <= x < +oo ) f(x) dxand it is easy to modify a standard Gauss-Laguerre quadrature rule to handle this case directly.
A modified Gauss-Laguerre quadrature rule is a set of n positive weights w and abscissas x so that
Integral ( A <= x < +oo ) f(x) dxmay be approximated by
Sum ( 1 <= I <= N ) w(i) * f(x(i))
When using a Gauss-Laguerre quadrature rule, it's important to know whether the rule has been developed for the standard or modified cases. Basically, the only change is that the weights of the modified rule have been multiplied by an exponential factor evaluated at the corresponding abscissa.
For a standard Gauss-Laguerre rule, polynomial exactness is defined in terms of the function f(x). That is, we say the rule is exact for polynomials up to degree DEGREE_MAX if, for any polynomial f(x) of that degree or less, the quadrature rule will produce the exact value of
Integral ( 0 <= x < +oo ) exp(-x) f(x) dx
For a modified Gauss-Laguerre rule, polynomial exactness is defined in terms of the function f(x) divided by the implicit weight function. That is, we say a modified Gauss-Laguerre rule is exact for polynomials up to degree DEGREE_MAX if, for any integrand f(x) with the property that exp(+x) * f(x) is a polynomial of degree no more than DEGREE_MAX, the quadrature rule will product the exact value of:
Integral ( 0 <= x < +oo ) f(x) dx
The program starts at DEGREE = 0, and then proceeds to DEGREE = 1, 2, and so on up to a maximum degree DEGREE_MAX specified by the user. At each value of DEGREE, the program generates the corresponding monomial term, applies the quadrature rule to it, and determines the quadrature error. The program uses a scaling factor on each monomial so that the exact integral should always be 1; therefore, each reported error can be compared on a fixed scale.
If the program understands that the rule being considered is a modified rule, then the monomials are multiplied by exp(-x) when performing the exactness test.
Since
Integral ( 0 <= x < +oo ) exp(-x) x^{n} dx = n!our test monomial functions, in order to integrate to 1, will be normalized to:
Integral ( 0 <= x < +oo ) exp(-x) x^{n} / n! dxIt should be clear that accuracy will be rapidly lost as n increases.
The program is very flexible and interactive. The quadrature rule is defined by three files, to be read at input, and the maximum degree top be checked is specified by the user as well.
Note that the three files that define the quadrature rule are assumed to have related names, of the form
The exactness results are written to an output file with the corresponding name:
laguerre_exactness prefix degree_max optionwhere
If the arguments are not supplied on the command line, the program will prompt for them.
The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.
LAGUERRE_EXACTNESS is available in a C version and a C++ version and a FORTRAN77 version and a FORTRAN90 version and a MATLAB version.
EXACTNESS, a C++ library which investigates the exactness of quadrature rules that estimate the integral of a function with a density, such as 1, exp(-x) or exp(-x^2), over an interval such as [-1,+1], [0,+oo) or (-oo,+oo).
HERMITE_EXACTNESS, a C++ program which tests the polynomial exactness of Gauss-Hermite quadrature rules.
INT_EXACTNESS, a C++ program which tests the polynomial exactness of a quadrature rule for a finite interval.
INT_EXACTNESS_CHEBYSHEV1, a C++ program which tests the polynomial exactness of Gauss-Chebyshev type 1 quadrature rules.
INT_EXACTNESS_CHEBYSHEV2, a C++ program which tests the polynomial exactness of Gauss-Chebyshev type 2 quadrature rules.
INT_EXACTNESS_GEGENBAUER, a C++ program which tests the polynomial exactness of Gauss-Gegenbauer quadrature rules.
INT_EXACTNESS_GEN_HERMITE, a C++ program which tests the polynomial exactness of a generalized Gauss-Hermite quadrature rule.
INT_EXACTNESS_GEN_LAGUERRE, a C++ program which tests the polynomial exactness of a generalized Gauss-Laguerre quadrature rule.
INT_EXACTNESS_JACOBI, a C++ program which tests the polynomial exactness of a Gauss-Jacobi quadrature rule.
LAGUERRE_RULE, a C++ program which can generate a Gauss-Laguerre quadrature rule on request.
LAGUERRE_TEST_INT, a C++ library which defines test integrands for integration over [A,+oo).
LEGENDRE_EXACTNESS, a C++ program which tests the monomial exactness of quadrature rules for the Legendre problem of integrating a function with density 1 over the interval [-1,+1].
You can go up one level to the C++ source codes.