Gaussian quadrature

Comparison between 2-point Gaussian and trapezoidal quadrature.

Comparison between 2-point Gaussian and trapezoidal quadrature.
The blue curve shows the function whose definite integral on the interval [−1, 1] is to be calculated (the integrand). The trapezoidal rule approximates the function with a linear function that coincides with the integrand at the endpoints of the interval and is represented by an orange dashed line. The approximation is apparently not good, so the error is large (the trapezoidal rule gives an approximation of the integral equal to y(−1) + y(1) = −10, while the correct value is 2⁄3). To obtain a more accurate result, the interval must be partitioned into many subintervals and then the composite trapezoidal rule must be used, which requires many more calculations.
The Gaussian quadrature chooses more suitable points instead, so even a linear function approximates the function better (the black dashed line). As the integrand is the third-degree polynomial y(x) = 7x³ − 8x² − 3x + 3, the 2-point Gaussian quadrature rule even returns an exact result.

In numerical analysis, an Template:Mvar-point Gaussian quadrature rule, named after Carl Friedrich Gauss, is a quadrature rule constructed to yield an exact result for polynomials of degree 2n − 1 or less by a suitable choice of the nodes Template:Mvar and weights Template:Mvar for i = 1, ..., n.

The modern formulation using orthogonal polynomials was developed by Carl Gustav Jacobi in 1826. The most common domain of integration for such a rule is taken as [−1, 1], so the rule is stated as $$\underset{-1}{\overset{1}{\int }}f(x)dx\approx \sum _{i=1}^n{w}_{i}f(x_i),$$

which is exact for polynomials of degree 2n − 1 or less. This exact rule is known as the Gauss–Legendre quadrature rule. The quadrature rule will only be an accurate approximation to the integral above if f (x) is well-approximated by a polynomial of degree 2n − 1 or less on [−1, 1].

The Gauss–Legendre quadrature rule is not typically used for integrable functions with endpoint singularities. Instead, if the integrand can be written as

$$f(x)={(1-x)}^{\alpha }{(1+x)}^{\beta }g(x),\alpha ,\beta >-1,$$

where g(x) is well-approximated by a low-degree polynomial, then alternative nodes Template:Mvar and weights Template:Mvar will usually give more accurate quadrature rules. These are known as Gauss–Jacobi quadrature rules, i.e.,

$$\underset{-1}{\overset{1}{\int }}f(x)dx=\underset{-1}{\overset{1}{\int }}{(1-x)}^{\alpha }{(1+x)}^{\beta }g(x)dx\approx \sum _{i=1}^n{w_i}^{\prime }g\left({x_i}^{\prime }\right).$$

Common weights include $\frac{1}{\sqrt{1-x^2}}$ (Chebyshev–Gauss) and $\sqrt{1-x^2}$. One may also want to integrate over semi-infinite (Gauss–Laguerre quadrature) and infinite intervals (Gauss–Hermite quadrature).

It can be shown (see Press et al., or Stoer and Bulirsch) that the quadrature nodes Template:Mvar are the roots of a polynomial belonging to a class of orthogonal polynomials (the class orthogonal with respect to a weighted inner-product). This is a key observation for computing Gauss quadrature nodes and weights.

Gauss–Legendre quadrature

File:Legendrepolynomials6.svg

Graphs of Legendre polynomials (up to n = 5)

