# Diagonally dominant matrix

In mathematics, a square matrix is said to be diagonally dominant if for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row. More precisely, the matrix A is diagonally dominant if

where aij denotes the entry in the ith row and jth column.

Note that this definition uses a weak inequality, and is therefore sometimes called weak diagonal dominance. If a strict inequality (>) is used, this is called strict diagonal dominance. The unqualified term diagonal dominance can mean both strict and weak diagonal dominance, depending on the context.[1]

## Variations

The definition in the first paragraph sums entries across rows. It is therefore sometimes called row diagonal dominance. If one changes the definition to sum down columns, this is called column diagonal dominance.

Any strictly diagonally dominant matrix is trivially a weakly chained diagonally dominant matrix. Weakly chained diagonally dominant matrices are nonsingular and include the family of irreducibly diagonally dominant matrices. These are irreducible matrices that are weakly diagonally dominant, but strictly diagonally dominant in at least one row.

## Examples

The matrix

is diagonally dominant because

since
since
since   .

The matrix

is not diagonally dominant because

since
since
since   .

That is, the first and third rows fail to satisfy the diagonal dominance condition.

The matrix

is strictly diagonally dominant because

since
since
since   .

## Applications and properties

A strictly diagonally dominant matrix (or an irreducibly diagonally dominant matrix[2]) is non-singular. This result is known as the Levy–Desplanques theorem.[3] This can be proved, for strictly diagonal dominant matrices, using the Gershgorin circle theorem.

A Hermitian diagonally dominant matrix with real non-negative diagonal entries is positive semidefinite.

Proof: Let the diagonal matrix contain the diagonal entries of . Connect and via a segment of matrices . This segment consists of strictly diagonally dominant (thus nonsingular) matrices, except maybe for . This shows that . Applying this argument to the principal minors of , the positive semidefiniteness follows by Sylvester's criterion.

If the symmetry requirement is eliminated, such a matrix is not necessarily positive semidefinite. For example, consider

However, the real parts of its eigenvalues remain non-negative by the Gershgorin circle theorem.

Similarly, an Hermitian strictly diagonally dominant matrix with real positive diagonal entries is positive definite, as it equals to the sum of some Hermitian diagonally dominant matrix with real non-negative diagonal entries (which is positive semidefinite) and for some positive real number (which is positive definite).

No (partial) pivoting is necessary for a strictly column diagonally dominant matrix when performing Gaussian elimination (LU factorization).

The Jacobi and Gauss–Seidel methods for solving a linear system converge if the matrix is strictly (or irreducibly) diagonally dominant.

Many matrices that arise in finite element methods are diagonally dominant.

A slight variation on the idea of diagonal dominance is used to prove that the pairing on diagrams without loops in the Temperley–Lieb algebra is nondegenerate.[4] For a matrix with polynomial entries, one sensible definition of diagonal dominance is if the highest power of appearing in each row appears only on the diagonal. (The evaluations of such a matrix at large values of are diagonally dominant in the above sense.)

## Notes

1. For instance, Horn and Johnson (1985, p. 349) use it to mean weak diagonal dominance.
2. Horn and Johnson, Thm 6.2.27.
3. Horn and Johnson, Thm 6.1.10. This result has been independently rediscovered dozens of times. A few notable ones are Lévy (1881), Desplanques (1886), Minkowski (1900), Hadamard (1903), Schur, Markov (1908), Rohrbach (1931), Gershgorin (1931), Artin (1932), Ostrowski (1937), and Furtwängler (1936). For a history of this "recurring theorem" see: Taussky, Olga (1949). "A recurring theorem on determinants". American Mathematical Monthly. The American Mathematical Monthly, Vol. 56, No. 10. 56 (10): 672–676. doi:10.2307/2305561. JSTOR 2305561. Another useful history is in: Schneider, Hans (1977). "Olga Taussky-Todd's influence on matrix theory and matrix theorists". Linear and Multilinear Algebra. 5 (3): 197–224. doi:10.1080/03081087708817197.
4. K.H. Ko and L. Smolinski (1991). "A combinatorial matrix in 3-manifold theory". Pacific J. Math. 149: 319–336.

## References

• Gene H. Golub & Charles F. Van Loan. Matrix Computations, 1996. ISBN 0-8018-5414-8
• Roger A. Horn & Charles R. Johnson. Matrix Analysis, Cambridge University Press, 1985. ISBN 0-521-38632-2 (paperback).