Admissible subspaces and the subspace iteration method
From MaRDI portal
Publication:6149879
DOI10.1007/s10543-024-01012-1MaRDI QIDQ6149879
Publication date: 5 March 2024
Published in: BIT (Search for Journal in Brave)
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Faster least squares approximation
- Perturbation analysis of singular subspaces and deflating subspaces
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Computational Advertising: Techniques for Targeting Relevant Ads
- Numerical Methods for Large Eigenvalue Problems
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap
- Relative-Error $CUR$ Matrix Decompositions
- Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms
- Regularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximations
- Sampling and multilevel coarsening algorithms for fast matrix approximations
- Subspace Iteration Randomization and Singular Value Problems
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Near-Optimal Column-Based Matrix Reconstruction
- Perturbation bounds in connection with singular value decomposition
- Angles between subspaces and their tangents
