Dynamically accelerating the power iteration with momentum (2403.09618v2)
Abstract: In this paper, we propose, analyze and demonstrate a dynamic momentum method to accelerate power and inverse power iterations with minimal computational overhead. The method can be applied to real diagonalizable matrices, is provably convergent with acceleration in the symmetric case, and does not require a priori spectral knowledge. We review and extend background results on previously developed static momentum accelerations for the power iteration through the connection between the momentum accelerated iteration and the standard power iteration applied to an augmented matrix. We show that the augmented matrix is defective for the optimal parameter choice. We then present our dynamic method which updates the momentum parameter at each iteration based on the Rayleigh quotient and two previous residuals. We present convergence and stability theory for the method by considering a power-like method consisting of multiplying an initial vector by a sequence of augmented matrices. We demonstrate the developed method on a number of benchmark problems, and see that it outperforms both the power iteration and often the static momentum acceleration with optimal parameter choice. Finally, we present and demonstrate an explicit extension of the algorithm to inverse power iterations.
- I. Babuška and J. Osborn. Eigenvalue problems. In P. G. Ciarlet and J. L. Lions, editors, Handbook of Numerical Analysis. II: Finite Element Methods (Part 1), pages 641–787. North-Holland, Amsterdam, 1991.
- The power method and beyond. Applied Numerical Mathematics, 2020.
- C. Brezinski. Computation of the eigenelements of a matrix by the ε𝜀\varepsilonitalic_ε-algorithm. Linear Algebra and its Applications, 11(1):7–20, 1975.
- C. Brezinski and M. Redivo-Zaglia. The PageRank vector: properties, computation, approximation, and acceleration. SIAM J. Matrix Anal. Appl., 28:551–575, 2006.
- E. R. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. Journal of Computational Physics, 17(1):87–94, 1975.
- T. A. Davis and Y. Hu. The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software, 38(1):1–25, 2011.
- A robust and efficient implementation of LOBPCG. SIAM Journal on Scientific Computing, 40(5):C655–C676, 2018.
- G. H. Golub and C. Greif. An Arnoldi-type algorithm for computing page rank. BIT Numerical Mathematics, 46:759–771, 2006.
- Matrix Computations (3rd Ed.). Johns Hopkins University Press, Baltimore, MD, USA, 1996.
- G. H. Golub and Q. Ye. An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. SIAM Journal on Scientific Computing, 24(1):312–334, 2002.
- Computing PageRank using power extrapolation, 2003. Technical report SCCM03-02, Stanford University, Stanford, CA.
- M. Hochstenbach and Y. Notay. The jacobi–davidson method. GAMM-Mitteilungen, 29(2):368–382, 2006.
- A variant of the Power-Arnoldi algorithm for computing PageRank. Journal of Computational and Applied Mathematics, 381:113034, 2021.
- I. C. F. Ipsen. Computing an eigenvector with inverse iteration. SIAM Review, 39(2):254–291, 1997.
- S. Kamvar. Numerical Algorithms for Personalized Search in Self-organizing Information Networks. Princeton University Press, Princeton, 2010.
- A. V. Knyazev. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM Journal on Scientific Computing, 23(2):517–541, 2001.
- N. Nigam and S. Pollock. A simple extrapolation method for clustered eigenvalues. Numerical Algorithms, 89:115–143, 2022.
- S. Pollock and L. R. Scott. Extrapolating the Arnoldi algorithm to improve eigenvector convergence. International Journal of Numerical Analysis and Modeling, 18(5):712–721, 2021.
- B. T. Polyak. Some methods of speeding up the convergence of iteration methods. USSR Computational Mathematics and Mathematical Physics, 45:1–17, 1964.
- P. Quillen and Q. Ye. A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. Journal of Computational and Applied Mathematics, 233(5):1298–1313, 2010. Special Issue Dedicated to William B. Gragg on the Occasion of His 70th Birthday.
- Practical and fast momentum-based power methods. In J. Bruna, J. Hesthaven, and L. Zdeborova, editors, Proceedings of the 2nd Mathematical and Scientific Machine Learning Conference, volume 145 of Proceedings of Machine Learning Research, pages 721–756. PMLR, 2022.
- Accelerated stochastic power iteration. Proc. Mach. Learn. Res., 84:58–67, 2019.
- Y. Saad. Numerical methods for large eigenvalue problems: revised edition, volume 66. Society for Industrial and Applied Mathematics, Philadelphia, PS, USA, 2011.
- A. Sidi. Approximation of largest eigenpairs of matrices and applications to Pagerank computation.
- A. Sidi. Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations. Computers & Mathematics with Applications, 56:1–24, 2008.
- J. H. Wilkinson. The Algebraic Eigenvalue Problem. Clarendon Press, Oxford, 1965.