Recently, some iterative characterizations of H-matrices have been proposed. These methods can have less computational complexity than the direct ones, but as they are all designed for a sequential computer, they may be not so effective for large scalar matrices. In this paper, based on the previous and new ideas, we discuss about the parallel characterization of H-matrices on the distributed-memory multiprocessor machines, and propose two new algorithms which need fewer number of iterations and less computational time than the earlier ones. Several numerical examples to show the effectiveness of the proposed algorithms are provided.
['Jianzhou Liu', 'Anqi He']
A parallel characterization of H-matrices