Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification
From MaRDI portal
Publication:5038410
DOI10.1137/21M1422513zbMath1500.65014arXiv2103.12109OpenAlexW3212944728MaRDI QIDQ5038410
Samuel M. Greene, Jonathan Weare, Robert J. Webber, Timothy C. Berkelbach
Publication date: 30 September 2022
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.12109
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Monte Carlo methods (65C05) Randomized algorithms (68W20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Markov chains and stochastic stability
- A data-driven approximation of the koopman operator: extending dynamic mode decomposition
- On the Markov chain central limit theorem
- Sharp a priori error estimates of the Rayleigh-Ritz method without assumptions of fixed sign or compactness
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- On a characterization of ordered pivotal sampling
- A comparison of pivotal sampling and unequal probability sampling with replacement
- Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix
- Matrix Algorithms
- Convergence Analysis of Markov Chain Monte Carlo Linear Solvers Using Ulam--von Neumann Algorithm
- Numerical Methods for Large Eigenvalue Problems
- An Algorithm for the Principal Component Analysis of Large Data Sets
- A Randomized Algorithm for Principal Component Analysis
- Unequal probability sampling without replacement through a splitting method
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Error Bounds for Dynamical Spectral Estimation
- First-Order Perturbation Theory for Eigenvalues and Eigenvectors
- The Full Configuration Interaction Quantum Monte Carlo Method through the Lens of Inexact Power Iteration
- Subspace Iteration Randomization and Singular Value Problems
- Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra
- A Variational Approach to Modeling Slow Processes in Stochastic Dynamical Systems
- The law of the iterated logarithm for stationary processes satisfying mixing conditions
- Some Limit Theorems for Stationary Processes
- Probability: A Graduate Course
This page was built for publication: Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification