Numerical Analysis/Gaussian Quadrature

For the first example, I just want an example to show that the solution is exact for polynomials of degree $2n-1$, using the $n$th degree Legendre polynomial. I'm going to approximate $\underset{-1}{\overset{1}{\int }}{x}^{3}dx$.

$\begin{array}{cc}\underset{-1}{\overset{1}{\int }}{x}^{3}dx& ={\left(\frac{1}{\sqrt{3}}\right)}^3+{\left(\frac{-1}{\sqrt{3}}\right)}^3\\ \frac{1}{4}{1}^4-\frac{1}{4}(-1{)}^4& =\left(\frac{1}{3\sqrt{3}}\right)-\left(\frac{1}{3\sqrt{3}}\right)\\ \frac{1}{4}-\frac{1}{4}& =0\end{array}$

This problem accurately illustrates the method for solving problems using the Gaussian Quadrature algorithm. Note that the zeros of the Legendre polynomials of degree $n$ are $\frac{1}{\sqrt{3}}$ and $-\frac{1}{\sqrt{3}}$.

We can see from the previous example that this method works quite well if we are integrating from $-1$ to $1$, but in application, we rarely want to integrate over such a simple region. So in our next example, we will show that this technique is also effective if we change the limits of integration, as seen on the Wikipedia page, then we will solve the example $\underset{4}{\overset{14}{\int }}{x}^{3}dx$

$\begin{array}{cc}\underset{4}{\overset{14}{\int }}{x}^{3}dx& =\frac{14-4}{2}\sum _{i=1}^{2}f(\frac{14-4}{2}{x}_i+\frac{14+4}{2})\\ \frac{1}{4}14^4-\frac{1}{4}{4}^4& =5({(5\frac{1}{\sqrt{3}}+9)}^3+({(5\frac{-1}{\sqrt{3}}+9)}^3)\\ 9540& =5(\frac{125}{3\sqrt{3}}+\frac{875}{3}+\frac{1215}{\sqrt{3}}+729-\frac{125}{3\sqrt{3}}+\frac{875}{3}-\frac{1215}{\sqrt{3}}+729)\\ 9540& =5\left(1908\right)\\ 9540& =9540\end{array}$

We will next show how to solve a problem that isn't a simple polynomial. We will approximate $\underset{-1}{\overset{1}{\int }}{e}^{x}dx$ using a two point Gaussian approximation, and discuss the error analysis.

$\begin{array}{cc}\underset{-1}{\overset{1}{\int }}{e}^{x}dx& \approx e^{\frac{1}{\sqrt{3}}}+e^{\frac{-1}{\sqrt{3}}}\\ e-\frac{1}{e}& \approx e^{\frac{1}{\sqrt{3}}}+\frac{1}{e^{\frac{1}{\sqrt{3}}}}\end{array}$

We will next analyze this error, looking at the actual error followed by finding the error bound. We denote the approximation by $f_{approx}$ and the exact solution by $f_{exact}$.

$\begin{array}{cc}|f_{exact}-f_{approx}|& =|e-\frac{1}{e}-e^{\frac{1}{\sqrt{3}}}-\frac{1}{e^{\frac{1}{\sqrt{3}}}}|\\ & =0.00770629937787233598077\end{array}$

The theoretical error bound when using the Legendre polynomial method is

$\begin{array}{cc}|f_{exact}-f_{approx}|& \le \frac{(b-a{)}^{2n+1}(n!{)}^4}{(2n+1){[(2n)!]}^3}{f}^{(2n)}\left(\xi \right),a<\xi <b\\ & \le \frac{2^5{2}^4}{5*4{!}^3}e\\ & =\frac{2^9}{5*24^3}e\\ & =0.02013542095154848322489\end{array}$

In our example, the actual error was well within the error bound. We also see that with only two calculations, this is a very good algorithm for approximating integrals quickly with relatively good accuracy.

Exercises

1. Show that Gaussian Quadrature can solve exactly general cubic polynomials.

a) Set up the integral:

Solution:

$\underset{-1}{\overset{1}{\int }}f(x)dx=\underset{-1}{\overset{1}{\int }}(a{x}^3+b{x}^2+cx+d)dx$

b) Evaluate the integral:

Solution:

$\begin{array}{cc}\underset{-1}{\overset{1}{\int }}f(x)dx& =\frac{a}{4}{1}^4-\frac{a}{4}(-1{)}^4+\frac{b}{3}{1}^3-\frac{b}{3}(-1{)}^3+\frac{c}{2}{1}^2-\frac{c}{2}(-1{)}^2+d-(-d)\\ \underset{-1}{\overset{1}{\int }}f(x)dx& =\frac{2}{3}b+2d\end{array}$

