Analysis/Probability Learning Seminar Date:  Thursday, March 28, 2013 Location:  4096 East Hall (4:10 PM to 6:00 PM) Title:  On some column selection problems and applications Abstract:   Given U an n×m matrix, the aim is to extract a large number of linearly independent columns of U and estimate the smallest and the largest singular value of the restricted matrix. For that, we give two deterministic algorithms: one for the restricted invertibility principle dealing with the smallest singular value, and one for the norm of coordinate restriction problem dealing with the largest singular value. Merging the two algorithms, we are able to extract a well-conditioned block inside U, improving a previous result due to Vershynin. We give some applications of this result, among them a deterministic algorithm to get the best known result on the Kadison-Singer conjecture. Speaker:  Pierre Youssef Institution:  Paris-Est Marne-la Vallee University Event Organizer:        Edit this event (login required). Add new event (login required). For access requests and instructions, contact math-webmaster@umich.edu Back to previous page Back to UM Math seminars/events page.