4.6 Article Proceedings Paper

Applications of singular-value decomposition (SVD)

Journal

MATHEMATICS AND COMPUTERS IN SIMULATION
Volume 67, Issue 1-2, Pages 15-31

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.matcom.2004.05.005

Keywords

applications; singular-value decompositions; hanger; stretcher; aligner

Ask authors/readers for more resources

Let A be an m x n matrix with m greater than or equal to n. Then one form of the singular-value decomposition of A is A = U-T SigmaV, where U and V are orthogonal and Sigma is square diagonal. That is, UUT = I-rank(A), VVT = I-rank(A), U is rank(A) x m, V is rank(A) x n and [GRAPHICS] is a rank (A) x rank(A) diagonal matrix. In addition sigma(1) greater than or equal to sigma(2) greater than or equal to... greater than or equal to sigma(rank)(A) > 0. The sigma(i)'s are called the singular values of A and their number is equal to the rank of A. The ratio sigma(1) /sigma(rank)(A) can be regarded as a condition number of the matrix A. It is easily verified that the singular-value decomposition can be also written as [GRAPHICS] The matrix u(i)(T) v(i) is the outerproduct of the i-th row of U with the corresponding row of V. Note that each of these matrices can be stored using only m + n locations rather than mn locations.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available