On selecting a maximum volume sub-matrix of a matrix and related problems
Authors:
- Ali ÇivrilAÇAli Çivril
- Malik Magdon-IsmailMMMalik Magdon-Ismail
Top Cited Papers
- 1 November 2009
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (47-49) , 4801-4811
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Subset selection for matricesLinear Algebra and its Applications, 2007
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix DecompositionSIAM Journal on Computing, 2006
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a MatrixSIAM Journal on Computing, 2006
- Fast monte-carlo algorithms for finding low-rank approximationsJournal of the ACM, 2004
- On the existence and computation of rank-revealing LU factorizationsLinear Algebra and its Applications, 2000
- 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
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Rosetak Document 4: Rank Degeneracies and Least Square Problems1977
- Linear least squares solutions by householder transformationsNumerische Mathematik, 1965