A new non-parameter criterion for H-matrices
Computers & Mathematics with Applications
Faster approximate lossy generalized flow via interior point algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A note on identifying generalized diagonally dominant matrices
International Journal of Computer Mathematics
Accurate solution of dense linear systems, Part II: Algorithms using directed rounding
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
An iterative method for identifying generalized diagonally dominant matrices\break (GDDMs, or H-matrices) was given in [B. Li et al., Linear Algebra Appl., 271 (1998), pp. 179--190], where the method is divergent when the matrix is not a GDDM. In this paper, we present an improved version. The new method is always convergent and needs fewer iterations than the earlier one. Some interesting features of the new method are presented. Spectral radii of nonnegative matrices with a constant diagonal entry also can be computed by our method.