Generalized singular value decomposition

From HandWiki
Short description: Name of two different techniques based on the singular value decomposition

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

First version: two-matrix decomposition

The generalized singular value decomposition (GSVD) is a matrix decomposition on a pair of matrices which generalizes the singular value decomposition. It was introduced by Van Loan [1] in 1976 and later developed by Paige and Saunders,[2] which is the version described here. In contrast to the SVD, the GSVD decomposes simultaneously a pair of matrices with the same number of columns. The SVD and the GSVD, as well as some other possible generalizations of the SVD,[3][4][5] are extensively used in the study of the conditioning and regularization of linear systems with respect to quadratic semi-norms. In the following, let [math]\displaystyle{ \mathbb{F} = \mathbb{R} }[/math], or [math]\displaystyle{ \mathbb{F} = \mathbb{C} }[/math].

Definition

The generalized singular value decomposition of matrices [math]\displaystyle{ A_1 \in \mathbb{F}^{m_1 \times n} }[/math] and [math]\displaystyle{ A_2 \in \mathbb{F}^{m_2 \times n} }[/math] is[math]\displaystyle{ \begin{align} A_1 & = U_1\Sigma_1 [ W^* D, 0_D] Q^*, \\ A_2 & = U_2\Sigma_2 [ W^* D, 0_D] Q^*, \end{align} }[/math]where

  • [math]\displaystyle{ U_1 \in \mathbb{F}^{m_1 \times m_1} }[/math] is unitary,
  • [math]\displaystyle{ U_2 \in \mathbb{F}^{m_2 \times m_2} }[/math] is unitary,
  • [math]\displaystyle{ Q \in \mathbb{F}^{n \times n} }[/math] is unitary,
  • [math]\displaystyle{ W \in \mathbb{F}^{k \times k} }[/math]is unitary,
  • [math]\displaystyle{ D \in \mathbb{R}^{k \times k} }[/math] is real diagonal with positive diagonal, and contains the non-zero singular values of [math]\displaystyle{ C = \begin{bmatrix} A_1 \\ A_2 \end{bmatrix} }[/math] in decreasing order,
  • [math]\displaystyle{ 0_D = 0 \in \mathbb{R}^{k \times (n - k)} }[/math],
  • [math]\displaystyle{ \Sigma_1 = \lceil I_A, S_1, 0_A \rfloor \in \mathbb{R}^{m_1 \times k} }[/math] is real non-negative block-diagonal, where [math]\displaystyle{ S_1 = \lceil \alpha_{r + 1}, \dots, \alpha_{r + s} \rfloor }[/math] with [math]\displaystyle{ 1 \gt \alpha_{r + 1} \ge \cdots \ge \alpha_{r + s} \gt 0 }[/math], [math]\displaystyle{ I_A = I_r }[/math], and [math]\displaystyle{ 0_A = 0 \in \mathbb{R}^{(m_1 - r - s) \times (k - r - s)} }[/math],
  • [math]\displaystyle{ \Sigma_2 = \lceil 0_B, S_2, I_B \rfloor \in \mathbb{R}^{m_2 \times k} }[/math] is real non-negative block-diagonal, where [math]\displaystyle{ S_2 = \lceil \beta_{r + 1}, \dots, \beta_{r + s} \rfloor }[/math] with [math]\displaystyle{ 0 \lt \beta_{r + 1} \le \cdots \le \beta_{r + s} \lt 1 }[/math], [math]\displaystyle{ I_B = I_{k - r - s} }[/math], and [math]\displaystyle{ 0_B = 0 \in \mathbb{R}^{(m_2 - k + r) \times r} }[/math],
  • [math]\displaystyle{ \Sigma_1^* \Sigma_1 = \lceil\alpha_1^2, \dots, \alpha_k^2\rfloor }[/math],
  • [math]\displaystyle{ \Sigma_2^* \Sigma_2 = \lceil\beta_1^2, \dots, \beta_k^2\rfloor }[/math],
  • [math]\displaystyle{ \Sigma_1^* \Sigma_1 + \Sigma_2^* \Sigma_2 = I_k }[/math],
  • [math]\displaystyle{ k = \textrm{rank}(C) }[/math].

