An interleaved iterative criterion for \(H\)-matrices (Q876655)

To check whether a matrix A is an H-matrix or not can be replaced by the check whether A is a generalized diagonally dominant matrix (GDDM) or not. Two algorithms are presented, they check the H-matrix property for irreducible matrices thus constructing a positive diagonal matrix D such that AD is GDDM. These algorithms are compared with those given by \textit{L. Li, H. Niki, Y. Gao} and \textit{M. Sasanabe} [Int. J. Comput. Math. 71, No.~2, 267--275 (1999; Zbl 0920.65018)] and \textit{T. Kohno, H. Niki, Y. Gao} and \textit{H. Sawami} [J. Comput. Appl. Math. 115, No.~1--2, 349--355 (2000; Zbl 0946.65021)]. It is proved that the algorithm stops after a finite number of steps computing a diagonal matrix D if A is an H-matrix. Two \(4\times 4\) examples reporting only the number of iterations (to check the H-matrix property) are given.