SVDintro2011 - 3/24/2011 MoreLinear Algebra Toward SVD

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
3/24/2011 1 More Linear Algebra Toward SVD Simple but important facts A matrix A of size n by n has exactly n complex eigenvalues. Assume that A is symmetric and real matrix. Then all eigenvalues of A are real numbers. Gram-Schmidt process If v 1 , v 2 ,…, v k are a set of orthogonal vectors in R n (k<n), then we can find n-k vectors v k+1 ,…, v n such that { v 1 ,…, v n } forms an orthogonal basis.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
3/24/2011 2 Real Symmetric Matrix Recall the famous result of linear algebra: Let A be any real symmetric matrix . Then there exists an orthogonal matrix U such that the following holds : (i) A = UDU T , D a diagonal matrix. (ii) The diagonal entries of D are the eigenvalues of A . (iii) The column vectors of U are the eigenvectors of the eigenvalues of A. The proof can be done using the facts mentioned in the previous slide. (Do it?) What if A is not symmetric? Singular Value Ddecomposition
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/16/2012 for the course MAD 4103 taught by Professor Li during the Spring '11 term at University of Central Florida.

Page1 / 5

SVDintro2011 - 3/24/2011 MoreLinear Algebra Toward SVD

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online