<--- Back to Details
First PageDocument Content
Numerical linear algebra / Matrix theory / Functional analysis / Matrices / Orthogonal matrix / Matrix / Singular value decomposition / Randomized algorithm / QR decomposition / Algebra / Linear algebra / Mathematics
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

Similar Documents

Euclidean lattices and QR decomposition Householder and LLL Householder inside LLL Conclusion  H-LLL: Using Householder Inside LLL

Euclidean lattices and QR decomposition Householder and LLL Householder inside LLL Conclusion H-LLL: Using Householder Inside LLL

DocID: 1szVc - View Document

An Approach to Automatic Tuning for Parallel Householder QR Decomposition Takeshi Fukaya1) , Yusaku Yamamoto2) , Shao-Liang Zhang3) 1),2),3) Graduate School of Engineering, Nagoya University 1) ya-u.a

An Approach to Automatic Tuning for Parallel Householder QR Decomposition Takeshi Fukaya1) , Yusaku Yamamoto2) , Shao-Liang Zhang3) 1),2),3) Graduate School of Engineering, Nagoya University 1) ya-u.a

DocID: 1svxQ - View Document

Leverage scores Petros Drineas Rensselaer Polytechnic Institute Computer Science Department  To access my web page:

Leverage scores Petros Drineas Rensselaer Polytechnic Institute Computer Science Department To access my web page:

DocID: 1rk1k - 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

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

Math 515 Fall, 2014 Homework 4, due Thursday, OctoberSuppose A ∈ Rm×n , m ≥ n, and rank(A) = n; that is, A has full rank. Consider the linear system: 

Math 515 Fall, 2014 Homework 4, due Thursday, OctoberSuppose A ∈ Rm×n , m ≥ n, and rank(A) = n; that is, A has full rank. Consider the linear system: 

DocID: 1qrak - View Document