Journal of Machine Learning Research3472 Submitted 7 12; PublishedFast Approximation of Matrix Coherence and Statistical Leverage Petros Drineas - Petros - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2013-01-07 18:40:32 Numerical linear algebra Matrix theory Functional analysis Matrices Orthogonal matrix Matrix Singular value decomposition Randomized algorithm QR decomposition Algebra Linear algebra Mathematics		Journal of Machine Learning Research3472 Submitted 7/12; PublishedFast Approximation of Matrix Coherence and Statistical Leverage Petros Drineas Add to Reading List Source URL: www.cs.yale.edu Download Document from Source Website File Size: 278,55 KB Share Document on Facebook

	Matrix Valued Orthogonal Polynomials for Gelfand Pairs of Rank One Gert Heckman and Maarten van Pruijssen Radboud University Nijmegen October 18, 2013 Abstract DocID: 1tQah - View Document
	THE BETA-JACOBI MATRIX MODEL, THE CS DECOMPOSITION, AND GENERALIZED SINGULAR VALUE PROBLEMS ALAN EDELMAN AND BRIAN D. SUTTON Abstract. We provide a solution to the β-Jacobi matrix model problem DocID: 1r1Io - View Document
	Computing the Complete CS Decomposition Brian D. Sutton∗ May 20, 2008 Abstract An algorithm for computing the complete CS decomposition of a partitioned unitary matrix is developed. Although the existence of the CS dec DocID: 1qWf4 - View Document
	CS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant∗ April 20, DocID: 1qRJK - View Document
	SIAM J. Matrix Anal. Appl. (SIMAX), 18(1):83–103, 1997 BOUNDS FOR THE COMPONENTWISE DISTANCE TO THE NEAREST SINGULAR MATRIX S. M. RUMP DocID: 1qHdb - View Document