A new algorithmic characterization of H-matrices

摘要

An algorithmic characterization of H-matrices was provided by Huang et al. [Comput. Math. Appl. 48 (2004) 1587–1601]. In this paper, we propose a new non-parameter method, which is always convergent in finite iterative steps for H-matrices and needs fewer number of iterations than that of Huang et al.; we also provide an improved algorithm for a general matrix, which decreases the wasteful computations when the given matrix is not an H-matrix. Several numerical examples for the effectiveness of the proposed algorithms are presented.