An iterative algorithm for searching a scaling matrix for diagonal dominance
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.
scientific article; zbMATH DE number 2175200