A strictly diagonally dominant matrix guarantees convergence of the Jacobi method for every initial vector.[ref]
Notes for Ma221 Lecture 21, Nov 10 2009. Math 221, Matrix Computations, Fall 2009; Theorem 1 on strict row diagonal dominance and its proof beginning “Split A = D − (D − A)”
Indeed, using the maximum norm , the induced operator norm is the largest absolute row sum. The Jacobi method has and for , soThis gives a cheap sufficient check without computing any eigenvalues. For the Jacobi iteration for a three-variable tridiagonal system, the absolute row sums of are , giving . The true spectral radius gives a sharper eventual rate.
Strict diagonal dominance is sufficient, not necessary: violates it in the first row, but its Jacobi method has eigenvalues and converges. Conversely, being a positive-definite matrix alone is insufficient: the Jacobi convergence for a three-by-three equicorrelation matrix with has positive eigenvalues for , but spectral radius for its iteration matrix. The extra tridiagonal matrix structure in Jacobi convergence for a symmetric positive-definite tridiagonal matrix is therefore substantive.
Articles by others on the same topic
There are currently no matching articles.