A NEW ALGORITHM FOR THE SPECTRAL RADIUS AND ITS EIGENVECTOR OF A LARGE SCALE NONNEGATIVE IRREDUCIBLE SPARSE MATRIX
一个求大规模非负不可约稀疏矩阵的谱半径及特征向量的新算法

In this paper, a new algorithm for the spectral radius and its associated eigenvector of a nonnegative irreducible matrix is designed. The proof of convergence of the algorithm is also presented. The labor of calculation of this algorithm is not larger, the store of being occupied is lesser, and there is the same schema of zero element in it. So the superiority of this algorithm is obvious when we compute large sparse matrices. Finally, numerical experiments demonstrate that our algorithm is feasible.