Link to originalQuadrature
Quadrature is equivalent to numerical integration
Link to originalRoots of Orthogonal Polynomials lemma
Let be orthogonal polynomials for inner product
Then for each
Proof
As
then holds trivially for
Suppose for then
and as is constant then implies
Thus
Hence at least one root in
Suppose there exist points where changes sign
Thenhas the same sign as on
Hence
As is of degree then it must be degree so
However is of exact degree hence number of distinct roots must be
ThusHence has distinct roots in
Link to originalOptimal Choice of Quadrature Points
Quadrature points should be chosen to match exactness of quadrature rule
for polynomials of degree as high as possible
Link to originalQuadrature Weights from Lagrange Interpolation
Let be the quadrature points then
Lagrange Interpolating Polynomials defined as
is unique
So independent of interpolation points and
where
Link to originalExactness of Gaussian Quadrature
Let be the roots of -st degree orthogonal polynomial under
Then Quadrature Formula with weights is exact if
Proof
Let then
By Division Algorithm
So
as first integral is zero by Roots of orthogonal polynomials and other is exact as
Thenas are roots of
Hence
where
Link to originalGauss Quadrature
Let inner product be denoted by
with being a non-negative weight function
point Gauss quadrature approximates
where is the polynomial interpolant to at
with being the distinct roots of th orthogonal polynomial
Link to originalTypes of Quadrature Rules
Gauss-Legendre Quadrature
Gauss-Chebyshev Quadrature
Gauss-Laguerre Quadrature
[!example] Gauss-Hermite Quadrature
Link to originalError Bound for Gauss Quadrature
Let be continuous on then
for some
Proof
Using Hermite interpolating polynomial to on then
Error for Hermite interpolation is defined byfor some
As then
as Gauss quadrature is exact for polynomials of that degree and then by interpolation
Hence
hence result follows from integral mean value theorem as