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

الملخص 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.