A note on column subset selection

From MaRDI portal
Publication:2935162

DOI10.1093/IMRN/RNT172zbMATH Open1318.46004arXiv1212.0976OpenAlexW3105179449MaRDI QIDQ2935162FDOQ2935162


Authors: Pierre Youssef Edit this on Wikidata


Publication date: 22 December 2014

Published in: IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1212.0976




Recommendations





Cited In (13)





This page was built for publication: A note on column subset selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935162)