An efficient algorithm for finding the maximal eigenvalue of zero symmetric nonnegative matrices (Q1721253)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for finding the maximal eigenvalue of zero symmetric nonnegative matrices |
scientific article; zbMATH DE number 7019302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for finding the maximal eigenvalue of zero symmetric nonnegative matrices |
scientific article; zbMATH DE number 7019302 |
Statements
An efficient algorithm for finding the maximal eigenvalue of zero symmetric nonnegative matrices (English)
0 references
8 February 2019
0 references
Summary: 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.
0 references
0 references
0 references
0 references
0.93833077
0 references
0.9013208
0 references
0.8999087
0 references
0.8992785
0 references
0.8966038
0 references
0.8939084
0 references
0.89348525
0 references