We denote [math]\displaystyle{ \alpha_1 = \cdots = \alpha_r = 1 }[/math], [math]\displaystyle{ \alpha_{r + s + 1} = \cdots = \alpha_k = 0 }[/math], [math]\displaystyle{ \beta_1 = \cdots = \beta_r = 0 }[/math], and [math]\displaystyle{ \beta_{r + s + 1} = \cdots = \beta_k = 1 }[/math]. While [math]\displaystyle{ \Sigma_1 }[/math] is diagonal, [math]\displaystyle{ \Sigma_2 }[/math] is not always diagonal, because of the leading rectangular zero matrix; instead [math]\displaystyle{ \Sigma_2 }[/math] is "bottom-right-diagonal".

Variations

There are many variations of the GSVD. These variations are related to the fact that it is always possible to multiply [math]\displaystyle{ Q^* }[/math] from the left by [math]\displaystyle{ E E^* = I }[/math] where [math]\displaystyle{ E \in \mathbb{F}^{n \times n} }[/math] is an arbitrary unitary matrix. We denote

  • [math]\displaystyle{ X = ([W^* D, 0_D] Q^*)^* }[/math]
  • [math]\displaystyle{ X^* = [0, R] \hat{Q}^* }[/math], where [math]\displaystyle{ R \in \mathbb{F}^{k \times k} }[/math] is upper-triangular and invertible, and [math]\displaystyle{ \hat{Q} \in \mathbb{F}^{n \times n} }[/math] is unitary. Such matrices exist by RQ-decomposition.
  • [math]\displaystyle{ Y = W^* D }[/math]. Then [math]\displaystyle{ Y }[/math] is invertible.

Here are some variations of the GSVD:

  • MATLAB (gsvd):[math]\displaystyle{ \begin{aligned} A_1 & = U_1 \Sigma_1 X^*, \\ A_2 & = U_2 \Sigma_2 X^*. \end{aligned} }[/math]
  • LAPACK (LA_GGSVD):[math]\displaystyle{ \begin{aligned} A_1 & = U_1 \Sigma_1 [0, R] \hat{Q}^*, \\ A_2 & = U_2 \Sigma_2 [0, R] \hat{Q}^*. \end{aligned} }[/math]
  • Simplified:[math]\displaystyle{ \begin{align} A_1 & = U_1\Sigma_1 [ Y, 0_D] Q^*, \\ A_2 & = U_2\Sigma_2 [ Y, 0_D] Q^*. \end{align} }[/math]

Generalized singular values

A generalized singular value of [math]\displaystyle{ A_1 }[/math] and [math]\displaystyle{ A_2 }[/math] is a pair [math]\displaystyle{ (a, b) \in \mathbb{R}^2 }[/math] such that

[math]\displaystyle{ \begin{align} \lim_{\delta \to 0} \det(b^2 A_1^* A_1 - a^2 A_2^* A_2 + \delta I_n) / \det(\delta I_{n - k}) & = 0, \\ a^2 + b^2 & = 1, \\ a, b & \geq 0. \end{align} }[/math]We have

  • [math]\displaystyle{ A_i A_j^* = U_i \Sigma_i Y Y^* \Sigma_j^* U_j^* }[/math]
  • [math]\displaystyle{ A_i^* A_j = Q \begin{bmatrix} Y^* \Sigma_i^* \Sigma_j Y & 0 \\ 0 & 0 \end{bmatrix} Q^* = Q_1 Y^* \Sigma_i^* \Sigma_j Y Q_1^* }[/math]


By these properties we can show that the generalized singular values are exactly the pairs [math]\displaystyle{ (\alpha_i, \beta_i) }[/math]. We have[math]\displaystyle{ \begin{aligned} & \det(b^2 A_1^* A_1 - a^2 A_2^* A_2 + \delta I_n) \\ = & \det(b^2 A_1^* A_1 - a^2 A_2^* A_2 + \delta Q Q^*) \\ = & \det\left(Q \begin{bmatrix} Y^* (b^2 \Sigma_1^* \Sigma_1 - a^2 \Sigma_2^* \Sigma_2) Y + \delta I_k & 0 \\ 0 & \delta I_{n - k} \end{bmatrix} Q^*\right) \\ = & \det(\delta I_{n - k}) \det(Y^* (b^2 \Sigma_1^* \Sigma_1 - a^2 \Sigma_2^* \Sigma_2) Y + \delta I_k). \end{aligned} }[/math]Therefore

