Randomized QLP decomposition
From MaRDI portal
Recommendations
- Single-pass randomized QLP decomposition for low-rank approximation
- Randomized quaternion QLP decomposition for low-rank approximation
- Stewart's pivoted QLP decomposition for low‐rank matrices
- Randomized algorithms for the low-rank approximation of matrices
- Randomized methods for matrix computations
Cites work
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A fast randomized algorithm for the approximation of matrices
- A randomized algorithm for principal component analysis
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Analysis of a QR Algorithm for Computing Singular Values
- Communication avoiding rank revealing QR factorization with column pivoting
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Householder QR factorization with randomization for column pivoting (HQRRP)
- On the convergence of Stewart's QLP algorithm for approximating the SVD
- Practical sketching algorithms for low-rank matrix approximation
- Randomized Algorithms for Matrices and Data
- Randomized QR with column pivoting
- Rang revealing QR factorizations
- Regularization tools version 4.0 for matlab 7.3
- Stewart's pivoted QLP decomposition for low‐rank matrices
- Subspace Iteration Randomization and Singular Value Problems
- The QLP Approximation to the Singular Value Decomposition
Cited in
(10)- Single-pass randomized QLP decomposition for low-rank approximation
- Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting
- Low-rank approximation algorithm using sparse projection and its applications
- Subspaces analysis for random projection UTV framework
- Randomized quaternion QLP decomposition for low-rank approximation
- Low-rank approximation: randomized QR with column pivoting and related methods using sparse projection and pass-efficient techniques
- An efficient randomized QLP algorithm for approximating the singular value decomposition
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- Pass-efficient truncated UTV for low-rank approximations
- Stewart's pivoted QLP decomposition for low‐rank matrices
This page was built for publication: Randomized QLP decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176120)