Convergence of the power method for multiple eigenvalue
DOI:
https://doi.org/10.17721/2706-9699.2025.1.02Keywords:
power method, symmetric matrix, multiple eigenvalueAbstract
The convergence of the power method for calculating the multiple maximum modulo eigenvalue of a symmetric real matrix is investigated. It is proved that the power method converges if the matrix has only one maximum modulo simple or multiple eigenvalue.
References
Bai Z.-Z., Wu W.-T., Muratova G.V. The power method and beyond. Appl. Num.Math.2021. Vol. 164. P. 29–42.
Golub G.H. , Van Loan C.F. Matrix Computations, third edition. Baltimore: Johns Hopkins University Press, 1996. 674 p.
Van der Vorst H.A. Computational methods for large eigenvalue problems. Handbook of Num. Anal.2002. Vol. 8. P. 3–179.
Parlett B.N. The Symmetric Eigenvalue Problem. Philadelphia, PA: SIAM, 1998. 426 p.
Saad Y. Numerical Methods for Large Eigenvalue Problems, second edition. Philadelphia, PA: SIAM, 2011. 285 p.
Borm St., Mehl Ch. Numerical Methods for Eigenvalue Problems. Berlin / Boston: De Gruyter. 2010. 208 p.
Stewart D.E. Numerical Analysis: A Graduate Course. CMS/CAIMS Books in Mathematics, Springer, 2022. 632 p.
Berkhin P. A survey on PageRank computing. Internet Math. 2005. No. 2. P. 73–120.
Berkhin P. Bookmark-coloring algorithm for personalized PageRank computing. Internet Math.2006. No. 3. P. 41–62.
Langville A.N., Meyer C.D. Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton, N.J.: Princeton University Press, 2006. 233 p.
Gupta P., Goel A., Lin J., Sharma A., Wang D., Zadeh R. WTF: The who to follow service at Twitter. in: WWW 2013, Rio de Janeiro, Brazil, 2013, pp. 505–514.
Golub G.H., Ye Q. An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. SIAM J. Sci. Comput. 2002. Vol. 24. P. 312–334.
Bai Z.-Z., Miao C.-Q. On local quadratic convergence of inexact simplified Jacobi-Davidson method. Linear Algebra Appl.2017. Vol. 520. P. 215–241.