[math]\displaystyle{ \begin{aligned} {} & \lim_{\delta \to 0} \det(b^2 A_1^* A_1 - a^2 A_2^* A_2 + \delta I_n) / \det(\delta I_{n - k}) \\ = & \lim_{\delta \to 0} \det(Y^* (b^2 \Sigma_1^* \Sigma_1 - a^2 \Sigma_2^* \Sigma_2) Y + \delta I_k) \\ = & \det(Y^* (b^2 \Sigma_1^* \Sigma_1 - a^2 \Sigma_2^* \Sigma_2) Y) \\ = & |\det(Y)|^2 \prod_{i = 1}^k (b^2 \alpha_i^2 - a^2 \beta_i^2). \end{aligned} }[/math]

This expression is zero exactly when [math]\displaystyle{ a = \alpha_i }[/math] and [math]\displaystyle{ b = \beta_i }[/math] for some [math]\displaystyle{ i }[/math].

In,[2] the generalized singular values are claimed to be those which solve [math]\displaystyle{ \det(b^2 A_1^* A_1 - a^2 A_2^* A_2) = 0 }[/math]. However, this claim only holds when [math]\displaystyle{ k = n }[/math], since otherwise the determinant is zero for every pair [math]\displaystyle{ (a, b) \in \mathbb{R}^2 }[/math]; this can be seen by substituting [math]\displaystyle{ \delta = 0 }[/math] above.

Generalized inverse

Define [math]\displaystyle{ E^+ = E^{-1} }[/math] for any invertible matrix [math]\displaystyle{ E \in \mathbb{F}^{n \times n} }[/math] , [math]\displaystyle{ 0^+ = 0^* }[/math] for any zero matrix [math]\displaystyle{ 0 \in \mathbb{F}^{m \times n} }[/math], and [math]\displaystyle{ \left\lceil E_1, E_2 \right\rfloor^+ = \left\lceil E_1^+, E_2^+ \right\rfloor }[/math] for any block-diagonal matrix. Then define[math]\displaystyle{ A_i^+ = Q \begin{bmatrix} Y^{-1} \\ 0 \end{bmatrix} \Sigma_i^+ U_i^* }[/math]It can be shown that [math]\displaystyle{ A_i^+ }[/math] as defined here is a generalized inverse of [math]\displaystyle{ A_i }[/math]; in particular a [math]\displaystyle{ \{1, 2, 3\} }[/math]-inverse of [math]\displaystyle{ A_i }[/math]. Since it does not in general satisfy [math]\displaystyle{ (A_i^+ A_i)^* = A_i^+ A_i }[/math], this is not the Moore–Penrose inverse; otherwise we could derive [math]\displaystyle{ (AB)^+ = B^+ A^+ }[/math] for any choice of matrices, which only holds for certain class of matrices.

Suppose [math]\displaystyle{ Q = \begin{bmatrix}Q_1 & Q_2\end{bmatrix} }[/math], where [math]\displaystyle{ Q_1 \in \mathbb{F}^{n \times k} }[/math] and [math]\displaystyle{ Q_2 \in \mathbb{F}^{n \times (n - k)} }[/math]. This generalized inverse has the following properties:

  • [math]\displaystyle{ \Sigma_1^+ = \lceil I_A, S_1^{-1}, 0_A^T \rfloor }[/math]
  • [math]\displaystyle{ \Sigma_2^+ = \lceil 0^T_B, S_2^{-1}, I_B \rfloor }[/math]
  • [math]\displaystyle{ \Sigma_1 \Sigma_1^+ = \lceil I, I, 0 \rfloor }[/math]
  • [math]\displaystyle{ \Sigma_2 \Sigma_2^+ = \lceil 0, I, I \rfloor }[/math]
  • [math]\displaystyle{ \Sigma_1 \Sigma_2^+ = \lceil 0, S_1 S_2^{-1}, 0 \rfloor }[/math]
  • [math]\displaystyle{ \Sigma_1^+ \Sigma_2 = \lceil 0, S_1^{-1} S_2, 0 \rfloor }[/math]
  • [math]\displaystyle{ A_i A_j^+ = U_i \Sigma_i \Sigma_j^+ U_j^* }[/math]
  • [math]\displaystyle{ A_i^+ A_j = Q \begin{bmatrix} Y^{-1} \Sigma_i^+ \Sigma_j Y & 0 \\ 0 & 0 \end{bmatrix} Q^* = Q_1 Y^{-1} \Sigma_i^+ \Sigma_j Y Q_1^* }[/math]

