On randomized power methods for computing dominant eigenpairs of symmetric matrices

DOI10.1016/J.APNUM.2026.08.002MaRDI QIDQ7363826zbMATH OpenFDO

Authors Zhong-Zhi Bai, Yanqi Chen

Publication date 30 September 2026

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APNUM.2026.08.002

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Cites work

• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 1433445 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Lectures on randomized numerical linear algebra
• Matrix Analysis and Computations
• Numerical methods for large eigenvalue problems
• Randomized algorithms in numerical linear algebra
• Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
• The power method and beyond
• The University of Florida sparse matrix collection

This page was built for publication: On randomized power methods for computing dominant eigenpairs of symmetric matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363826)