Accuracy of singular vectors obtained by projection-based SVD methods
An alternative approach for the computation of an approximate SVD of a large-scale matrix is proposed in this paper. The numerical approach of an SVD of a large-scale matrix is based on its projection onto lower-dimensional trial subspaces from both sides and the computation of the SVD of the small projected matrix that is again projected back to the original space. Following this basic approach, a low-rank approximate SVD to the original matrix is obtained and by extracting subsets from the approximate SVD, the approximate left and right singular subspaces are determined. The authors propose the estimation of the quality of the extraction process of the subsets from the approximate SVD in terms of the accuracy of the approximate singular subspaces, measured by the angle between the exact and extracted subspaces in relation to the angle between the exact and trial subspaces. This estimation leads to the conclusion that the extracted approximate subspaces are optimal usually to within a modest constant.
- Majorization bounds for SVD
- Fast approximate truncated SVD.
- Recursive Calculation of Dominant Singular Subspaces
- Estimation of singular values of very large matrices using random sampling
- Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation
- A generalization of Saad's theorem on Rayleigh-Ritz approximations
- A Jacobi--Davidson type SVD method
- A note on eigenvalues of perturbed Hermitian matrices
- Computing interior eigenvalues of large matrices
- Convergence of the block Lanczos method for eigenvalue clusters
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Functions of Matrices
- Galerkin eigenvector approximations
- 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 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Matrix algorithms. Vol. 2: Eigensystems
- New estimates for Ritz vectors
- Numerical methods for large eigenvalue problems
- Perturbation bounds in connection with singular value decomposition
- Perturbation of spectral subspaces and solution of linear operator equations
- Quadratic Residual Bounds for the Hermitian Eigenvalue Problem
- Subspace Iteration Randomization and Singular Value Problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Rotation of Eigenvectors by a Perturbation. III
- Towards a Generalized Singular Value Decomposition
- Accuracy of two SVD algorithms for \(2\times 2\) triangular matrices
- Majorization bounds for SVD
- Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem
- Improving the Accuracy of Computed Singular Values
- Recursive Calculation of Dominant Singular Subspaces
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- Sharp error bounds for Ritz vectors and approximate singular vectors
- Efficient algorithms for eigensystem realization using randomized SVD
- Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
- Optimal approximation of a large matrix by a sum of projected linear mappings on prescribed subspaces
This page was built for publication: Accuracy of singular vectors obtained by projection-based SVD methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689319)
