Close to optimal column approximation using a single SVD
From MaRDI portal
Cites work
- A theory of pseudoskeleton approximations
- Adaptive low-rank approximation of collocation matrices
- An improved approximation algorithm for the column subset selection problem
- CUR matrix decompositions for improved data analysis
- Column subset selection is NP-complete
- Column subset selection via sparse approximation of SVD
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient volume sampling for row/column subset selection
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- How to find a good submatrix
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Matrix approximation and projective clustering via volume sampling
- Numerical Linear Algebra
- On the accuracy of cross and column low-rank maxvol approximations in average
- On the existence and computation of rank-revealing LU factorizations
- On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
- Polynomial time \(\rho\)-locally maximum volume search
- Strong rank revealing LU factorizations
Cited in
(2)
This page was built for publication: Close to optimal column approximation using a single SVD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932142)