An Efficient Algorithm for Finding the Maximal Eigenvalue of Zero Symmetric Nonnegative Matrices

Gang Wang and Lihong Sun

Mathematical Problems in Engineering, 2018, vol. 2018, 1-7

Abstract:

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 - matrices.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/6438106.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/6438106.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:6438106

DOI: 10.1155/2018/6438106

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().