Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
From MaRDI portal
Publication:5373926
DOI10.1137/16M1091745zbMath1390.15027arXiv1609.00671OpenAlexW2963441460MaRDI QIDQ5373926
Ilse C. F. Ipsen, Eugenia-Maria Kontopoulou, Malik Magdon-Ismail, Petros Drineas
Publication date: 6 April 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00671
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Randomized algorithms (68W20)
Related Items
A Probabilistic Subspace Bound with Application to Active Subspaces, Krylov-Aware Stochastic Trace Estimation, Admissible subspaces and the subspace iteration method, Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers, Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms, Sketching for Principal Component Regression, Uniform Error Estimates for the Lanczos Method, Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views, Randomized block Krylov subspace methods for trace and log-determinant estimators, Randomized block Krylov methods for approximating extreme eigenvalues, Low-Rank Matrix Approximations Do Not Need a Singular Value Gap, Estimating Leverage Scores via Rank Revealing Methods and Randomization, A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Convergence of the block Lanczos method for eigenvalue clusters
- Faster least squares approximation
- Restarted block Lanczos bidiagonalization methods
- Some norm inequalities concerning generalized inverses
- On relative residual bounds for the eigenvalues of a Hermitian matrix
- Computational Advertising: Techniques for Targeting Relevant Ads
- Numerical Methods for Large Eigenvalue Problems
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Low-Rank Approximation and Regression in Input Sparsity Time
- Computation of Generalized Matrix Functions
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- Relative-Error $CUR$ Matrix Decompositions
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Improving the Accuracy of Inverse Iteration
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- On generalized matrix functions
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- A fast and efficient algorithm for low-rank approximation of a matrix
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Subspace Gap Residuals for Rayleigh–Ritz Approximations
- Subspace Iteration Randomization and Singular Value Problems
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- Low Rank Matrix-Valued Chernoff Bounds and Approximate Matrix Multiplication
- Numerical Methods in Matrix Computations
- Near-Optimal Column-Based Matrix Reconstruction
- Near Optimal Column-Based Matrix Reconstruction
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Angles between subspaces and their tangents
