Subset selection for matrices

F.R. Hoog, de, R.M.M. Mattheij

Research output: Contribution to journalArticleAcademicpeer-review

25 Citations (Scopus)
1 Downloads (Pure)

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 languageEnglish
Pages (from-to)349-359
JournalLinear Algebra and Its Applications
Volume422
Issue number2-3
DOIs
Publication statusPublished - 2007

Fingerprint Dive into the research topics of 'Subset selection for matrices'. Together they form a unique fingerprint.

Cite this