A note on column subset selection - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

A note on column subset selection


Given a matrix U, using a deterministic method, we extract a "large" submatrix of U'(whose columns are obtained by normalizing those of U) and estimate its smallest and largest singular value. We apply this result to the study of contact points of the unit ball with its maximal volume ellipsoid. We consider also the paving problem and give a deterministic algorithm to partition a matrix into almost isometric blocks recovering previous results of Bourgain-Tzafriri and Tropp. Finally, we partially answer a question raised by Naor about finding an algorithm in the spirit of Batson-Spielman-Srivastava's work to extract a "large" square submatrix of "small" norm.
Fichier principal
Vignette du fichier
A_note_on_column_subset_selection.pdf (243.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00811804 , version 1 (11-04-2013)


  • HAL Id : hal-00811804 , version 1


Pierre Youssef. A note on column subset selection. 2012. ⟨hal-00811804⟩
104 View
253 Download


Gmail Facebook Twitter LinkedIn More