Pass-efficient truncated UTV for low-rank approximations
From MaRDI portal
Publication:6125416
DOI10.1007/s40314-023-02584-4OpenAlexW4391174708WikidataQ129449596 ScholiaQ129449596MaRDI QIDQ6125416
Yuehua Feng, Yongxin Dong, Ying Ji
Publication date: 11 April 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-023-02584-4
Factorization of matrices (15A23) Eigenvalues, singular values, and eigenvectors (15A18) Numerical linear algebra (65F99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- On the convergence of Stewart's QLP algorithm for approximating the SVD
- Randomized LU decomposition
- Single-pass randomized QLP decomposition for low-rank approximation
- Randomized QLP decomposition
- Single-pass randomized algorithms for LU decomposition
- The WY Representation for Products of Householder Matrices
- LAPACK Users' Guide
- The QLP Approximation to the Singular Value Decomposition
- On Rank-Revealing Factorisations
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations
- Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices
- Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
- Subspace Iteration Randomization and Singular Value Problems
- Randomized QR with Column Pivoting
- Randomized numerical linear algebra: Foundations and algorithms
This page was built for publication: Pass-efficient truncated UTV for low-rank approximations
