Matrix decomposition

Template:Distinguish Template:Short description In the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems.

Example

In numerical analysis, different decompositions are used to implement efficient matrix algorithms.

For example, when solving a system of linear equations <math>A \mathbf{x} = \mathbf{b}</math>, the matrix A can be decomposed via the LU decomposition. The LU decomposition factorizes a matrix into a lower triangular matrix L and an upper triangular matrix U. The systems <math>L(U \mathbf{x}) = \mathbf{b}</math> and <math>U \mathbf{x} = L^{-1} \mathbf{b}</math> require fewer additions and multiplications to solve, compared with the original system <math>A \mathbf{x} = \mathbf{b}</math>, though one might require significantly more digits in inexact arithmetic such as floating point.

Similarly, the QR decomposition expresses A as QR with Q an orthogonal matrix and R an upper triangular matrix. The system Q(Rx) = b is solved by Rx = Q^Tb = c, and the system Rx = c is solved by 'back substitution'. The number of additions and multiplications required is about twice that of using the LU solver, but no more digits are required in inexact arithmetic because the QR decomposition is numerically stable.

Decompositions related to solving systems of linear equations

LU decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Traditionally applicable to: square matrix A, although rectangular matrices can be applicable.<ref>Template:Cite book</ref><ref group="nb">If a non-square matrix is used, however, then the matrix U will also have the same rectangular shape as the original matrix A. And so, calling the matrix U upper triangular would be incorrect as the correct term would be that U is the 'row echelon form' of A. Other than this, there are no differences in LU factorization for square and non-square matrices.</ref>
• Decomposition: <math>A=LU</math>, where L is lower triangular and U is upper triangular.
• Related: the LDU decomposition is <math>A=LDU</math>, where L is lower triangular with ones on the diagonal, U is upper triangular with ones on the diagonal, and D is a diagonal matrix.
• Related: the LUP decomposition is <math>PA=LU</math>, where L is lower triangular, U is upper triangular, and P is a permutation matrix.
• Existence: An LUP decomposition exists for any square matrix A. When P is an identity matrix, the LUP decomposition reduces to the LU decomposition.
• Comments: The LUP and LU decompositions are useful in solving an n-by-n system of linear equations <math>A \mathbf{x} = \mathbf{b}</math>. These decompositions summarize the process of Gaussian elimination in matrix form. Matrix P represents any row interchanges carried out in the process of Gaussian elimination. If Gaussian elimination produces the row echelon form without requiring any row interchanges, then P = I, so an LU decomposition exists.

LU reduction

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Block LU decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Rank factorization

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Applicable to: m-by-n matrix A of rank r
• Decomposition: <math>A=CF</math> where C is an m-by-r full column rank matrix and F is an r-by-n full row rank matrix
• Comment: The rank factorization can be used to compute the Moore–Penrose pseudoinverse of A,<ref>Template:Cite journal</ref> which one can apply to obtain all solutions of the linear system <math>A \mathbf{x} = \mathbf{b}</math>.

Cholesky decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Applicable to: square, hermitian, positive definite matrix <math>A</math>
• Decomposition: <math>A=U^*U</math>, where <math>U</math> is upper triangular with real positive diagonal entries
• Comment: if the matrix <math>A</math> is Hermitian and positive semi-definite, then it has a decomposition of the form <math>A=U^*U</math> if the diagonal entries of <math>U</math> are allowed to be zero
• Uniqueness: for positive definite matrices Cholesky decomposition is unique. However, it is not unique in the positive semi-definite case.
• Comment: if <math>A</math> is real and symmetric, <math>U</math> has all real elements
• Comment: An alternative is the LDL decomposition, which can avoid extracting square roots.

QR decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Applicable to: m-by-n matrix A with linearly independent columns
• Decomposition: <math>A=QR</math> where <math>Q</math> is a unitary matrix of size m-by-m, and <math>R</math> is an upper triangular matrix of size m-by-n
• Uniqueness: In general it is not unique, but if <math>A</math> is of full rank, then there exists a single <math>R</math> that has all positive diagonal elements. If <math>A</math> is square, also <math>Q</math> is unique.
• Comment: The QR decomposition provides an effective way to solve the system of equations <math>A \mathbf{x} = \mathbf{b}</math>. The fact that <math>Q</math> is orthogonal means that <math>Q^{\mathrm{T}}Q=I</math>, so that <math>A \mathbf{x} = \mathbf{b}</math> is equivalent to <math>R \mathbf{x} = Q^{\mathsf{T}} \mathbf{b}</math>, which is very easy to solve since <math>R</math> is triangular.

