QUADRATURE_WEIGHTS_VANDERMONDE
Quadrature Weights by Vandermonde Matrix

QUADRATURE_WEIGHTS_VANDERMONDE is a C++ library which illustrates a method for computing the weights of a quadrature rule, assuming that the points have been specified, by setting up a linear system involving the Vandermonde matrix.

We assume that the abscissas (quadrature points) have been chosen, that the interval [A,B] is known, and that the integrals of polynomials of degree 0 through N-1 can be computed. The examples here use a finite interval and a unit weight function, but the method can easily be extended to non-finite intervals and non-unit weight functions.

The Vandermonde Matrix

We assume that the quadrature formula approximates integrals of the form:

        I(F) = Integral ( A <= X <= B ) F(X) dX 
      

        Q(F) = Sum ( 1 <= I <= N ) W(I) * F(X(I))
      

Now let us assume that the points X have been specified, but that the corresponding values W remain to be determined.

If we require that the quadrature rule with N points integrates the first N monomials exactly, then we have N conditions on the weights W.

The I-th condition, for the monomial X^(I-1), has the form:

        W(1)*X(1)^(I-1) + W(2)*X(2)^(I-1)+...+W(N)*X(N)^(I-1) = (B^I-A^I)/I.
      

The corresponding matrix is known as the Vandermonde matrix. It is theoretically guaranteed to be nonsingular as long as the X's are distinct, but its condition number grows quickly with N. Therefore, this simple, direct approach is often abandoned when more accuracy or high order rules are needed.

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

QUADRATURE_WEIGHTS_VANDERMONDE is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version.

Related Data and Programs:

CLENSHAW_CURTIS_RULE, a C++ program which defines a Clenshaw Curtis quadrature rule.

QUADRATURE_LEAST_SQUARES, a C++ library which computes weights for "sub-interpolatory" quadrature rules, that is, it estimates integrals by integrating a polynomial that approximates the function data in a least squares sense.

QUADRATURE_GOLUB_WELSCH, a C++ library which computes the points and weights of a Gaussian quadrature rule using the Golub-Welsch procedure, assuming that the points have been specified.

QUADRATURE_WEIGHTS_VANDERMONDE_2D, a C++ library which computes the weights of a 2D quadrature rule using the Vandermonde matrix, assuming that the points have been specified.

QUADRULE, a C++ library which defines quadrature rules for 1-dimensional domains.

TOMS655, a C++ library which computes the weights for interpolatory quadrature rule;
this library is commonly called IQPACK;
this is a FORTRAN90 version of ACM TOMS algorithm 655.

Reference:

1. Philip Davis, Philip Rabinowitz,
   Methods of Numerical Integration,
   Second Edition,
   Dover, 2007,
   ISBN: 0486453391,
   LC: QA299.3.D28.
2. Sylvan Elhay, Jaroslav Kautsky,
   Algorithm 655: IQPACK, FORTRAN Subroutines for the Weights of Interpolatory Quadrature,
   ACM Transactions on Mathematical Software,
   Volume 13, Number 4, December 1987, pages 399-415.
3. Jaroslav Kautsky, Sylvan Elhay,
   Calculation of the Weights of Interpolatory Quadratures,
   Numerische Mathematik,
   Volume 40, 1982, pages 407-422.

Source Code:

• qwv.cpp, the source code.
• qwv.hpp, the include file.

Examples and Tests:

• qwv_test.cpp, a sample calling program.
• qwv_test.txt, the output file.

List of Routines:

• I4VEC_ZERO_NEW creates and zeroes an I4VEC.
• QWV computes quadrature weights using the Vandermonde matrix.
• R8_ABS returns the absolute value of an R8.
• R8MAT_PRINT prints an R8MAT.
• R8MAT_PRINT_SOME prints some of an R8MAT.
• R8MAT_SOLVE2 computes the solution of an N by N linear system.
• R8VEC_EVEN_NEW returns an R8VEC of values evenly spaced between ALO and AHI.
• R8VEC_PRINT prints an R8VEC.
• R8VEC_ZERO_NEW creates and zeroes an R8VEC.
• TIMESTAMP prints the current YMDHMS date as a time stamp.

You can go up one level to the C++ source codes.