Diagonally Dominant Matrix
In mathematics, a 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.
Read more about Diagonally Dominant Matrix: Variations, Examples, Applications and Properties
Famous quotes containing the words dominant and/or matrix:
“Don’t you realize that as long as you have to sit down to pee, you’ll never be a dominant force in the world? You’ll never be a convincing technocrat or middle manager. Because people will know. She’s in there sitting down.”
—Don Delillo (b. 1926)
“In all cultures, the family imprints its members with selfhood. Human experience of identity has two elements; a sense of belonging and a sense of being separate. The laboratory in which these ingredients are mixed and dispensed is the family, the matrix of identity.”
—Salvador Minuchin (20th century)