RRQR factorization

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Interpolative decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Decompositions based on eigenvalues and related concepts

Eigendecomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Also called spectral decomposition.
• Applicable to: square matrix A with linearly independent eigenvectors (not necessarily distinct eigenvalues).
• Decomposition: <math>A=VDV^{-1}</math>, where D is a diagonal matrix formed from the eigenvalues of A, and the columns of V are the corresponding eigenvectors of A.
• Existence: An n-by-n matrix A always has n (complex) eigenvalues, which can be ordered (in more than one way) to form an n-by-n diagonal matrix D and a corresponding matrix of nonzero columns V that satisfies the eigenvalue equation <math>AV=VD</math>. <math>V</math> is invertible if and only if the n eigenvectors are linearly independent (that is, each eigenvalue has geometric multiplicity equal to its algebraic multiplicity). A sufficient (but not necessary) condition for this to happen is that all the eigenvalues are different (in this case geometric and algebraic multiplicity are equal to 1)
• Comment: One can always normalize the eigenvectors to have length one (see the definition of the eigenvalue equation)
• Comment: Every normal matrix A (that is, matrix for which <math>AA^*=A^*A</math>, where <math>A^*</math> is a conjugate transpose) can be eigendecomposed. For a normal matrix A (and only for a normal matrix), the eigenvectors can also be made orthonormal (<math>VV^*=I</math>) and the eigendecomposition reads as <math>A=VDV^*</math>. In particular all unitary, Hermitian, or skew-Hermitian (in the real-valued case, all orthogonal, symmetric, or skew-symmetric, respectively) matrices are normal and therefore possess this property.
• Comment: For any real symmetric matrix A, the eigendecomposition always exists and can be written as <math>A=VDV^\mathsf{T}</math>, where both D and V are real-valued.
• Comment: The eigendecomposition is useful for understanding the solution of a system of linear ordinary differential equations or linear difference equations. For example, the difference equation <math>x_{t+1}=Ax_t</math> starting from the initial condition <math>x_0=c</math> is solved by <math>x_t = A^tc</math>, which is equivalent to <math>x_t = VD^tV^{-1}c</math>, where V and D are the matrices formed from the eigenvectors and eigenvalues of A. Since D is diagonal, raising it to power <math>D^t</math>, just involves raising each element on the diagonal to the power t. This is much easier to do and understand than raising A to power t, since A is usually not diagonal.

Jordan decomposition

The Jordan normal form and the Jordan–Chevalley decomposition

• Applicable to: square matrix A
• Comment: the Jordan normal form generalizes the eigendecomposition to cases where there are repeated eigenvalues and cannot be diagonalized, the Jordan–Chevalley decomposition does this without choosing a basis.

Schur decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Applicable to: square matrix A
• Decomposition (complex version): <math>A=UTU^*</math>, where U is a unitary matrix, <math>U^*</math> is the conjugate transpose of U, and T is an upper triangular matrix called the complex Schur form which has the eigenvalues of A along its diagonal.
• Comment: if A is a normal matrix, then T is diagonal and the Schur decomposition coincides with the spectral decomposition.

Real Schur decomposition

• Applicable to: square matrix A
• Decomposition: This is a version of Schur decomposition where <math>V</math> and <math>S</math> only contain real numbers. One can always write <math>A=VSV^\mathsf{T}</math> where V is a real orthogonal matrix, <math>V^\mathsf{T}</math> is the transpose of V, and S is a block upper triangular matrix called the real Schur form. The blocks on the diagonal of S are of size 1×1 (in which case they represent real eigenvalues) or 2×2 (in which case they are derived from complex conjugate eigenvalue pairs).

QZ decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Also called: generalized Schur decomposition
• Applicable to: square matrices A and B
• Comment: there are two versions of this decomposition: complex and real.
• Decomposition (complex version): <math>A=QSZ^*</math> and <math>B=QTZ^*</math> where Q and Z are unitary matrices, the * superscript represents conjugate transpose, and S and T are upper triangular matrices.
• Comment: in the complex QZ decomposition, the ratios of the diagonal elements of S to the corresponding diagonal elements of T, <math>\lambda_i = S_{ii}/T_{ii}</math>, are the generalized eigenvalues that solve the generalized eigenvalue problem <math>A \mathbf{v} = \lambda B \mathbf{v}</math> (where <math>\lambda</math> is an unknown scalar and v is an unknown nonzero vector).
• Decomposition (real version): <math>A=QSZ^\mathsf{T}</math> and <math>B=QTZ^\mathsf{T}</math> where A, B, Q, Z, S, and T are matrices containing real numbers only. In this case Q and Z are orthogonal matrices, the T superscript represents transposition, and S and T are block upper triangular matrices. The blocks on the diagonal of S and T are of size 1×1 or 2×2.

