An Algorithm on the Minimal Eigenvalue of an M-matrix with Centrosymmetric Structure

摘要：

The M-matrix is an important kind of structured matrix with many applications in various physics and engineering problems. In this paper, we focus on the minimal eigenvalue of an M-matrix. We first discuss the method of diagonal transformation, an algorithm for the spectral radius of irreducible nonnegative matrices. Based on it, an algorithm for the minimal eigenvalue of an M-matrix is constructed afterwards. A numerical example is given at last, showing the feasibility and validity of the algorithm presented.

关键词： M-matrix the minimal eigenvalue nonnegative matrices diagonal transformation

作者: Di Zhao Hongyi Li

作者单位: LMIB, School of Mathematics and System Science, Beihang University, Beijing, 100191, P.R. China EMC Lab, Beihang University, Beijing, 100191, P.R. China

会议类型: 国际会议

会议名称: 2011 International Conference on Information and Computer Networks(ICICN 2011)(2011年信息与计算机网络国际会议)

会议地点: 贵阳

会议语种:英文

页码: 235-238

在线出版日期: 2011-01-26（万方平台首次上网日期，不代表论文的发表时间）