An iterative criterion for H-Matrices

We provide an algorithmic characterization of H-matrices. When A is an H-matrix, this algorithm determines a positive diagonal matrix D such that AD is strictly row diagonally dominant. In effect, D is produced iteratively by quantifying and redistributing the diagonal dominance present in some rows of A to the non-diagonally-dominant rows.