Diagonally Dominant Matrix — Definition, Formula & Example
A diagonally dominant matrix is a square matrix in which each diagonal entry, ignoring sign, is at least as large as all the other entries in its row added together, also ignoring sign. If the diagonal entry is strictly larger in every row, the matrix is strictly diagonally dominant.
An matrix is (row) diagonally dominant if for every . It is strictly diagonally dominant if the inequality is strict for every . Column diagonal dominance is defined the same way using sums down columns instead of across rows, so is column diagonally dominant exactly when is row diagonally dominant.
Key Formula
Where:
- = Diagonal entry in row i
- = Entry in row i, column j, where j is not equal to i
- = Number of rows and columns of the square matrix
Worked Example
Problem: Decide whether is strictly diagonally dominant. Then state what this tells you about whether is invertible.
Step 1: For each row, add the absolute values of the off-diagonal entries.
Step 2: Compare each diagonal entry, in absolute value, with its row sum. All three inequalities are strict, so is strictly diagonally dominant.
Step 3: The Levy–Desplanques theorem says every strictly diagonally dominant matrix is invertible. You can confirm this with a cofactor expansion along row 1. The determinant is nonzero, as the theorem predicts.
Answer: is strictly diagonally dominant, so it is invertible. Its determinant is , which agrees with the theorem.
Why It Matters
In a numerical analysis course, strict diagonal dominance of the coefficient matrix guarantees that the Jacobi and Gauss–Seidel iterative methods converge for every starting guess. It also guarantees that Gaussian elimination can run without row swaps. Engineers use these facts when solving large systems from heat-flow and circuit models, where diagonal dominance often holds naturally.
Common Mistakes
Mistake: Assuming any diagonally dominant matrix is invertible, even when some rows have equality instead of a strict inequality.
Correction: Weak dominance alone does not guarantee invertibility. For example, satisfies in both rows, but its determinant is . Check that every row has a strict inequality before you apply the theorem.
