Matrix decomposition

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 instance, when solving a system of linear equations $Ax=b$, 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 $L(Ux)=b$ and $Ux=L^{-1}b$ require fewer additions and multiplications to solve, compared with the original system $Ax=b$, 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:main|main}}

• Applicable to: square matrix A
• Decomposition: $A=LU$, where L is lower triangular and U is upper triangular
• Related: the LDU decomposition is $A=LDU$, 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 $A=LUP$, 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. If the LU decomposition exists, the LDU decomposition does too.
• Comments: The LUP and LU decompositions are useful in solving an n-by-n system of linear equations $Ax=b$. 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:main|main}}

Block LU decomposition

{{#invoke:main|main}}

Rank factorization

{{#invoke:main|main}}

• Applicable to: m-by-n matrix A of rank r
• Decomposition: $A=CF$ 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, which one can apply to obtain all solutions of the linear system $Ax=b$.

Cholesky decomposition

{{#invoke:main|main}}

• Applicable to: square, symmetric, positive definite matrix A
• Decomposition: $A=U^{T}U$, where U is upper triangular with positive diagonal entries
• Comment: the Cholesky decomposition is unique
• Comment: the Cholesky decomposition is also applicable for complex hermitian positive definite matrices
• Comment: An alternative is the LDL decomposition, which can avoid extracting square roots.

QR decomposition

{{#invoke:main|main}}

• Applicable to: m-by-n matrix A
• Decomposition: $A=QR$ where Q is an orthogonal matrix of size m-by-m, and R is an upper triangular matrix of size m-by-n
• Comment: The QR decomposition provides an alternative way of solving the system of equations $Ax=b$ without inverting the matrix A. The fact that Q is orthogonal means that $Q^{T}Q=I$, so that $Ax=b$ is equivalent to $Rx=Q^{T}b$, which is easier to solve since R is triangular.

RRQR factorization

{{#invoke:main|main}}

Interpolative decomposition

{{#invoke:main|main}}

Decompositions based on eigenvalues and related concepts

Eigendecomposition

{{#invoke:main|main}}

• Also called spectral decomposition
• Applicable to: square matrix A with distinct eigenvectors (not necessarily distinct eigenvalues).
• Decomposition: $A=VDV^{-1}$, 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 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 $AV=VD$. If the n eigenvectors (not necessarily eigenvalues) are distinct (that is, none is equal to any of the others), then V is invertible, implying the decomposition $A=VDV^{-1}$.
• Comment: One can always normalize the eigenvectors to have length one (see definition of the eigenvalue equation). If $A$ is real-symmetric, $V$ is always invertible and can be made to have normalized columns. Then the equation $VV^{T}=I$ holds, because each eigenvector is orthogonal to the other. Therefore the decomposition (which always exists if A is real-symmetric) reads as: $A=VDV^{T}$
• Comment: The condition of having n distinct eigenvalues is sufficient but not necessary. The necessary and sufficient condition is for each eigenvalue to have geometric multiplicity equal to its algebraic multiplicity.
• 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 $x_{t+1}=Ax_{t}$ starting from the initial condition $x_{0}=c$ is solved by $x_{t}=A^{t}c$, which is equivalent to $x_{t}=VD^{t}V^{-1}c$, where V and D are the matrices formed from the eigenvectors and eigenvalues of A. Since D is diagonal, raising it to power $D^{t}$, just involves raising each element on the diagonal to the power t. This is much easier to do and to 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:main|main}}

• Applicable to: square matrix A
• Comment: there are two versions of this decomposition: the complex Schur decomposition and the real Schur decomposition. A complex matrix always has a complex Schur decomposition.
• Decomposition (complex version): $A=UTU^{H}$, where U is a unitary matrix, $U^{H}$ 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.
• Decomposition (real version): $A=VSV^{T}$, where A, V, S and $V^{T}$ are matrices that contain real numbers only. In this case, V is an orthogonal matrix, $V^{T}$ 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:main|main}}

• 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): $A=QSZ^{H}$ and $B=QTZ^{H}$ where Q and Z are unitary matrices, the H 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, $\lambda _{i}=S_{ii}/T_{ii}$, are the generalized eigenvalues that solve the generalized eigenvalue problem $Av=\lambda Bv$ (where $\lambda$ is an unknown scalar and v is an unknown nonzero vector).
• Decomposition (real version): $A=QSZ^{T}$ and $B=QTZ^{T}$ 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: $A=VDV^{T}$, where D is a real nonnegative diagonal matrix, and V is unitary. $V^{T}$ denotes the matrix transpose of V.
• Comment: The diagonal elements of D are the nonnegative square roots of the eigenvalues of $AA^{H}$.
• Comment: V may be complex even if A is real.
• Comment: This is not a special case of the eigendecomposition (see above).

Singular value decomposition

{{#invoke:main|main}}

• Applicable to: m-by-n matrix A.
• Decomposition: $A=UDV^{H}$, where D is a nonnegative diagonal matrix, and U and V are unitary matrices, and $V^{H}$ denotes the conjugate transpose of V (or simply the transpose, if V contains real numbers only).
• Comment: The diagonal elements of D are called the singular values of A.
• Comment: Like the eigendecomposition below, 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.

Other decompositions

Polar decomposition

{{#invoke:main|main}}

• Applicable to: square, complex, matrix A.
• Decomposition: $A=UP$, where U is a unitary matrix and P is a positive semidefinite Hermitian matrix.

Algebraic polar decomposition

• Applicable to: square, complex, non-singular matrix A.
• Decomposition: $A=QS$, where Q is a complex orthogonal matrix and S is complex symmetric matrix.
• Comment: The existence of this decomposition is equivalent to $AA^{T}$ being similar to $A^{T}A$.

Generalizations

Template:Expand section There exist analogues of the SVD, QR, LU and Cholesky factorizations for quasimatrices and cmatrices or continuous matrices. 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
• Proper orthogonal decomposition
• Matrix decomposition into clans

References

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

• {{#invoke:citation/CS1|citation

|CitationClass=book }}

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

External links

• Online Matrix Calculator
• 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 }}