Singular Value Decomposition

  • Kenneth Lange
Part of the Statistics and Computing book series (SCO)


In many modern applications involving large data sets, statisticians are confronted with a large m×n matrix X = (x ij) that encodes n features on each of mobjects. For instance, in gene microarray studies x ij represents the expression level of the ith gene under the jth experimental condition [13]. In information retrieval, x ij represents the frequency of the jth word or term in the ith document [2]. The singular value decomposition (svd) captures the structure of such matrices. In many applications there are alternatives to the svd, but these are seldom as informative or as numerically accurate.


Diagonal Entry Singular Vector Ridge Regression Polar Decomposition Full Column Rank 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson E, Bai Z, Bischof C, Blackford LS, Demmel J, Dongarra JJ, Du Croz J, Hammarling S, Greenbaum A, McKenney A, Sorensen D (1999) LAPACK Users’ Guide, 3rd ed. SIAM, PhiladelphiaGoogle Scholar
  2. 2.
    Berry MW, Drmac Z, Jessup ER (1999) Matrices, vector spaces, and information retrieval. SIAM Review 41:335-362MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Courrieu P (2005) Fast computation of Moore-Penrose inverse matrices. Neural Information Processing - Letters and Reviews 8:25-29Google Scholar
  4. 4.
    Demmel J (1997) Applied Numerical Linear Algebra. SIAM, PhiladelphiaMATHGoogle Scholar
  5. 5.
    Eldén L (2007) Matrix Methods in Data Mining and Pattern Recognition. SIAM, PhiladelphiaMATHGoogle Scholar
  6. 6.
    Gill PE, Murray W, Wright MH (1991) Numerical Linear Algebra and Optimization, Volume 1. Addison-Wesley, Redwood City, CAGoogle Scholar
  7. 7.
    Golub GH, Van Loan CF (1996) Matrix Computations, 3rd ed. Johns Hopkins University Press, BaltimoreMATHGoogle Scholar
  8. 8.
    Hausner A (1967) Uniqueness of the polar decomposition. Amer Math Monthly 74:303-304MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Horn RA, Johnson CR (1985) Matrix Analysis. Cambridge University Press, CambridgeMATHGoogle Scholar
  10. 10.
    Horn RA, Johnson CR (1991) Topics in Matrix Analysis. Cambridge University Press, CambridgeMATHGoogle Scholar
  11. 11.
    Jolliffe IT (1982). A note on the use of principal components in regression. J Roy Stat Soc C 31:300-303Google Scholar
  12. 12.
    Karro J, Li C-K (1997) A unified elementary approach to canonical forms of matrices. SIAM Review 39:305-309MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    McLachlan GJ, Do K-A, Ambroise C (2004) Analyzing Microarray Gene Expression Data. Wiley, Hoboken NJMATHCrossRefGoogle Scholar
  14. 14.
    Nievergelt Y (1994) Total least squares: state-of-the-art regression in numerical analysis. SIAM Review 36:258-264MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Press WH, Teukolsky SA, Vetterling WT, Flannery BP (1992) Numerical Recipes in Fortran: The Art of Scientific Computing, 2nd ed. Cambridge University Press, CambridgeGoogle Scholar
  16. 16.
    Seber GAF, Lee AJ (2003) Linear Regression Analysis, 2nd ed. Wiley, Hoboken, NJMATHGoogle Scholar
  17. 17.
    Strang G (2003) Introduction to Linear Algebra, 3rd ed. Wellesley-Cambridge Press, Wellesley, MAGoogle Scholar
  18. 18.
    Trefethen LN, Bau D (1997) Numerical Linear Algebra. SIAM, PhiladelphiaMATHGoogle Scholar

Copyright information

© Springer New York 2010

Authors and Affiliations

  1. 1.Departments of Biomathematics, Human Genetics, and Statistics David Geffen School of MedicineUniversity of California, Los AngelesLos AngelesUSA

Personalised recommendations