Paper 4 , Section II, 40E

Numerical Analysis
Part II, 2021

(a) Show that if AA and BB are real matrices such that both AA and ABBTA-B-B^{T} are symmetric positive definite, then the spectral radius of H=(AB)1BH=-(A-B)^{-1} B is strictly less than 1.1 .

(b) Consider the Poisson equation 2u=f\nabla^{2} u=f (with zero Dirichlet boundary condition) on the unit square, where ff is some smooth function. Given mNm \in \mathbb{N} and an equidistant grid on the unit square with stepsize h=1/(m+1)h=1 /(m+1), the standard five-point method is given by

ui1,j+ui+1,j+ui,j1+ui,j+14ui,j=h2fi,j,i,j=1,,mu_{i-1, j}+u_{i+1, j}+u_{i, j-1}+u_{i, j+1}-4 u_{i, j}=h^{2} f_{i, j}, \quad i, j=1, \ldots, m

where fi,j=f(ih,jh)f_{i, j}=f(i h, j h) and u0,j=um+1,j=ui,0=ui,m+1=0u_{0, j}=u_{m+1, j}=u_{i, 0}=u_{i, m+1}=0. Equation ()(*) can be written as a linear system Ax=bA x=b, where ARm2×m2A \in \mathbb{R}^{m^{2} \times m^{2}} and bRm2b \in \mathbb{R}^{m^{2}} both depend on the chosen ordering of the grid points.

Use the result in part (a) to show that the Gauss-Seidel method converges for the linear system Ax=bA x=b described above, regardless of the choice of ordering of the grid points.

[You may quote convergence results - based on the spectral radius of the iteration matrix - mentioned in the lecture notes.]