The QLP Approximation to the Singular Value Decomposition
A new decomposition, termed the pivoted QLP-decomposition, of a matrix is introduced. It is a postprocessing step to the pivoted QR-decomposition, used to determine the rank of a matrix. It is simply a further pivoted QR-decomposition of \(R^T\) of the first decomposition. The diagonals of the new R-factor (called L) are claimed to be a much better indicator to find gaps in the distribution of singular values than those of first R-factor. On the side, this leads to a new 2-norm estimator. The properties are demonstrated with some numerical examples. An explanation or even analysis of this new decomposition is still an open problem.
- Exponential dichotomy on the real line: SVD and QR methods
- On the adjugate matrix
- On the convergence of Stewart's QLP algorithm for approximating the SVD
- Single-pass randomized QLP decomposition for low-rank approximation
- Randomized quaternion QLP decomposition for low-rank approximation
- An efficient algorithm for computing the approximate t-URV and its applications
- Randomized QLP decomposition
- A note on the matrix-scaled total least squares problems with multiple solutions
- Lanczos method for large-scale quaternion singular value decomposition
- ALORA: affine low-rank approximations
- UTV Expansin pack: Special-purpose rank-revealing algorithms
- LSLQ: an iterative method for linear least-squares with an error minimization property
- Stewart's pivoted QLP decomposition for low‐rank matrices
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Subspaces analysis for random projection UTV framework
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- LNLQ: an iterative method for least-norm problems with an error minimization property
- scientific article; zbMATH DE number 270062 (Why is no real title available?)
- Randomized QR with column pivoting
- Algorithm 937: MINRES-QLP for symmetric and Hermitian linear equations and least-squares problems
- Randomized numerical linear algebra: Foundations and algorithms
- An efficient randomized QLP algorithm for approximating the singular value decomposition
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Pass-efficient truncated UTV for low-rank approximations
- Low-rank approximation: randomized QR with column pivoting and related methods using sparse projection and pass-efficient techniques
- A statistical view of column subset selection
- A novel adaptive low-rank matrix approximation method for image compression and reconstruction
- A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD
- A QR-method for computing the singular values via semiseparable matrices
- Randomized QLP decomposition for third-order tensors with unitary transform
- Deep-QLP and spline based quadrature rules for Fredholm integral equations of the first kind
- On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm
This page was built for publication: The QLP Approximation to the Singular Value Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4253065)
