Gaussian Quadrature

The Newton-Cotes formulae were of the form

[Maple Math]

where the [Maple Math] were equidistant points in the integration interval

[Maple Math] . The [Maple Math] constants could be constructed such that the formula would be exact for solving polynomials of a degree smaller or equal to [Maple Math] . In fact, formula's with an odd number of points achieve a degree of precision equal to [Maple Math] .

Can one do better by choosing the points [Maple Math] as well? Obviously, this would lead to a formula which can only be used if the function [Maple Math] was known.

If both [Maple Math] and [Maple Math] can be chosen then we have [Maple Math] unknown parameters in the formula. This is the same as the number of coefficients in a polynomial of degree [Maple Math] . Could it be possible that one can determine the [Maple Math] and [Maple Math] such that the formula would be exact for polynomials up to degree [Maple Math] ?

To answer this question, we turn to the theory of vector spaces of functions.

Preliminaries

Theorem 17 (Gaussian Quadrature)

Application

Examples

Integration over (a,b)

>