Quotient SVD

A generalized singular ratio of [math]\displaystyle{ A_1 }[/math] and [math]\displaystyle{ A_2 }[/math] is [math]\displaystyle{ \sigma_i=\alpha_i \beta_i^+ }[/math]. By the above properties, [math]\displaystyle{ A_1 A_2^+ = U_1 \Sigma_1 \Sigma_2^+ U_2^* }[/math]. Note that [math]\displaystyle{ \Sigma_1 \Sigma_2^+ = \lceil 0, S_1 S_2^{-1}, 0 \rfloor }[/math] is diagonal, and that, ignoring the leading zeros, contains the singular ratios in decreasing order. If [math]\displaystyle{ A_2 }[/math] is invertible, then [math]\displaystyle{ \Sigma_1 \Sigma_2^+ }[/math] has no leading zeros, and the generalized singular ratios are the singular values, and [math]\displaystyle{ U_1 }[/math] and [math]\displaystyle{ U_2 }[/math] are the matrices of singular vectors, of the matrix [math]\displaystyle{ A_1 A_2^+ = A_1 A_2^{-1} }[/math]. In fact, computing the SVD of [math]\displaystyle{ A_1 A_2^{-1} }[/math] is one of the motivations for the GSVD, as "forming [math]\displaystyle{ AB^{-1} }[/math] and finding its SVD can lead to unnecessary and large numerical errors when [math]\displaystyle{ B }[/math] is ill-conditioned for solution of equations".[2] Hence the sometimes used name "quotient SVD", although this is not the only reason for using GSVD. If [math]\displaystyle{ A_2 }[/math] is not invertible, then [math]\displaystyle{ U_1 \Sigma_1 \Sigma_2^+ U_2^* }[/math]is still the SVD of [math]\displaystyle{ A_1 A_2^+ }[/math] if we relax the requirement of having the singular values in decreasing order. Alternatively, a decreasing order SVD can be found by moving the leading zeros to the back: [math]\displaystyle{ U_1 \Sigma_1 \Sigma_2^+ U_2^* = (U_1 P_1) P_1^* \Sigma_1 \Sigma_2^+ P_2 (P_2^* U_2^*) }[/math], where [math]\displaystyle{ P_1 }[/math] and [math]\displaystyle{ P_2 }[/math] are appropriate permutation matrices. Since rank equals the number of non-zero singular values, [math]\displaystyle{ \mathrm{rank}(A_1 A_2^+)=s }[/math].

Construction

Let

  • [math]\displaystyle{ C = P \lceil D, 0 \rfloor Q^* }[/math] be the SVD of [math]\displaystyle{ C = \begin{bmatrix} A_1 \\ A_2 \end{bmatrix} }[/math], where [math]\displaystyle{ P \in \mathbb{F}^{(m_1 + m_2) \times (m_1 \times m_2)} }[/math] is unitary, and [math]\displaystyle{ Q }[/math] and [math]\displaystyle{ D }[/math] are as described,
  • [math]\displaystyle{ P = [P_1, P_2] }[/math], where [math]\displaystyle{ P_1 \in \mathbb{F}^{(m_1 + m_2) \times k} }[/math] and [math]\displaystyle{ P_2 \in \mathbb{F}^{(m_1 + m_2) \times (n - k)} }[/math],
  • [math]\displaystyle{ P_1 = \begin{bmatrix} P_{11} \\ P_{21} \end{bmatrix} }[/math], where [math]\displaystyle{ P_{11} \in \mathbb{F}^{m_1 \times k} }[/math] and [math]\displaystyle{ P_{21} \in \mathbb{F}^{m_2 \times k} }[/math],
  • [math]\displaystyle{ P_{11} = U_1 \Sigma_1 W^* }[/math] by the SVD of [math]\displaystyle{ P_{11} }[/math], where [math]\displaystyle{ U_1 }[/math], [math]\displaystyle{ \Sigma_1 }[/math] and [math]\displaystyle{ W }[/math] are as described,
  • [math]\displaystyle{ P_{21} W = U_2 \Sigma_2 }[/math] by a decomposition similar to a QR-decomposition, where [math]\displaystyle{ U_2 }[/math] and [math]\displaystyle{ \Sigma_2 }[/math] are as described.

