CS 205A class_6 notes

Scientific Computing

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

View Full Document Right Arrow Icon
CS205 – Class 6 Reading: Heath 3.6 (p137-143), 4.7 (p202) Singular Value Decomposition (SVD) 1. The Singular Value Decomposition is an eigenvalue-like decomposition for square n m × matrices. It has the form T AUV =∑ where U is an mm × orthogonal matrix, V is an nn × orthogonal matrix, and is an mn × diagonal matrix with positive diagonal entries that are called the singular values of A. The columns of U and V are the singular vectors . a. Introduced and rediscovered many times: Beltrami in 1873, Jordan in 1875, Sylvester in 1889, Autonne in 1913, Eckart and Young in 1936. b. Pearson introduced principle component analysis (PCA) in 1901. It uses SVD. c. Numerical work by Chan, Businger, Golub, Kahan, etc. 2. The singular value decomposition of 123 456 789 10 11 12 A = is given by .141 .825 .420 .351 25.5 0 0 .504 .574 .644 .344 .426 .298 .782 0 1.29 0 .761 .057 .646 .547 .028 .664 .509 0 0 0 .408 .816 .408 .750 .371 .542 .079 0 0 0 −− ⎡⎤ ⎢⎥ ⎣⎦ .
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/29/2008 for the course CS 205A taught by Professor Fedkiw during the Fall '07 term at Stanford.

Page1 / 2

CS 205A class_6 notes - CS205 Class 6 Reading: Heath 3.6...

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

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