Past exam of the numerical analysis course of the University of Oxford / 2014 / 3 / f

Strict diagonal dominance givesThus every $b_{ii}\ne 0$, and the diagonal matrix $D$ has inverse $D^{-1}=\mathrm{diag}(1/b_{11},\dots ,1/b_{nn})$. The iteration matrix has entriesEach row Gershgorin disc for $T$ is centred at zero and has radiusTherefore every eigenvalue of $T$ satisfiesEquivalently, the induced matrix norm satisfies $\Vert T{\Vert }_{\infty }<1$, bounding the spectral radius. This is the usual Jacobi convergence from strict diagonal dominance; the Jacobi error matrix is $-T$, with the same eigenvalue magnitudes.