An improved iterative algorithm for searching a scaling matrix for diagonal dominance

摘要

An iterative method is given in [2] to search a scaling matrix for diagonal dominance. In this paper, we present an improved version. The new algorithm is proved to be convergent and needs less iteration. Also from the new algorithm, a lower bound of the spectral radius of H-matrix is given.