Then[math]\displaystyle{ \begin{aligned} C & = P \lceil D, 0 \rfloor Q^* \\ {} & = [P_1 D, 0] Q^* \\ {} & = \begin{bmatrix} U_1 \Sigma_1 W^* D & 0 \\ U_2 \Sigma_2 W^* D & 0 \end{bmatrix} Q^* \\ {} & = \begin{bmatrix} U_1 \Sigma_1 [W^* D, 0] Q^* \\ U_2 \Sigma_2 [W^* D, 0] Q^* \end{bmatrix} . \end{aligned} }[/math]We also have[math]\displaystyle{ \begin{bmatrix} U_1^* & 0 \\ 0 & U_2^* \end{bmatrix} P_1 W = \begin{bmatrix} \Sigma_1 \\ \Sigma_2 \end{bmatrix}. }[/math]Therefore[math]\displaystyle{ \Sigma_1^* \Sigma_1 + \Sigma_2^* \Sigma_2 = \begin{bmatrix} \Sigma_1 \\ \Sigma_2 \end{bmatrix}^* \begin{bmatrix} \Sigma_1 \\ \Sigma_2 \end{bmatrix} = W^* P_1^* \begin{bmatrix} U_1 & 0 \\ 0 & U_2 \end{bmatrix} \begin{bmatrix} U_1^* & 0 \\ 0 & U_2^* \end{bmatrix} P_1 W = I. }[/math]Since [math]\displaystyle{ P_1 }[/math] has orthonormal columns, [math]\displaystyle{ ||P_1||_2 \leq 1 }[/math]. Therefore[math]\displaystyle{ ||\Sigma_1||_2 = ||U_1^* P_1 W||_2 = ||P_1||_2 \leq 1. }[/math]We also have for each [math]\displaystyle{ x \in \mathbb{R}^k }[/math] such that [math]\displaystyle{ ||x||_2 = 1 }[/math] that[math]\displaystyle{ ||P_{21} x||_2^2 \leq ||P_{11} x||_2^2 + ||P_{21} x||_2^2 = ||P_{1} x||_2^2 \leq 1. }[/math]Therefore [math]\displaystyle{ ||P_{21}||_2 \leq 1 }[/math], and[math]\displaystyle{ ||\Sigma_2||_2 = || U_2^* P_{21} W ||_2 = ||P_{21}||_2 \leq 1. }[/math]

Applications

The tensor GSVD is one of the comparative spectral decompositions, multi-tensor generalizations of the SVD, invented to simultaneously identify the similar and dissimilar among, and create a single coherent model from any data types, of any number and dimensions.

The GSVD, formulated as a comparative spectral decomposition,[6] has been successfully applied to signal processing and data science, e.g., in genomic signal processing.[7][8][9]

These applications inspired several additional comparative spectral decompositions, i.e., the higher-order GSVD (HO GSVD)[10] and the tensor GSVD.[11] [12]

It has equally found applications to estimate the spectral decompositions of linear operators when the eigenfunctions are parameterized with a linear model, i.e. a reproducing kernel Hilbert space.[13]

Second version: weighted single-matrix decomposition

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.[14][15][16] 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

[math]\displaystyle{ M = U\Sigma V^* \, }[/math]

where

[math]\displaystyle{ U^* W_u U = V^* W_v V = I. }[/math]

Where I is the identity matrix and where [math]\displaystyle{ U }[/math] and [math]\displaystyle{ V }[/math] are orthonormal given their constraints ([math]\displaystyle{ W_u }[/math] and [math]\displaystyle{ W_v }[/math]). Additionally, [math]\displaystyle{ W_u }[/math] and [math]\displaystyle{ W_v }[/math] 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).[17]

