Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
Authors:
- 1 January 2008
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 414-423
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Sampling from large matricesJournal of the ACM, 2007
- Subset selection for matricesLinear Algebra and its Applications, 2007
- Fast monte-carlo algorithms for finding low-rank approximationsJournal of the ACM, 2004
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Atomic Decomposition by Basis PursuitSIAM Review, 2001
- Efficient Algorithms for Computing a Strong Rank-Revealing QR FactorizationSIAM Journal on Scientific Computing, 1996
- On Rank-Revealing FactorisationsSIAM Journal on Matrix Analysis and Applications, 1994
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- Rank revealing QR factorizationsLinear Algebra and its Applications, 1987
- Projection Pursuit RegressionJournal of the American Statistical Association, 1981