A parallel iterative criterion for H-matrices

The theory of M-matrix and H-matrix plays an important role in many fields such as computational mathematics, mathematical physics, etc. Recently, some iterative algorithms for identifying H-matrices have been proposed, but these methods are all designed for implementing on a sequential computer, and may be ineffective for large scalar matrices. In this paper, based on the previous ideas, we propose a parallel iterative criterion implemented on the distributed-memory multiprocessor machines, which is convergent and costs less computational time than the earlier ones, we also present several numerical examples to show its effectiveness.