For the simplest integration problem stated above, i.e., f(x) is well-approximated by polynomials on $[-1,1]$, the associated orthogonal polynomials are Legendre polynomials, denoted by P_n(x). With the Template:Mvar-th polynomial normalized to give P_n(1) = 1, the Template:Mvar-th Gauss node, Template:Mvar, is the Template:Mvar-th root of Template:Mvar and the weights are given by the formula $$w_i=\frac{2}{(1-x_i^2){[P{\text{'}}_n(x_i)]}^2}.$$

Some low-order quadrature rules are tabulated below (over interval [−1, 1], see the section below for other intervals).

Number of points, Template:Mvar	Points/abscissa, Template:Mvar		Weights, Template:Mvar
1	0		2
2	$\pm \frac{1}{\sqrt{3}}$	±0.57735...	1
3	0		$\frac{8}{9}$	0.888889...
	$\pm \sqrt{\frac{3}{5}}$	±0.774597...	$\frac{5}{9}$	0.555556...
4	$\pm \sqrt{\frac{3}{7}-\frac{2}{7}\sqrt{\frac{6}{5}}}$	±0.339981...	$\frac{18+\sqrt{30}}{36}$	0.652145...
	$\pm \sqrt{\frac{3}{7}+\frac{2}{7}\sqrt{\frac{6}{5}}}$	±0.861136...	$\frac{18-\sqrt{30}}{36}$	0.347855...
5	0		$\frac{128}{225}$	0.568889...
	$\pm \frac{1}{3}\sqrt{5-2\sqrt{\frac{10}{7}}}$	±0.538469...	$\frac{322+13\sqrt{70}}{900}$	0.478629...
	$\pm \frac{1}{3}\sqrt{5+2\sqrt{\frac{10}{7}}}$	±0.90618...	$\frac{322-13\sqrt{70}}{900}$	0.236927...

Change of interval

An integral over [a, b] must be changed into an integral over [−1, 1] before applying the Gaussian quadrature rule. This change of interval can be done in the following way: $$\underset{a}{\overset{b}{\int }}f(x)dx=\underset{-1}{\overset{1}{\int }}f(\frac{b-a}{2}\xi +\frac{a+b}{2})\frac{dx}{d\xi }d\xi$$

with $\frac{dx}{d\xi }=\frac{b-a}{2}$

Applying the $n$ point Gaussian quadrature $(\xi ,w)$ rule then results in the following approximation: $$\underset{a}{\overset{b}{\int }}f(x)dx\approx \frac{b-a}{2}\sum _{i=1}^n{w}_{i}f(\frac{b-a}{2}{\xi }_i+\frac{a+b}{2}).$$

Example of two-point Gauss quadrature rule

Use the two-point Gauss quadrature rule to approximate the distance in meters covered by a rocket from $t=8\mathrm{s}$ to $t=30\mathrm{s},$ as given by $$s=\underset{8}{\overset{30}{\int }}(2000\ln \left[\frac{140000}{140000-2100t}\right]-9.8t)dt$$

Change the limits so that one can use the weights and abscissae given in Table 1. Also, find the absolute relative true error. The true value is given as 11061.34 m.

Solution

First, changing the limits of integration from $[8,30]$ to $[-1,1]$ gives

$$\begin{array}{rl}\underset{8}{\overset{30}{\int }}f(t)dt& =\frac{30-8}{2}\underset{-1}{\overset{1}{\int }}f(\frac{30-8}{2}x+\frac{30+8}{2})dx\\ & =11\underset{-1}{\overset{1}{\int }}f(11x+19)dx\end{array}$$

Next, get the weighting factors and function argument values from Table 1 for the two-point rule,

• $c_1=1.000000000$
• $x_1=-0.577350269$
• $c_2=1.000000000$
• $x_2=0.577350269$

Now we can use the Gauss quadrature formula $$\begin{array}{rl}11\underset{-1}{\overset{1}{\int }}f(11x+19)dx& \approx 11[c_{1}f(11x_1+19)+c_{2}f(11x_2+19)]\\ & =11[f(11(-0.5773503)+19)+f(11(0.5773503)+19)]\\ & =11[f(12.64915)+f(25.35085)]\\ & =11[(296.8317)+(708.4811)]\\ & =11058.44\end{array}$$ since $$\begin{array}{rl}f(12.64915)& =2000\ln \left[\frac{140000}{140000-2100(12.64915)}\right]-9.8(12.64915)\\ & =296.8317\end{array}$$ $$\begin{array}{rl}f(25.35085)& =2000\ln \left[\frac{140000}{140000-2100(25.35085)}\right]-9.8(25.35085)\\ & =708.4811\end{array}$$

Given that the true value is 11061.34 m, the absolute relative true error, $\left|{\epsilon }_t\right|$ is $$\left|{\epsilon }_t\right|=\left|\frac{11061.34-11058.44}{11061.34}\right|\times 100\mathrm{\%}=0.0262\mathrm{\%}$$

Other forms

The integration problem can be expressed in a slightly more general way by introducing a positive weight function Template:Mvar into the integrand, and allowing an interval other than [−1, 1]. That is, the problem is to calculate $$\underset{a}{\overset{b}{\int }}\omega (x)f(x)dx$$ for some choices of Template:Mvar, Template:Mvar, and Template:Mvar. For a = −1, b = 1, and ω(x) = 1, the problem is the same as that considered above. Other choices lead to other integration rules. Some of these are tabulated below. Equation numbers are given for Abramowitz and Stegun (A & S).

Interval	ω(x)	Orthogonal polynomials	A & S	For more information, see ...
Template:Closed-closed	1	Legendre polynomials	25.4.29	Template:Section link
Template:Open-open	${(1-x)}^{\alpha }{(1+x)}^{\beta },\alpha ,\beta >-1$	Jacobi polynomials	25.4.33 (β = 0)	Gauss–Jacobi quadrature
Template:Open-open	$\frac{1}{\sqrt{1-x^2}}$	Chebyshev polynomials (first kind)	25.4.38	Chebyshev–Gauss quadrature
Template:Closed-closed	$\sqrt{1-x^2}$	Chebyshev polynomials (second kind)	25.4.40	Chebyshev–Gauss quadrature
Template:Closed-open	$e^{-x}$	Laguerre polynomials	25.4.45	Gauss–Laguerre quadrature
Template:Closed-open	$x^{\alpha }{e}^{-x},\alpha >-1$	Generalized Laguerre polynomials		Gauss–Laguerre quadrature
Template:Open-open	$e^{-x^2}$	Hermite polynomials	25.4.46	Gauss–Hermite quadrature

Fundamental theorem

Let Template:Mvar be a nontrivial polynomial of degree Template:Mvar such that $$\underset{a}{\overset{b}{\int }}\omega (x)x^k{p}_n(x)dx=0,\text{for all }k=0,1,\dots ,n-1.$$

Note that this will be true for all the orthogonal polynomials above, because each Template:Mvar is constructed to be orthogonal to the other polynomials Template:Mvar for j<n, and x^k is in the span of that set.

If we pick the Template:Mvar nodes Template:Mvar to be the zeros of Template:Mvar, then there exist Template:Mvar weights Template:Mvar which make the Gaussian quadrature computed integral exact for all polynomials h(x) of degree 2n − 1 or less. Furthermore, all these nodes Template:Mvar will lie in the open interval (a, b).

To prove the first part of this claim, let h(x) be any polynomial of degree 2n − 1 or less. Divide it by the orthogonal polynomial Template:Mvar to get $$h(x)=p_n(x)q(x)+r(x).$$ where q(x) is the quotient, of degree n − 1 or less (because the sum of its degree and that of the divisor Template:Mvar must equal that of the dividend), and r(x) is the remainder, also of degree n − 1 or less (because the degree of the remainder is always less than that of the divisor). Since Template:Mvar is by assumption orthogonal to all monomials of degree less than Template:Mvar, it must be orthogonal to the quotient q(x). Therefore $$\underset{a}{\overset{b}{\int }}\omega (x)h(x)dx=\underset{a}{\overset{b}{\int }}\omega (x)(p_n(x)q(x)+r(x))dx=\underset{a}{\overset{b}{\int }}\omega (x)r(x)dx.$$

Since the remainder r(x) is of degree n − 1 or less, we can interpolate it exactly using Template:Mvar interpolation points with Lagrange polynomials l_i(x), where $$l_i(x)=\prod _{j\ne i}\frac{x-x_j}{x_i-x_j}.$$

We have $$r(x)=\sum _{i=1}^n{l}_i(x)r(x_i).$$

Then its integral will equal $$\underset{a}{\overset{b}{\int }}\omega (x)r(x)dx=\underset{a}{\overset{b}{\int }}\omega (x)\sum _{i=1}^n{l}_i(x)r(x_i)dx=\sum _{i=1}^{n}r(x_i)\underset{a}{\overset{b}{\int }}\omega (x)l_i(x)dx=\sum _{i=1}^{n}r(x_i)w_i,$$

where w_i, the weight associated with the node x_i, is defined to equal the weighted integral of l_i(x) (see below for other formulas for the weights). But all the Template:Mvar are roots of Template:Mvar, so the division formula above tells us that $$h(x_i)=p_n(x_i)q(x_i)+r(x_i)=r(x_i),$$ for all Template:Mvar. Thus we finally have $$\underset{a}{\overset{b}{\int }}\omega (x)h(x)dx=\underset{a}{\overset{b}{\int }}\omega (x)r(x)dx=\sum _{i=1}^n{w}_{i}r(x_i)=\sum _{i=1}^n{w}_{i}h(x_i).$$

This proves that for any polynomial h(x) of degree 2n − 1 or less, its integral is given exactly by the Gaussian quadrature sum.

To prove the second part of the claim, consider the factored form of the polynomial p_n. Any complex conjugate roots will yield a quadratic factor that is either strictly positive or strictly negative over the entire real line. Any factors for roots outside the interval from Template:Mvar to Template:Mvar will not change sign over that interval. Finally, for factors corresponding to roots Template:Mvar inside the interval from Template:Mvar to Template:Mvar that are of odd multiplicity, multiply p_n by one more factor to make a new polynomial $$p_n(x)\prod _i(x-x_i).$$

This polynomial cannot change sign over the interval from Template:Mvar to Template:Mvar because all its roots there are now of even multiplicity. So the integral $$\underset{a}{\overset{b}{\int }}{p}_n(x)(\prod _i(x-x_i))\omega (x)dx\ne 0,$$ since the weight function ω(x) is always non-negative. But p_n is orthogonal to all polynomials of degree n − 1 or less, so the degree of the product $$\prod _i(x-x_i)$$ must be at least Template:Mvar. Therefore p_n has Template:Mvar distinct roots, all real, in the interval from Template:Mvar to Template:Mvar.

General formula for the weights

The weights can be expressed as

where $a_k$ is the coefficient of $x^k$ in $p_k(x)$. To prove this, note that using Lagrange interpolation one can express r(x) in terms of $r(x_i)$ as $$r(x)=\sum _{i=1}^{n}r(x_i)\prod _{\begin{array}{c}1\le j\le n\\ j\ne i\end{array}}\frac{x-x_j}{x_i-x_j}$$ because r(x) has degree less than Template:Mvar and is thus fixed by the values it attains at Template:Mvar different points. Multiplying both sides by ω(x) and integrating from Template:Mvar to Template:Mvar yields $$\underset{a}{\overset{b}{\int }}\omega (x)r(x)dx=\sum _{i=1}^{n}r(x_i)\underset{a}{\overset{b}{\int }}\omega (x)\prod _{\begin{array}{c}1\le j\le n\\ j\ne i\end{array}}\frac{x-x_j}{x_i-x_j}dx$$

The weights Template:Mvar are thus given by $$w_i=\underset{a}{\overset{b}{\int }}\omega (x)\prod _{\begin{array}{c}1\le j\le n\\ j\ne i\end{array}}\frac{x-x_j}{x_i-x_j}dx$$

This integral expression for $w_i$ can be expressed in terms of the orthogonal polynomials $p_n(x)$ and $p_{n-1}(x)$ as follows.

We can write $$\prod _{\begin{array}{c}1\le j\le n\\ j\ne i\end{array}}(x-x_j)=\frac{\prod _{1\le j\le n}(x-x_j)}{x-x_i}=\frac{p_n(x)}{a_n(x-x_i)}$$

where $a_n$ is the coefficient of $x^n$ in $p_n(x)$. Taking the limit of Template:Mvar to $x_i$ yields using L'Hôpital's rule $$\prod _{\begin{array}{c}1\le j\le n\\ j\ne i\end{array}}(x_i-x_j)=\frac{p{\text{'}}_n(x_i)}{a_n}$$

We can thus write the integral expression for the weights as

In the integrand, writing $$\frac{1}{x-x_i}=\frac{1-{\left(\frac{x}{x_i}\right)}^k}{x-x_i}+{\left(\frac{x}{x_i}\right)}^k\frac{1}{x-x_i}$$

yields $$\underset{a}{\overset{b}{\int }}\omega (x)\frac{x^k{p}_n(x)}{x-x_i}dx=x_i^k\underset{a}{\overset{b}{\int }}\omega (x)\frac{p_n(x)}{x-x_i}dx$$

provided $k\le n$, because $$\frac{1-{\left(\frac{x}{x_i}\right)}^k}{x-x_i}$$ is a polynomial of degree k − 1 which is then orthogonal to $p_n(x)$. So, if q(x) is a polynomial of at most nth degree we have $$\underset{a}{\overset{b}{\int }}\omega (x)\frac{p_n(x)}{x-x_i}dx=\frac{1}{q(x_i)}\underset{a}{\overset{b}{\int }}\omega (x)\frac{q(x)p_n(x)}{x-x_i}dx$$

We can evaluate the integral on the right hand side for $q(x)=p_{n-1}(x)$ as follows. Because $\frac{p_n(x)}{x-x_i}$ is a polynomial of degree n − 1, we have $$\frac{p_n(x)}{x-x_i}=a_n{x}^{n-1}+s(x)$$ where s(x) is a polynomial of degree $n-2$. Since s(x) is orthogonal to $p_{n-1}(x)$ we have $$\underset{a}{\overset{b}{\int }}\omega (x)\frac{p_n(x)}{x-x_i}dx=\frac{a_n}{p_{n-1}(x_i)}\underset{a}{\overset{b}{\int }}\omega (x)p_{n-1}(x)x^{n-1}dx$$

We can then write $$x^{n-1}=(x^{n-1}-\frac{p_{n-1}(x)}{a_{n-1}})+\frac{p_{n-1}(x)}{a_{n-1}}$$

The term in the brackets is a polynomial of degree $n-2$, which is therefore orthogonal to $p_{n-1}(x)$. The integral can thus be written as $$\underset{a}{\overset{b}{\int }}\omega (x)\frac{p_n(x)}{x-x_i}dx=\frac{a_n}{a_{n-1}{p}_{n-1}(x_i)}\underset{a}{\overset{b}{\int }}\omega (x)p_{n-1}(x{)}^{2}dx$$

According to equation (2), the weights are obtained by dividing this by $p{\text{'}}_n(x_i)$ and that yields the expression in equation (1).

$w_i$ can also be expressed in terms of the orthogonal polynomials $p_n(x)$ and now $p_{n+1}(x)$. In the 3-term recurrence relation $p_{n+1}(x_i)=(a)p_n(x_i)+(b)p_{n-1}(x_i)$ the term with $p_n(x_i)$ vanishes, so $p_{n-1}(x_i)$ in Eq. (1) can be replaced by $\frac{1}{b}{p}_{n+1}\left(x_i\right)$.

Proof that the weights are positive

Consider the following polynomial of degree $2n-2$ $$f(x)=\prod _{\begin{array}{c}1\le j\le n\\ j\ne i\end{array}}\frac{{(x-x_j)}^2}{{(x_i-x_j)}^2}$$ where, as above, the Template:Mvar are the roots of the polynomial $p_n(x)$. Clearly $f(x_j)={\delta }_{ij}$. Since the degree of $f(x)$ is less than $2n-1$, the Gaussian quadrature formula involving the weights and nodes obtained from $p_n(x)$ applies. Since $f(x_j)=0$ for Template:Mvar not equal to Template:Mvar, we have $$\underset{a}{\overset{b}{\int }}\omega (x)f(x)dx=\sum _{j=1}^n{w}_{j}f(x_j)=\sum _{j=1}^n{\delta }_{ij}{w}_j=w_i>0.$$

Since both $\omega (x)$ and $f(x)$ are non-negative functions, it follows that $w_i>0$.

Computation of Gaussian quadrature rules

There are many algorithms for computing the nodes Template:Mvar and weights Template:Mvar of Gaussian quadrature rules. The most popular are the Golub-Welsch algorithm requiring O(n²) operations, Newton's method for solving $p_n(x)=0$ using the three-term recurrence for evaluation requiring O(n²) operations, and asymptotic formulas for large n requiring O(n) operations.

Recurrence relation

Orthogonal polynomials $p_r$ with $(p_r,p_s)=0$ for $r\ne s$ for a scalar product $(\cdot ,\cdot )$, degree $(p_r)=r$ and leading coefficient one (i.e. monic orthogonal polynomials) satisfy the recurrence relation $$p_{r+1}(x)=(x-a_{r,r})p_r(x)-a_{r,r-1}{p}_{r-1}(x)\cdots -a_{r,0}{p}_0(x)$$

and scalar product defined $$(f(x),g(x))=\underset{a}{\overset{b}{\int }}\omega (x)f(x)g(x)dx$$

for $r=0,1,\dots ,n-1$ where Template:Mvar is the maximal degree which can be taken to be infinity, and where $a_{r,s}=\frac{(x{p}_r,p_s)}{(p_s,p_s)}$. First of all, the polynomials defined by the recurrence relation starting with $p_0(x)=1$ have leading coefficient one and correct degree. Given the starting point by $p_0$, the orthogonality of $p_r$ can be shown by induction. For $r=s=0$ one has $$(p_1,p_0)=(x-a_{0,0})(p_0,p_0)=(x{p}_0,p_0)-a_{0,0}(p_0,p_0)=(x{p}_0,p_0)-(x{p}_0,p_0)=0.$$

Now if $p_0,p_1,\dots ,p_r$ are orthogonal, then also $p_{r+1}$, because in $$(p_{r+1},p_s)=(x{p}_r,p_s)-a_{r,r}(p_r,p_s)-a_{r,r-1}(p_{r-1},p_s)\cdots -a_{r,0}(p_0,p_s)$$ all scalar products vanish except for the first one and the one where $p_s$ meets the same orthogonal polynomial. Therefore, $$(p_{r+1},p_s)=(x{p}_r,p_s)-a_{r,s}(p_s,p_s)=(x{p}_r,p_s)-(x{p}_r,p_s)=0.$$

However, if the scalar product satisfies $(xf,g)=(f,xg)$ (which is the case for Gaussian quadrature), the recurrence relation reduces to a three-term recurrence relation: For $s<r-1,x{p}_s$ is a polynomial of degree less than or equal to r − 1. On the other hand, $p_r$ is orthogonal to every polynomial of degree less than or equal to r − 1. Therefore, one has $(x{p}_r,p_s)=(p_r,x{p}_s)=0$ and $a_{r,s}=0$ for s < r − 1. The recurrence relation then simplifies to $$p_{r+1}(x)=(x-a_{r,r})p_r(x)-a_{r,r-1}{p}_{r-1}(x)$$

or $$p_{r+1}(x)=(x-a_r)p_r(x)-b_r{p}_{r-1}(x)$$

(with the convention $p_{-1}(x)\equiv 0$) where $$a_r:=\frac{(x{p}_r,p_r)}{(p_r,p_r)},b_r:=\frac{(x{p}_r,p_{r-1})}{(p_{r-1},p_{r-1})}=\frac{(p_r,p_r)}{(p_{r-1},p_{r-1})}$$

(the last because of $(x{p}_r,p_{r-1})=(p_r,x{p}_{r-1})=(p_r,p_r)$, since $x{p}_{r-1}$ differs from $p_r$ by a degree less than Template:Mvar).

The Golub-Welsch algorithm

The three-term recurrence relation can be written in matrix form $J\tilde{P}=x\tilde{P}-p_n(x){\mathbf{𝐞}}_n$ where $\tilde{P}={\left[\begin{array}{cccc}{p}_0(x)& p_1(x)& \cdots & p_{n-1}(x)\end{array}\right]}^{\mathsf{T}}$, ${\mathbf{𝐞}}_n$ is the $n$th standard basis vector, i.e., ${\mathbf{𝐞}}_n={\left[\begin{array}{cccc}0& \cdots & 0& 1\end{array}\right]}^{\mathsf{T}}$, and Template:Mvar is the following tridiagonal matrix, called the Jacobi matrix: $$\mathbf{𝐉}=\left[\begin{array}{ccccc}{a}_0& 1& 0& \cdots & 0\\ b_1& a_1& 1& \ddots & ⋮\\ 0& b_2& \ddots & \ddots & 0\\ ⋮& \ddots & \ddots & a_{n-2}& 1\\ 0& \cdots & 0& b_{n-1}& a_{n-1}\end{array}\right].$$

The zeros $x_j$ of the polynomials up to degree Template:Mvar, which are used as nodes for the Gaussian quadrature can be found by computing the eigenvalues of this matrix. This procedure is known as Golub–Welsch algorithm.

For computing the weights and nodes, it is preferable to consider the symmetric tridiagonal matrix ${𝒥}$ with elements $$\begin{array}{rlrl}{{𝒥}}_{k,i}=J_{k,i}& =a_{k-1}& k& =1,2,\dots ,n\\ {{𝒥}}_{k-1,i}={{𝒥}}_{k,k-1}=\sqrt{J_{k,k-1}{J}_{k-1,k}}& =\sqrt{b_{k-1}}& k& =\phantom{1,}2,\dots ,n.\end{array}$$

That is,

$${𝒥}=\left[\begin{array}{ccccc}{a}_0& \sqrt{b_1}& 0& \cdots & 0\\ \sqrt{b_1}& a_1& \sqrt{b_2}& \ddots & ⋮\\ 0& \sqrt{b_2}& \ddots & \ddots & 0\\ ⋮& \ddots & \ddots & a_{n-2}& \sqrt{b_{n-1}}\\ 0& \cdots & 0& \sqrt{b_{n-1}}& a_{n-1}\end{array}\right].$$

J and ${𝒥}$ are similar matrices and therefore have the same eigenvalues (the nodes). The weights can be computed from the corresponding eigenvectors: If ${\varphi }^{(j)}$ is a normalized eigenvector (i.e., an eigenvector with euclidean norm equal to one) associated with the eigenvalue Template:Mvar, the corresponding weight can be computed from the first component of this eigenvector, namely: $$w_j={\mu }_0{\left({\varphi }_1^{(j)}\right)}^2$$

where ${\mu }_0$ is the integral of the weight function $${\mu }_0=\underset{a}{\overset{b}{\int }}\omega (x)dx.$$

See, for instance, for further details.

Error estimates

The error of a Gaussian quadrature rule can be stated as follows. For an integrand which has 2n continuous derivatives, $$\underset{a}{\overset{b}{\int }}\omega (x)f(x)dx-\sum _{i=1}^n{w}_{i}f(x_i)=\frac{f^{(2n)}(\xi )}{(2n)!}(p_n,p_n)$$ for some Template:Mvar in (a, b), where Template:Mvar is the monic (i.e. the leading coefficient is 1) orthogonal polynomial of degree Template:Mvar and where $$(f,g)=\underset{a}{\overset{b}{\int }}\omega (x)f(x)g(x)dx.$$

In the important special case of ω(x) = 1, we have the error estimate $$\frac{{(b-a)}^{2n+1}{(n!)}^4}{(2n+1){[\left(2n\right)!]}^3}{f}^{(2n)}(\xi ),a<\xi <b.$$

Stoer and Bulirsch remark that this error estimate is inconvenient in practice, since it may be difficult to estimate the order 2n derivative, and furthermore the actual error may be much less than a bound established by the derivative. Another approach is to use two Gaussian quadrature rules of different orders, and to estimate the error as the difference between the two results. For this purpose, Gauss–Kronrod quadrature rules can be useful.

Gauss–Kronrod rules

If the interval [a, b] is subdivided, the Gauss evaluation points of the new subintervals never coincide with the previous evaluation points (except at zero for odd numbers), and thus the integrand must be evaluated at every point. Gauss–Kronrod rules are extensions of Gauss quadrature rules generated by adding n + 1 points to an Template:Mvar-point rule in such a way that the resulting rule is of order 2n + 1. This allows for computing higher-order estimates while re-using the function values of a lower-order estimate. The difference between a Gauss quadrature rule and its Kronrod extension is often used as an estimate of the approximation error.

Gauss–Lobatto rules

In some applications, it is desirable to have quadrature rules that have the high accuracy of Gauss formulas, but that also include the end points of the interval among the evaluation points. Such rules are known as Gauss-Lobatto, or simply Lobatto quadrature, named after Dutch mathematician Rehuel Lobatto. Because for an n point rule, one can no longer freely choose the locations of all quadrature points (2 of the points are fixed at the end points), one needs to expect that the rule is less accurate than regular Gaussian quadrature. Indeed, an n point Gauss-Lobatto rule is only accurate for polynomials up to degree 2n − 3.

Lobatto quadrature of function f(x) on interval [−1, 1]: $$\underset{-1}{\overset{1}{\int }}f(x)dx=\frac{2}{n(n-1)}[f(1)+f(-1)]+\sum _{i=2}^{n-1}{w}_{i}f(x_i)+R_n.$$

Abscissas: Template:Mvar is the $(i-1)$st zero of $P{\text{'}}_{n-1}(x)$, here $P_m(x)$ denotes the standard Legendre polynomial of Template:Mvar-th degree and the dash denotes the derivative.

Weights: $$w_i=\frac{2}{n(n-1){\left[P_{n-1}\left(x_i\right)\right]}^2},x_i\ne \pm 1.$$

Remainder: $$R_n=\frac{-n{(n-1)}^3{2}^{2n-1}{[(n-2)!]}^4}{(2n-1){[(2n-2)!]}^3}{f}^{(2n-2)}(\xi ),-1<\xi <1.$$

Some of the weights are:

Number of points, n	Points, Template:Mvar	Weights, Template:Mvar
$3$	$0$	$\frac{4}{3}$
	$\pm 1$	$\frac{1}{3}$
$4$	$\pm \sqrt{\frac{1}{5}}$	$\frac{5}{6}$
	$\pm 1$	$\frac{1}{6}$
$5$	$0$	$\frac{32}{45}$
	$\pm \sqrt{\frac{3}{7}}$	$\frac{49}{90}$
	$\pm 1$	$\frac{1}{10}$
$6$	$\pm \sqrt{\frac{1}{3}-\frac{2\sqrt{7}}{21}}$	$\frac{14+\sqrt{7}}{30}$
	$\pm \sqrt{\frac{1}{3}+\frac{2\sqrt{7}}{21}}$	$\frac{14-\sqrt{7}}{30}$
	$\pm 1$	$\frac{1}{15}$
$7$	$0$	$\frac{256}{525}$
	$\pm \sqrt{\frac{5}{11}-\frac{2}{11}\sqrt{\frac{5}{3}}}$	$\frac{124+7\sqrt{15}}{350}$
	$\pm \sqrt{\frac{5}{11}+\frac{2}{11}\sqrt{\frac{5}{3}}}$	$\frac{124-7\sqrt{15}}{350}$
	$\pm 1$	$\frac{1}{21}$

An adaptive variant of this algorithm with 2 interior nodes is found in GNU Octave and MATLAB as quadl and integrate.

References

Bibliography

• datiert 1814, auch in Werke, Band 3, 1876, S. 163–196. English Translation by Wikisource.
• Template:Dlmf

External links

• Template:Springer
• ALGLIB contains a collection of algorithms for numerical integration (in C# / C++ / Delphi / Visual Basic / etc.)
• GNU Scientific Library — includes C version of QUADPACK algorithms (see also GNU Scientific Library)
• From Lobatto Quadrature to the Euler constant e
• Gaussian Quadrature Rule of Integration – Notes, PPT, Matlab, Mathematica, Maple, Mathcad at Holistic Numerical Methods Institute
• Gaussian Quadrature by Chris Maes and Anton Antonov, Wolfram Demonstrations Project.
• Tabulated weights and abscissae with Mathematica source code, high precision (16 and 256 decimal places) Legendre-Gaussian quadrature weights and abscissas, for n=2 through n=64, with Mathematica source code.
• Mathematica source code distributed under the GNU LGPL for abscissas and weights generation for arbitrary weighting functions W(x), integration domains and precisions.
• Gaussian Quadrature in Boost.Math, for arbitrary precision and approximation order
• Gauss–Kronrod Quadrature in Boost.Math
• Nodes and Weights of Gaussian quadrature Template:Webarchive