An improved iterative algorithm for searching a scaling matriz 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.
diagonal dominance H-matriz M-matriz spectral radius
Sheng Zhou Tingzhu Huang
School of Applied Mathematics, University of Electronic Science and Technology of China,Chengdu, Sichuan, 610054, China
国际会议
The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)
杭州
英文
1466-1469
2009-07-09(万方平台首次上网日期,不代表论文的发表时间)