Skip to main content

Numerical Methods · Linear systems, least squares, and eigenproblems

Let A ∈ ℝ^(n×n) be strictly row-diagonally dominant, and let G_J=D⁻¹(L+U) be the Jacobi…

Problem

Numerical Methods practice problem

Let A∈Rn×nA\in\mathbb{R}^{n\times n} be strictly row-diagonally dominant, and let GJ=D−1(L+U)G_J=D^{-1}(L+U) be the Jacobi iteration matrix. Prove that ∥GJ∥∞<1\|G_J\|_\infty<1, and deduce that Jacobi iteration converges for every b∈Rn\mathbf{b}\in\mathbb{R}^n and every initial vector x(0)\mathbf{x}^{(0)}.

Hint

Hint

The infinity-norm of a matrix is the largest absolute row sum. For GJG_J that row sum is precisely the off-diagonal mass of row ii of AA, scaled by ∣aii∣|a_{ii}|.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Numerical Methods sample problem: Try the free sample problem.

More Numerical Methods practice problems

Back to Numerical Methods

An original ProofAnvil practice problem, written for this course. ProofAnvil is a practice course, not a homework-answer service.