Iterative Methods for the Computation of the Perron Vector of Adjacency Matrices
Citations Over Time
Abstract
The power method is commonly applied to compute the Perron vector of large adjacency matrices. Blondel et al. [SIAM Rev. 46, 2004] investigated its performance when the adjacency matrix has multiple eigenvalues of the same magnitude. It is well known that the Lanczos method typically requires fewer iterations than the power method to determine eigenvectors with the desired accuracy. However, the Lanczos method demands more computer storage, which may make it impractical to apply to very large problems. The present paper adapts the analysis by Blondel et al. to the Lanczos and restarted Lanczos methods. The restarted methods are found to yield fast convergence and to require less computer storage than the Lanczos method. Computed examples illustrate the theory presented. Applications of the Arnoldi method are also discussed.
Related Papers
- Comparison of subspace iteration, iterative Ritz vector method and iterative Lanczos method(2005)
- → Determination of Natural Frequencies and Mode Shapes of Structures Using Subspace Iteration Method with Accelerated Starting Vectors(2005)3 cited
- → Iterative Methods for the Computation of the Perron Vector of Adjacency Matrices(2021)1 cited
- → Improved Analyses of the Randomized Power Method and Block Lanczos Method(2015)13 cited
- → A two-step iterative block Lanczos algorithm for a dominant eigenspan(1987)