An Efficient Algorithm for Finding the Maximal Eigenvalue of Zero Symmetric Nonnegative Matrices
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-11-29
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
In this paper, we propose an improved power algorithm for finding maximal eigenvalues.
Without any partition, we can get the maximal eigenvalue and show that the modified power algorithm is convergent for zero symmetric reducible nonnegative matrices.
Numerical results are reported to demonstrate the effectiveness of the modified power algorithm.
Finally, a modified algorithm is proposed to test the positive definiteness (positive semidefiniteness) of Z-matrices.
American Psychological Association (APA)
Wang, Gang& Sun, Lihong. 2018. An Efficient Algorithm for Finding the Maximal Eigenvalue of Zero Symmetric Nonnegative Matrices. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-7.
https://search.emarefa.net/detail/BIM-1208403
Modern Language Association (MLA)
Wang, Gang& Sun, Lihong. An Efficient Algorithm for Finding the Maximal Eigenvalue of Zero Symmetric Nonnegative Matrices. Mathematical Problems in Engineering No. 2018 (2018), pp.1-7.
https://search.emarefa.net/detail/BIM-1208403
American Medical Association (AMA)
Wang, Gang& Sun, Lihong. An Efficient Algorithm for Finding the Maximal Eigenvalue of Zero Symmetric Nonnegative Matrices. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-7.
https://search.emarefa.net/detail/BIM-1208403
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1208403