Generalized singular value decomposition

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In linear algebra, the generalized singular value decomposition (GSVD) is the name of two different techniques based on the singular value decomposition. The two versions differ because one version decomposes two (or more) matrices (much like higher order PCA) and the other version uses a set of constraints imposed on the left and right singular vectors.

Higher order version[edit]

The generalized singular value decomposition (GSVD) is a matrix decomposition more general than the singular value decomposition. It is used to study the conditioning and regularization of linear systems with respect to quadratic semi-norms.

Let \mathbb{F} = \mathbb{R}, or \mathbb{F} = \mathbb{C}. Given matrices A \in \mathbb{F}^{m \times n} and B \in \mathbb{F}^{p \times n}, their GSVD is given by

A=U\Sigma_1 [ X, 0] Q^*

and

B=V\Sigma_2 [ X, 0] Q^*

where U \in \mathbb{F}^{m \times m},V \in \mathbb{F}^{p \times p}, and Q \in \mathbb{F}^{n \times n} are unitary matrices, and X \in \mathbb{F}^{r \times r} is non-singular, where r = rank([A^*,B^*]). Also, \Sigma_1 \in \mathbb{F}^{m \times r} is non-negative diagonal, and \Sigma_2 \in \mathbb{F}^{p \times r} is non-negative block-diagonal, with diagonal blocks; \Sigma_2 is not always diagonal. It holds that \Sigma_1^T \Sigma_1 = \lceil\alpha_1^2, \dots, \alpha_r^2\rfloor and \Sigma_2^T \Sigma_2 = \lceil\beta_1^2, \dots, \beta_r^2\rfloor, and that \Sigma_1^T \Sigma_1 + \Sigma_2^T \Sigma_2 = I_r. This implies  0 \le \alpha_i,\beta_i\le 1. The ratios \sigma_i=\alpha_i/\beta_i are called the generalized singular values of A and B. If B is square and invertible, then the generalized singular values are the singular values, and U and V are the matrices of singular vectors, of the matrix  AB^{-1}. Further, if B = I, then the GSVD reduces to the singular value decomposition, explaining the name.

Weighted version[edit]

The weighted version of the generalized singular value decomposition (GSVD) is a constrained matrix decomposition with constraints imposed on the left and right singular vectors of the singular value decomposition.[1][2][3] This form of the GSVD is an extension of the SVD as such. Given the SVD of an m×n real or complex matrix M

M = U\Sigma V^* \,

where

U^* W_u U = V^* W_v V = I.

Where I is the Identity Matrix and where U and V are orthonormal given their constraints (W_u and W_v). Additionally, W_u and W_v are positive definite matrices (often diagonal matrices of weights). This form of the GSVD is the core of certain techniques, such as generalized principal component analysis and Correspondence analysis.

The weighted form of the GSVD is called as such because, with the correct selection of weights, it generalizes many techniques (such as multidimensional scaling and linear discriminant analysis)[4]

Applications[edit]

The GSVD has been successfully applied to signal processing and big data, e.g., in genomic signal processing.[5][6] These applications also inspired a higher-order GSVD (HO GSVD)[7] and a tensor GSVD.[8]

See also[edit]

  • C. C. Paige, and M. A. Saunders: Towards a Generalized Singular Value Decomposition, SIAM J. Numer. Anal., Volume 18, Number 3, June 1981.
  • Gene Golub, and Charles Van Loan, Matrix Computations, Third Edition, Johns Hopkins University Press, Baltimore, 1996, ISBN 0-8018-5414-8
  • Hansen, Per Christian, Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion, SIAM Monographs on Mathematical Modeling and Computation 4. ISBN 0-89871-403-6
  • LAPACK manual [1]

References[edit]

  1. ^ Jolliffe I.T. Principal Component Analysis, Series: Springer Series in Statistics, 2nd ed., Springer, NY, 2002, XXIX, 487 p. 28 illus. ISBN 978-0-387-95442-4
  2. ^ Greenacre, Michael (1983). Theory and Applications of Correspondence Analysis. London: Academic Press. ISBN 0-12-299050-1. 
  3. ^ Abdi. H., & Williams, L.J. (2010). "Principal component analysis.". Wiley Interdisciplinary Reviews: Computational Statistics, 2: 433–459. doi:10.1002/wics.101. 
  4. ^ Abdi, H. (2007). Singular Value Decomposition (SVD) and Generalized Singular Value Decomposition (GSVD). In N.J. Salkind (Ed.): Encyclopedia of Measurement and Statistics. Thousand Oaks (CA): Sage. pp. 907-912.
  5. ^ O. Alter, P. O. Brown and D. Botstein (March 2003). "Generalized Singular Value Decomposition for Comparative Analysis of Genome-Scale Expression Datasets of Two Different Organisms". PNAS 100 (6): 3351–3356. doi:10.1073/pnas.0530258100. 
  6. ^ C. H. Lee,* B. O. Alpert,* P. Sankaranarayanan and O. Alter (January 2012). "GSVD Comparison of Patient-Matched Normal and Tumor aCGH Profiles Reveals Global Copy-Number Alterations Predicting Glioblastoma Multiforme Survival". PLoS One 7 (1): e30098. doi:10.1371/journal.pone.0030098. Highlight. 
  7. ^ S. P. Ponnapalli, M. A. Saunders, C. F. Van Loan and O. Alter (December 2011). "A Higher-Order Generalized Singular Value Decomposition for Comparison of Global mRNA Expression from Multiple Organisms". PLoS One 6 (12): e28072. doi:10.1371/journal.pone.0028072. Highlight. 
  8. ^ P. Sankaranarayanan, T. E. Schomay, K. A. Aiello and O. Alter (April 2015). "Tensor GSVD of Patient- and Platform-Matched Tumor and Normal DNA Copy-Number Profiles Uncovers Chromosome Arm-Wide Patterns of Tumor-Exclusive Platform-Consistent Alterations Encoding for Cell Transformation and Predicting Ovarian Cancer Survival". PLoS One 10 (4): e0121396. doi:10.1371/journal.pone.0121396. AAAS EurekAlert! Press Release and NAE Podcast Feature.