ConceptComplete

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 2nβˆ’12n - 1 with only nn nodes.


Fundamental Framework

Definition4.4Gaussian Quadrature Rule

An nn-point Gaussian quadrature rule on [a,b][a, b] with respect to a weight function w(x)>0w(x) > 0 is an approximation ∫abw(x)f(x) dxβ‰ˆβˆ‘i=1nwif(xi)\int_a^b w(x) f(x)\, dx \approx \sum_{i=1}^n w_i f(x_i) where the nodes x1,…,xnx_1, \ldots, x_n and weights w1,…,wnw_1, \ldots, w_n are chosen so that the formula is exact for all polynomials of degree ≀2nβˆ’1\leq 2n - 1. This gives the maximum possible degree of exactness for nn function evaluations.

Definition4.5Gauss-Legendre Quadrature

For w(x)=1w(x) = 1 on [βˆ’1,1][-1, 1], the nodes x1,…,xnx_1, \ldots, x_n are the roots of the Legendre polynomial Pn(x)P_n(x), and the weights are wi=2(1βˆ’xi2)[Pnβ€²(xi)]2w_i = \frac{2}{(1 - x_i^2)[P_n'(x_i)]^2}. For a general interval [a,b][a, b], the substitution x=bβˆ’a2t+a+b2x = \frac{b-a}{2}t + \frac{a+b}{2} transforms the integral: ∫abf(x) dx=bβˆ’a2βˆ«βˆ’11f ⁣(bβˆ’a2t+a+b2)dt\int_a^b f(x)\, dx = \frac{b-a}{2} \int_{-1}^1 f\!\left(\frac{b-a}{2}t + \frac{a+b}{2}\right) dt.


Other Gaussian Families

Definition4.6Gauss-Chebyshev and Gauss-Laguerre Quadrature

Gauss-Chebyshev quadrature uses w(x)=11βˆ’x2w(x) = \frac{1}{\sqrt{1 - x^2}} on (βˆ’1,1)(-1, 1), with nodes at xk=cos⁑ ⁣(2kβˆ’12nΟ€)x_k = \cos\!\left(\frac{2k - 1}{2n}\pi\right) and equal weights wk=Ο€nw_k = \frac{\pi}{n}. Gauss-Laguerre quadrature uses w(x)=eβˆ’xw(x) = e^{-x} on [0,∞)[0, \infty), with nodes at the roots of Laguerre polynomials Ln(x)L_n(x) and weights wi=xi(n+1)2[Ln+1(xi)]2w_i = \frac{x_i}{(n+1)^2 [L_{n+1}(x_i)]^2}.

ExampleTwo-Point Gauss-Legendre

For n=2n = 2: nodes x1,2=Β±13x_{1,2} = \pm\frac{1}{\sqrt{3}}, weights w1=w2=1w_1 = w_2 = 1. Thus βˆ«βˆ’11f(x) dxβ‰ˆf ⁣(βˆ’13)+f ⁣(13)\int_{-1}^1 f(x)\,dx \approx f\!\left(-\frac{1}{\sqrt{3}}\right) + f\!\left(\frac{1}{\sqrt{3}}\right). This is exact for polynomials up to degree 3. For f(x)=x3f(x) = x^3: f(βˆ’1/3)+f(1/3)=βˆ’1/(33)+1/(33)=0=βˆ«βˆ’11x3 dxf(-1/\sqrt{3}) + f(1/\sqrt{3}) = -1/(3\sqrt{3}) + 1/(3\sqrt{3}) = 0 = \int_{-1}^1 x^3\,dx.


Error Analysis

RemarkGaussian Quadrature Error

The error for nn-point Gauss-Legendre quadrature applied to f∈C2n[a,b]f \in C^{2n}[a,b] is En(f)=(bβˆ’a)2n+1(n!)4(2n+1)[(2n)!]3f(2n)(ΞΎ)E_n(f) = \frac{(b-a)^{2n+1} (n!)^4}{(2n+1)[(2n)!]^3} f^{(2n)}(\xi) for some ξ∈(a,b)\xi \in (a,b). The rapid growth of the factorial terms makes Gaussian quadrature converge exponentially for smooth functions. For analytic ff, the error decreases as O(Οβˆ’2n)O(\rho^{-2n}) where ρ>1\rho > 1 depends on the analyticity region of ff in the complex plane.

ExampleComposite Gaussian Quadrature

For functions with limited smoothness, composite Gaussian quadrature subdivides [a,b][a, b] into mm subintervals and applies a low-order Gauss rule on each. Using nn-point Gauss-Legendre on each of mm subintervals gives error O(h2n)O(h^{2n}) where h=(bβˆ’a)/mh = (b-a)/m. This combines the high order of Gaussian quadrature with the adaptability of composite rules.