c) Evaluate the approximation:

Solution:

$\begin{array}{cc}\sum _{i=1}^{2}f\left(x_i\right)& =a{\left(\frac{1}{\sqrt{3}}\right)}^3+a{\left(\frac{-1}{\sqrt{3}}\right)}^3+b{\left(\frac{1}{\sqrt{3}}\right)}^2+b{\left(\frac{-1}{\sqrt{3}}\right)}^2+c\left(\frac{1}{\sqrt{3}}\right)+c\left(\frac{-1}{\sqrt{3}}\right)+2d\\ \sum _{i=1}^{2}f\left(x_i\right)& =\frac{2}{3}b+2d\end{array}$

d) Do parts b and c correspond?

Solution:

Yes

---

2. Approximate $\underset{-1}{\overset{1}{\int }}si{n}^2(x)cos(x)dx$ using Gaussian Quadrature

a) Evaluate the problem symbolically:

Solution:

$\begin{array}{cc}\underset{-1}{\overset{1}{\int }}si{n}^2(x)cos(x)dx& =\underset{-1}{\overset{1}{\int }}cosxdx+\underset{-1}{\overset{1}{\int }}co{s}^{3}xdx\\ & =\frac{2si{n}^3(1)}{3}\\ & \approx 0.397215491060637\end{array}$

b) Evaluate the approximation:

Solution:

$\begin{array}{cc}\sum _{i=1}^{2}f\left(x_i\right)& =si{n}^2\left(\frac{1}{\sqrt{3}}\right)cos\left(\frac{1}{\sqrt{3}}\right)+si{n}^2\left(\frac{-1}{\sqrt{3}}\right)cos\left(\frac{-1}{\sqrt{3}}\right)\\ & \approx 0.49923418313484188\end{array}$

c) Find the actual error

Solution:

$|f_{exact}-f_{approx}|\approx 0.102018692074204$

d) Find the error bound

Solution:

$\begin{array}{cc}|f_{exact}-f_{approx}|& \le \frac{(b-a{)}^{2n+1}(n!{)}^4}{(2n+1){[(2n)!]}^3}{f}^{(2n)}\left(\xi \right),a<\xi <b\\ & \le \frac{2^5{2}^4}{5*4{!}^3}{f}^4(\xi )\\ & \le \frac{2^9}{5*24^3}*20.1824\\ & \le 0.14949925\end{array}$

d) Is the actual error less than the error bound?

Solution:

Yes

---

3. If $x_1,x_2,....,x_n$ are the roots of the $n$th Legendre Polynomial $P_n(x)$ and that for each $i=1,2,....,n$, the numbers $c_i$ are defined by

$c_i=\underset{-1}{\overset{1}{\int }}\prod _{j=1,j\ne i}^n\frac{x-x_j}{x_i-x_j}dx$

Prove that if $P(x)$ is any polynomial of degree less than $2n$, then

$\underset{-1}{\overset{1}{\int }}P(x)dx=\sum _{i=1}^n{c}_{i}P(x_i).$

Proof:

The set that is relevant to this proof is the set of Legendre Polynomials, a collection orthogonal polynomials $P_0(x),P_1(x),...,P_n(x),...,$ with properties:

1. For each $n,P_n(x)$ is a monic polynomial of degree $n$.
2. $\underset{-1}{\overset{1}{\int }}P(x)\times P_n(x)dx=0$ whenever $P(x)$ is a polynomial of degree less that $n$.

First we use polynomial division, to get $Q(x)=\frac{P(x)}{P_n(x)}$ with a remainder term $R(x)$, so that $P(x)=Q(x)\times P_n(x)+R(x)$ and the two polynomials $Q(x)$ and $R(x)$ are of degree less than $n$ and $P_n(x)$ is of degree $n$. Then using this fact we can rewrite the original integral into the form

$\underset{-1}{\overset{1}{\int }}P(x)dx=\underset{-1}{\overset{1}{\int }}{P}_n(x)\times Q(x)dx+\underset{-1}{\overset{1}{\int }}R(x)dx$.

Since the degree of $P(x)$ is less than twice the degree of the w: Legendre polynomial, then the degree of $Q(x)$ is less than the degree of $P_n(x)$. So (by Legendre property 2 started above), $\underset{-1}{\overset{1}{\int }}Q(x)\times P_n(x)dx=0$. Thus we see that $\underset{-1}{\overset{1}{\int }}P(x)dx=\underset{-1}{\overset{1}{\int }}R(x)dx$. We do not know what $R(x)$ is, but we know it has degree less than $n$ so it equals the polynomial that interpolates it at the values $x_1,x_2,....,x_n$. We will use the w: Lagrange polynomial form. Since $x_i$ is a roots of $P_n$ for each $i=1,2,...,n$, we have

