An iterative algorithm for searching a scaling matrix for diagonal dominance (Q556117)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative algorithm for searching a scaling matrix for diagonal dominance |
scientific article |
Statements
An iterative algorithm for searching a scaling matrix for diagonal dominance (English)
0 references
13 June 2005
0 references
It is well known that a real (or complex) square matrix \(A\) is an \(M\)-matrix (or \(H\)-matrix) if and only if there exists a positive diagonal matrix \(D\) such that \(AD\) is strictly diagonally dominant. The paper introduces a convergent iteration algorithm to compute the scaling matrix \(D\) for irreducible \(M\) (or \(H\)) matrices.
0 references
Scaling
0 references
Diagonal dominance
0 references
\(H\)-matrix
0 references
\(M\)-matrix
0 references
Iterative algorithm
0 references
