Column subset selection via sparse approximation of SVD
From MaRDI portal
Recommendations
- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
- An improved approximation algorithm for the column subset selection problem
- Faster subset selection for matrices and applications
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- Optimal column-based low-rank matrix reconstruction
Cites work
- scientific article; zbMATH DE number 1305418 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Adaptive greedy approximations
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- An improved approximation algorithm for the column subset selection problem
- Bounds on singular values revealed by QR factorizations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient subspace approximation algorithms
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast computation of low rank matrix approximations
- Fast monte-carlo algorithms for finding low-rank approximations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Greed is Good: Algorithmic Results for Sparse Approximation
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Low‐rank revealing QR factorizations
- Numerical Linear Algebra
- On Rank-Revealing Factorisations
- Random vectors in the isotropic position
- Rang revealing QR factorizations
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Relative-Error $CUR$ Matrix Decompositions
- Sampling from large matrices
- Sampling-based dimension reduction for subspace approximation
- Smoothed analysis of algorithms
- Sparse Approximate Solutions to Linear Systems
- Subset selection for matrices
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Vector greedy algorithms
Cited in
(15)- A training set subsampling strategy for the reduced basis method
- An improved approximation algorithm for the column subset selection problem
- Column subset selection problem is UG-hard
- Low rank approximation of binary matrices: column subset selection and generalizations
- On the accuracy of cross and column low-rank maxvol approximations in average
- Empirical column selection method in the simplex method
- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
- Optimal column subset selection for image classification by genetic algorithms
- Faster subset selection for matrices and applications
- Literature survey on low rank approximation of matrices
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Regularized greedy column subset selection
- Beyond symmetry: best submatrix selection for the sparse truncated SVD
- Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
This page was built for publication: Column subset selection via sparse approximation of SVD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764372)
