Paper 3, Section II, C

Numerical Analysis | Part IB, 2017

Let pnPnp_{n} \in \mathbb{P}_{n} be the nnth monic orthogonal polynomial with respect to the inner product

f,g=abw(x)f(x)g(x)dx\langle f, g\rangle=\int_{a}^{b} w(x) f(x) g(x) d x

on C[a,b]C[a, b], where ww is a positive weight function.

Prove that, for n1,pnn \geqslant 1, p_{n} has nn distinct zeros in the interval (a,b)(a, b).

Let c1,c2,,cn[a,b]c_{1}, c_{2}, \ldots, c_{n} \in[a, b] be nn distinct points. Show that the quadrature formula

abw(x)f(x)dxi=1nbif(ci)\int_{a}^{b} w(x) f(x) d x \approx \sum_{i=1}^{n} b_{i} f\left(c_{i}\right)

is exact for all fPn1f \in \mathbb{P}_{n-1} if the weights bib_{i} are chosen to be

bi=abw(x)j=1jinxcjcicjdxb_{i}=\int_{a}^{b} w(x) \prod_{\substack{j=1 \\ j \neq i}}^{n} \frac{x-c_{j}}{c_{i}-c_{j}} d x

Show further that the quadrature formula is exact for all fP2n1f \in \mathbb{P}_{2 n-1} if the nodes cic_{i} are chosen to be the zeros of pnp_{n} (Gaussian quadrature). [Hint: Write ff as qpn+rq p_{n}+r, where q,rPn1q, r \in \mathbb{P}_{n-1}.]

Use the Peano kernel theorem to write an integral expression for the approximation error of Gaussian quadrature for sufficiently differentiable functions. (You should give a formal expression for the Peano kernel but are not required to evaluate it.)

Typos? Please submit corrections to this page on GitHub.