DocumentCode
3227033
Title
An algorithm on the minimal eigenvalue of an M-matrix with centrosymmetric structure
Author
Zhao, Di ; Li, Hongyi
Author_Institution
Sch. of Math. & Syst. Sci., Beihang Univ., Beijing, China
fYear
2011
fDate
27-29 May 2011
Firstpage
235
Lastpage
238
Abstract
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.
Keywords
eigenvalues and eigenfunctions; matrix algebra; M-matrix; centrosymmetric structure; diagonal transformation; irreducible nonnegative matrices; minimal eigenvalue; spectral radius; Approximation methods; Eigenvalues and eigenfunctions; M-matrix; diagonal transformation; nonnegative matrices; the minimal eigenvalue;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on
Conference_Location
Xi´an
Print_ISBN
978-1-61284-485-5
Type
conf
DOI
10.1109/ICCSN.2011.6014041
Filename
6014041
Link To Document