Admissible subspaces and the subspace iteration method

DOI10.1007/S10543-024-01012-1MaRDI QIDQ6149879zbMATH OpenFDO

Authors P. G. Massey

Publication date 5 March 2024

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10543-024-01012-1

zbMATH Keywords

admissible subspacedominant subspacesprincipal anglessingular value decomposition

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• An enhanced formulation of error bound in subspace iteration method
• scientific article; zbMATH DE number 2232693
• Subspace Iteration Randomization and Singular Value Problems
• Recursive Calculation of Dominant Singular Subspaces

Cites work

• Angles between subspaces and their tangents
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Faster least squares approximation
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 3799843 (Why is no real title available?)
• Low-Rank Matrix Approximations Do Not Need a Singular Value Gap
• Near-optimal column-based matrix reconstruction
• Numerical methods for large eigenvalue problems
• Perturbation analysis of singular subspaces and deflating subspaces
• Perturbation bounds in connection with singular value decomposition
• 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
• Relative-Error CUR Matrix Decompositions
• Sampling and multilevel coarsening algorithms for fast matrix approximations.
• Sketching as a tool for numerical linear algebra
• Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
• Subspace Iteration Randomization and Singular Value Problems

Cited in

(1)

• Efficient bounds and estimates for canonical angles in randomized subspace approximations

This page was built for publication: Admissible subspaces and the subspace iteration method

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