Takagi's factorization

• Applicable to: square, complex, symmetric matrix A.
• Decomposition: <math>A=VDV^\mathsf{T}</math>, where D is a real nonnegative diagonal matrix, and V is unitary. <math>V^\mathsf{T}</math> denotes the matrix transpose of V.
• Comment: The diagonal elements of D are the nonnegative square roots of the eigenvalues of <math>AA^*=VD^2V^{-1}</math>.
• Comment: V may be complex even if A is real.
• Comment: This is not a special case of the eigendecomposition (see above), which uses <math>V^{-1}</math> instead of <math>V^\mathsf{T}</math>. Moreover, if A is not real, it is not Hermitian and the form using <math>V^*</math> also does not apply.

Singular value decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Applicable to: m-by-n matrix A.
• Decomposition: <math>A=UDV^*</math>, where D is a nonnegative diagonal matrix, and U and V satisfy <math>U^*U = I, V^*V = I</math>. Here <math>V^*</math> is the conjugate transpose of V (or simply the transpose, if V contains real numbers only), and I denotes the identity matrix (of some dimension).
• Comment: The diagonal elements of D are called the singular values of A.
• Comment: Like the eigendecomposition above, the singular value decomposition involves finding basis directions along which matrix multiplication is equivalent to scalar multiplication, but it has greater generality since the matrix under consideration need not be square.
• Uniqueness: the singular values of <math>A</math> are always uniquely determined. <math>U</math> and <math>V</math> need not to be unique in general.

Scale-invariant decompositions

Refers to variants of existing matrix decompositions, such as the SVD, that are invariant with respect to diagonal scaling.

• Applicable to: m-by-n matrix A.
• Unit-Scale-Invariant Singular-Value Decomposition: <math>A=DUSV^*E</math>, where S is a unique nonnegative diagonal matrix of scale-invariant singular values, U and V are unitary matrices, <math>V^*</math> is the conjugate transpose of V, and positive diagonal matrices D and E.
• Comment: Is analogous to the SVD except that the diagonal elements of S are invariant with respect to left and/or right multiplication of A by arbitrary nonsingular diagonal matrices, as opposed to the standard SVD for which the singular values are invariant with respect to left and/or right multiplication of A by arbitrary unitary matrices.
• Comment: Is an alternative to the standard SVD when invariance is required with respect to diagonal rather than unitary transformations of A.
• Uniqueness: The scale-invariant singular values of <math>A</math> (given by the diagonal elements of S) are always uniquely determined. Diagonal matrices D and E, and unitary U and V, are not necessarily unique in general.
• Comment: U and V matrices are not the same as those from the SVD.

Analogous scale-invariant decompositions can be derived from other matrix decompositions; for example, to obtain scale-invariant eigenvalues.<ref>Template:Citation</ref><ref>Template:Citation</ref>

Hessenberg decomposition

• Applicable to: square matrix A.
• Decomposition: <math>A=PHP^*</math> where <math>H</math> is the Hessenberg matrix and <math>P</math> is a unitary matrix.
• Comment: often the first step in the Schur decomposition.

Complete orthogonal decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Also known as: UTV decomposition, ULV decomposition, URV decomposition.
• Applicable to: m-by-n matrix A.
• Decomposition: <math>A=UTV^*</math>, where T is a triangular matrix, and U and V are unitary matrices.
• Comment: Similar to the singular value decomposition and to the Schur decomposition.

Other decompositions

Polar decomposition

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Applicable to: any square complex matrix A.
• Decomposition: <math>A=UP</math> (right polar decomposition) or <math>A=P'U</math> (left polar decomposition), where U is a unitary matrix and P and P' are positive semidefinite Hermitian matrices.
• Uniqueness: <math>P</math> is always unique and equal to <math>\sqrt{A^*A}</math> (which is always hermitian and positive semidefinite). If <math>A</math> is invertible, then <math>U</math> is unique.
• Comment: Since any Hermitian matrix admits a spectral decomposition with a unitary matrix, <math>P</math> can be written as <math>P=VDV^*</math>. Since <math>P</math> is positive semidefinite, all elements in <math>D</math> are non-negative. Since the product of two unitary matrices is unitary, taking <math>W=UV</math>one can write <math>A=U(VDV^*)=WDV^* </math> which is the singular value decomposition. Hence, the existence of the polar decomposition is equivalent to the existence of the singular value decomposition.

