Gaussian Quadrature
Gaussian quadrature achieves optimal polynomial accuracy by choosing both the nodes and weights of the quadrature rule. While Newton-Cotes formulas use equally spaced nodes, Gaussian quadrature selects nodes as roots of orthogonal polynomials, yielding exact results for polynomials of degree up to with only nodes.
Fundamental Framework
An -point Gaussian quadrature rule on with respect to a weight function is an approximation where the nodes and weights are chosen so that the formula is exact for all polynomials of degree . This gives the maximum possible degree of exactness for function evaluations.
For on , the nodes are the roots of the Legendre polynomial , and the weights are . For a general interval , the substitution transforms the integral: .
Other Gaussian Families
Gauss-Chebyshev quadrature uses on , with nodes at and equal weights . Gauss-Laguerre quadrature uses on , with nodes at the roots of Laguerre polynomials and weights .
For : nodes , weights . Thus . This is exact for polynomials up to degree 3. For : .
Error Analysis
The error for -point Gauss-Legendre quadrature applied to is for some . The rapid growth of the factorial terms makes Gaussian quadrature converge exponentially for smooth functions. For analytic , the error decreases as where depends on the analyticity region of in the complex plane.
For functions with limited smoothness, composite Gaussian quadrature subdivides into subintervals and applies a low-order Gauss rule on each. Using -point Gauss-Legendre on each of subintervals gives error where . This combines the high order of Gaussian quadrature with the adaptability of composite rules.