References

  1. ↑ Van Loan, Charles F. (1976). "Generalizing the Singular Value Decomposition". SIAM J. Numer. Anal. 13 (1): 76–83. doi:10.1137/0713009. Bibcode: 1976SJNA...13...76V. 
  2. ↑ 2.0 2.1 2.2 Paige, C. C.; Saunders, M. A. (1981). "Towards a Generalized Singular Value Decomposition". SIAM J. Numer. Anal. 18 (3): 398–405. doi:10.1137/0718026. Bibcode: 1981SJNA...18..398P. 
  3. ↑ Hansen, Per Christian (1997). Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM Monographs on Mathematical Modeling and Computation. ISBN 0-89871-403-6. 
  4. ↑ de Moor, Bart L. R.; Golub, Gene H. (1989). "Generalized Singular Value Decompositions A Proposal for a Standard Nomenclauture". http://ftp.esat.kuleuven.be/pub/SISTA/ida/reports/89-10.pdf. 
  5. ↑ de Moor, Bart L. R.; Zha, Hongyuan (1991). "A tree of generalizations of the ordinary singular value decomposition". Linear Algebra and Its Applications 147: 469–500. doi:10.1016/0024-3795(91)90243-P. 
  6. ↑ "Generalized singular value decomposition for comparative analysis of genome-scale expression data sets of two different organisms". Proceedings of the National Academy of Sciences of the United States of America 100 (6): 3351–6. March 2003. doi:10.1073/pnas.0530258100. PMID 12631705. Bibcode: 2003PNAS..100.3351A. 
  7. ↑ "GSVD comparison of patient-matched normal and tumor aCGH profiles reveals global copy-number alterations predicting glioblastoma multiforme survival". PLOS ONE 7 (1): e30098. January 2012. doi:10.1371/journal.pone.0030098. PMID 22291905. Bibcode: 2012PLoSO...730098L. 
  8. ↑ "Mathematically universal and biologically consistent astrocytoma genotype encodes for transformation and predicts survival phenotype". APL Bioengineering 2 (3): 031909. September 2018. doi:10.1063/1.5037882. PMID 30397684. 
  9. ↑ "Retrospective Clinical Trial Experimentally Validates Glioblastoma Genome-Wide Pattern of DNA Copy-Number Alterations Predictor of Survival". APL Bioengineering 4 (2): 026106. May 2020. doi:10.1063/1.5142559. Press Release. PMID 32478280. 
  10. ↑ "A higher-order generalized singular value decomposition for comparison of global mRNA expression from multiple organisms". PLOS ONE 6 (12): e28072. December 2011. doi:10.1371/journal.pone.0028072. PMID 22216090. Bibcode: 2011PLoSO...628072P. 
  11. ↑ "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. April 2015. doi:10.1371/journal.pone.0121396. PMID 25875127. Bibcode: 2015PLoSO..1021396S. 
  12. ↑ "GSVD- and tensor GSVD-uncovered patterns of DNA copy-number alterations predict adenocarcinomas survival in general and in response to platinum". APL Bioengineering 3 (3): 036104. September 2019. doi:10.1063/1.5099268. Supplementary Material. PMID 31463421. 
  13. ↑ Cabannes, Vivien; Pillaud-Vivien, Loucas; Bach, Francis; Rudi, Alessandro (2021). "Overcoming the curse of dimensionality with Laplacian regularization in semi-supervised learning". arXiv:2009.04324 [stat.ML].
  14. ↑ Principal Component Analysis. Springer Series in Statistics (2nd ed.). NY: Springer. 2002. ISBN 978-0-387-95442-4. https://archive.org/details/principalcompone00joll_0. 
  15. ↑ Greenacre, Michael (1983). Theory and Applications of Correspondence Analysis. London: Academic Press. ISBN 978-0-12-299050-2. 
  16. ↑ "Principal component analysis.". Wiley Interdisciplinary Reviews: Computational Statistics 2 (4): 433–459. 2010. doi:10.1002/wics.101. 
  17. ↑ "Singular Value Decomposition (SVD) and Generalized Singular Value Decomposition (GSVD).". Encyclopedia of Measurement and Statistics.. Thousand Oaks (CA): Sage. 2007. pp. 907–912. https://archive.org/details/encyclopediameas00salk. 

Further reading

  • Golub, Gene; Van Loan, Charles (1996). Matrix Computation (Third ed.). Baltimore: Johns Hopkins University Press. ISBN 0-8018-5414-8. 
  • LAPACK manual [1]



Retrieved from "https://handwiki.org/wiki/index.php?title=Generalized_singular_value_decomposition&oldid=3379339"