Abstract
We consider the question of how to delete m - k rows from a matrix X Rm×n so that the resulting matrix A 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.
| Original language | English |
|---|---|
| Pages (from-to) | 349-359 |
| Journal | Linear Algebra and Its Applications |
| Volume | 422 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - 2007 |
Fingerprint
Dive into the research topics of 'Subset selection for matrices'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver