Subspaces Analysis for Random Projection UTV Framework
From MaRDI portal
Publication:5099408
DOI10.1137/21M1451592OpenAlexW4289854162MaRDI QIDQ5099408
Publication date: 31 August 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1451592
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Rang revealing QR factorizations
- Low-rank revealing \(UTV\) decompositions
- UTV tools: Matlab templates for rank-revealing UTV decompositions
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Randomized QLP decomposition
- Regularization with randomized SVD for large-scale discrete inverse problems
- Optimal CUR Matrix Decompositions
- Randomized algorithms for the low-rank approximation of matrices
- Randomized Algorithms for Matrices and Data
- A Randomized Algorithm for Principal Component Analysis
- The QLP Approximation to the Singular Value Decomposition
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Subspace Iteration Randomization and Singular Value Problems
- Updating a Rank-Revealing ULV Decomposition
- Randomized QR with Column Pivoting
This page was built for publication: Subspaces Analysis for Random Projection UTV Framework