An efficient randomized QLP algorithm for approximating the singular value decomposition
From MaRDI portal
Publication:6052614
DOI10.1016/j.ins.2023.119464arXiv2110.01011OpenAlexW4385741208MaRDI QIDQ6052614
No author found.
Publication date: 22 September 2023
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.01011
singular value decompositionhigh-performance computingcommunication-avoiding algorithmrandomized samplingpivoted QLP
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rang revealing QR factorizations
- Low-rank revealing \(UTV\) decompositions
- On the convergence of Stewart's QLP algorithm for approximating the SVD
- Space-time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems
- An efficient algorithm for computing the approximate t-URV and its applications
- Principal regression for high dimensional covariance matrices
- A block QR algorithm and the singular value decomposition
- Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD
- The university of Florida sparse matrix collection
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
- Basic Linear Algebra Subprograms for Fortran Usage
- The QLP Approximation to the Singular Value Decomposition
- A set of level 3 basic linear algebra subprograms
- A BLAS-3 Version of the QR Factorization with Column Pivoting
- The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale
- Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations
- Singular Value Decomposition Approximation via Kronecker Summations for Imaging Applications
- Efficient Low-Rank Approximation of Matrices Based on Randomized Pivoted Decomposition
- Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices
- randUTV
- Updating a Rank-Revealing ULV Decomposition
- Numerical Methods in Matrix Computations
- Functions of Matrices
- Parallel QR Factorization of Block Low-rank Matrices
This page was built for publication: An efficient randomized QLP algorithm for approximating the singular value decomposition