$P(x_i)=Q(x_i)\times P_n(x_i)+R(x_i)=Q(x_i)\times 0+R(x_i)=R(x_i)$

Since $R(x)$ is a polynomial of degree less than $n$, then Lagrange polynomial for $R(x)$ is

$R(x)=\sum _{i=1}^n(P(x_i)\prod _{j=1,j\ne i}^n\frac{x-x_j}{x_i-x_j})$.

We next integrate this polynomial by

$\underset{-1}{\overset{1}{\int }}P(x)dx=\underset{-1}{\overset{1}{\int }}R(x)dx=\underset{-1}{\overset{1}{\int }}\left(\sum _{i=1}^n(P(x_i)\prod _{j=1,j\ne i}^n\frac{x-x_j}{x_i-x_j})\right)dx$.

Since $P(x_i)$ is a constant, we will pull that outside the integral, giving us

$\underset{-1}{\overset{1}{\int }}P(x)dx=(\sum _{i=1}^{n}P(x_i)\left(\underset{-1}{\overset{1}{\int }}\prod _{j=1,j\ne i}^n\frac{x-x_j}{x_i-x_j}dx\right))$.

We then note that

$c_i=\underset{-1}{\overset{1}{\int }}\prod _{j=1,j\ne i}^n\frac{x-x_j}{x_i-x_j}dx$,

so we will substitute $c_i$ into our integration, giving us

$\underset{-1}{\overset{1}{\int }}P(x)dx=\sum _{i=1}^n{c}_{i}P(x_i).$

This completes the proof.

Gaussian Quadrature Example

I realized that there was insufficient information after the derived and solved sample on Gaussian Quadrature thus i took the pain to edit this wikiversity page by adding a solved example to the information already on there and below is what i factored in.

Find the constants C_0, C_1, and x_1 so that the quadrature formula

$\underset{0}{\overset{1}{\int }}f(x)dx=C_{0}f(0)+C_{1}f(x_1).$

has the highest possible degree of precision.

Solution

Since there are three unknowns, C_0, C_1 and x_1, we will expect the formula to be exact for

$f(x)=1,x,and{x}^2$

Thus

$f(x)=1,\underset{0}{\overset{1}{\int }}f(x)dx=1=C_0+C_{1}Equation1,f(x)=x,\underset{0}{\overset{1}{\int }}f(x)dx=\frac{1}{2}=C_1{x}_{1}Equation2.f(x)=x^2,\underset{0}{\overset{1}{\int }}f(x)dx=\frac{1}{3}=C_1{x}_1^2.$

Equation 2 and 3 will yield.

$\frac{c_1{x}_1}{c_1{x}_1^2}=x_1=\frac{2}{3}.C_1=\frac{3}{4}.C_0=\frac{1}{4}.$

Hence

$\underset{0}{\overset{1}{\int }}f(x)dx=\frac{1}{4}f(0)+\frac{3}{4}f(\frac{2}{3})$

Now,

$f(x)=x^3.\underset{0}{\overset{1}{\int }}{x}^{3}dx=\frac{1}{4}$

And

$\frac{1}{4}(0{)}^3+\frac{3}{4}(\frac{2}{3}{)}^3=\frac{2}{9}.$

Thus the degree of the precision is 2

Example Quiz

<quiz display=simple> {Why do we use the zeros of the Legendre polynomials in this method? |type="()"} - By convention for consistency + Because Legendre polynomials of degree $n$ are orthogonal to any other polynomial with degree less than $n$ - Because they make $f(x)=0$ when approximating $f(x)$ - None of these

{The integral of a 6th degree polynomial can be approximated exactly using the 3rd degree Legendre polynomial, True or False |type="()"} - True + False

{Calculate the error bound for a general 3rd degree polynomial using a 2nd order Legendre polynomial |type="()"} - 10.56 + 0 - 4.13 - 50.25

{Calculate the error bound for $\underset{4}{\overset{8}{\int }}{x}^6+5x^5+27x^4+108x+276dx$ using a 3rd degree Legendre polynomial |type="()"} + 5.85 - 0.13 - 28.83 - 12.44

{What are the failure conditions for this algorithm? |type="()"} - The $n$th derivative of $f(x)$ must be nonzero + $f(x)$ is discontinuous over the range of integration - $f(x)$ is constant over the range - The method never fails, it just can suffer from poor accuracy </quiz>