Algebraic polar decomposition

• Applicable to: square, complex, non-singular matrix A.<ref>Template:Harvnb</ref>
• Decomposition: <math>A=QS</math>, where Q is a complex orthogonal matrix and S is complex symmetric matrix.
• Uniqueness: If <math>A^\mathsf{T}A</math> has no negative real eigenvalues, then the decomposition is unique.<ref name=":0">Template:Cite journal</ref>
• Comment: The existence of this decomposition is equivalent to <math>AA^\mathsf{T}</math> being similar to <math>A^\mathsf{T}A</math>.<ref>Template:Harvnb</ref>
• Comment: A variant of this decomposition is <math>A=RC</math>, where R is a real matrix and C is a circular matrix.<ref name=":0" />

Mostow's decomposition

• Applicable to: square, complex, non-singular matrix A.<ref>Template:Citation</ref><ref>Template:Cite book</ref>
• Decomposition: <math>A=Ue^{iM}e^{S}</math>, where U is unitary, M is real anti-symmetric and S is real symmetric.
• Comment: The matrix A can also be decomposed as <math>A=U_2e^{S_2}e^{iM_2}</math>, where U₂ is unitary, M₂ is real anti-symmetric and S₂ is real symmetric.<ref name=":0" />

Sinkhorn normal form

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Applicable to: square real matrix A with strictly positive elements.
• Decomposition: <math>A=D_{1}SD_{2}</math>, where S is doubly stochastic and D₁ and D₂ are real diagonal matrices with strictly positive elements.

Sectoral decomposition

• Applicable to: square, complex matrix A with numerical range contained in the sector <math>S_\alpha = \left\{r e^{i \theta} \in \mathbb{C} \mid r> 0, |\theta| \le \alpha < \frac{\pi}{2}\right\}</math>.
• Decomposition: <math>A = CZC^*</math>, where C is an invertible complex matrix and <math>Z = \operatorname{diag}\left(e^{i\theta_1},\ldots,e^{i\theta_n}\right)</math> with all <math>\left|\theta_j\right| \le \alpha </math>.<ref name=Zhang2014>Template:Cite journal</ref><ref>Template:Cite journal</ref>

Williamson's normal form

• Applicable to: square, positive-definite real matrix A with order 2n×2n.
• Decomposition: <math>A=S^\mathsf{T}\operatorname{diag}(D,D)S</math>, where <math>S \in \text{Sp}(2n)</math> is a symplectic matrix and D is a nonnegative n-by-n diagonal matrix.<ref>Template:Cite journal</ref>

Matrix square root

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

• Decomposition: <math>A=BB</math>, not unique in general.
• In the case of positive semidefinite <math>A</math>, there is a unique positive semidefinite <math>B</math> such that <math>A=B^*B=BB</math>.

Generalizations

Template:Expand section There exist analogues of the SVD, QR, LU and Cholesky factorizations for quasimatrices and cmatrices or continuous matrices.<ref>Template:Harvnb</ref> A ‘quasimatrix’ is, like a matrix, a rectangular scheme whose elements are indexed, but one discrete index is replaced by a continuous index. Likewise, a ‘cmatrix’, is continuous in both indices. As an example of a cmatrix, one can think of the kernel of an integral operator.

These factorizations are based on early work by Template:Harvtxt, Template:Harvtxt and Template:Harvtxt. For an account, and a translation to English of the seminal papers, see Template:Harvtxt.

See also

• Matrix splitting
• Non-negative matrix factorization
• Principal component analysis

References

Bibliography

• Template:Cite journal
• Template:Citation
• Template:Citation
• Template:Cite journal
• Template:Citation
• Template:Citation
• Template:Cite book
• Template:Citation
• Template:Citation
• Template:Citation

External links

• Online Matrix Calculator
• Wolfram Alpha Matrix Decomposition Computation » LU and QR Decomposition
• Springer Encyclopaedia of Mathematics » Matrix factorization
• GraphLab GraphLab collaborative filtering library, large scale parallel implementation of matrix decomposition methods (in C++) for multicore.

{{#invoke:Navbox|navbox}}