Subset selection for matrices Original Research Article

We consider the question of how to delete m − k rows from a matrix X set membership, variant Rm×n so that the resulting matrix A set membership, variant Rk×n is as non-singular as possible. Bounds for the singular values of A are derived which decrease only algebraically with m and n. In addition a number of applications, where subset selection is necessary, are examined.