Frequent Links
LU decomposition
In numerical analysis, LU decomposition (where 'LU' stands for 'lower upper', and also called LU factorization) factors a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix as well. The LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using the LU decomposition, and it is also a key step when inverting a matrix, or computing the determinant of a matrix. The LU decomposition was introduced by mathematician Alan Turing in 1948.^{[1]}^{[2]}
Contents
Definitions
Let A be a square matrix. An LU factorization refers to the factorization of A, with proper row and/or column orderings or permutations, into two factors, a lower triangular matrix L and an upper triangular matrix U,
 <math> A = LU, \, </math>
In the lower triangular matrix all elements above the diagonal are zero, in the upper triangular matrix, all the elements below the diagonal are zero. For example, for a 3by3 matrix A, its LU decomposition looks like this:
 <math>
\begin{bmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{bmatrix} = \begin{bmatrix} l_{11} & 0 & 0 \\ l_{21} & l_{22} & 0 \\ l_{31} & l_{32} & l_{33} \end{bmatrix} \begin{bmatrix} u_{11} & u_{12} & u_{13} \\ 0 & u_{22} & u_{23} \\ 0 & 0 & u_{33} \end{bmatrix}.
</math>
Without a proper ordering or permutations in the matrix, the factorization may fail to materialize. For example, it is easy to verify (by expanding the matrix multiplication) that <math>a_{11} = l_{11} u_{11}</math>. If <math>a_{11} = 0</math>, then at least one of <math>l_{11}</math> and <math>u_{11}</math> has to be zero, which implies either L or U is singular. This is impossible if A is nonsingular. This is a procedural problem. It can be removed by simply reordering the rows of A so that the first element of the permuted matrix is nonzero. The same problem in subsequent factorization steps can be removed the same way, see the basic procedure below.
It turns out that a proper permutation in rows (or columns) is sufficient for the LU factorization. The LU factorization with Partial Pivoting refers often to the LU factorization with row permutations only,
 <math> PA = LU, \, </math>
where L and U are again lower and upper triangular matrices, and P is a permutation matrix which, when leftmultiplied to A, reorders the rows of A. It turns out that all square matrices can be factorized in this form,^{[3]} and the factorization is numerically stable in practice.^{[4]} This makes LUP decomposition a useful technique in practice.
An LU factorization with full pivoting involves both row and column permutations,
 <math> PAQ = LU, \, </math>
where L, U and P are defined as before, and Q is a permutation matrix that reorders the columns of A.^{[5]}
An LDU decomposition is a decomposition of the form
 <math> A = LDU, \, </math>
where D is a diagonal matrix and L and U are unit triangular matrices, meaning that all the entries on the diagonals of L and U are one.
Above we required that A be a square matrix, but these decompositions can all be generalized to rectangular matrices as well. In that case, L and D are square matrices both of which have the same number of rows as A, and U has exactly the same dimensions as A. Upper triangular should be interpreted as having only zero entries below the main diagonal, which starts at the upper left corner.
Example
We factorize the following 2by2 matrix:
 <math>
\begin{bmatrix} 4 & 3 \\ 6 & 3 \end{bmatrix} = \begin{bmatrix} l_{11} & 0 \\ l_{21} & l_{22} \end{bmatrix} \begin{bmatrix} u_{11} & u_{12} \\ 0 & u_{22} \end{bmatrix}.
</math> One way to find the LU decomposition of this simple matrix would be to simply solve the linear equations by inspection. Expanding the matrix multiplication gives
 <math>l_{11} \cdot u_{11} + 0 \cdot 0 = 4</math>
 <math>l_{11} \cdot u_{12} + 0 \cdot u_{22} = 3</math>
 <math>l_{21}\cdot u_{11} + l_{22} \cdot 0 = 6</math>
 <math>l_{21}\cdot u_{12} + l_{22} \cdot u_{22} = 3.</math>
This system of equations is underdetermined. In this case any two nonzero elements of L and U matrices are parameters of the solution and can be set arbitrarily to any nonzero value. Therefore to find the unique LU decomposition, it is necessary to put some restriction on L and U matrices. For example, we can conveniently require the lower triangular matrix L to be a unit triangular matrix (i.e. set all the entries of its main diagonal to ones). Then the system of equations has the following solution:
 <math>l_{21} = 1.5</math>
 <math>u_{11} = 4</math>
 <math>u_{12} = 3</math>
 <math>u_{22} = 1.5.</math>
Substituting these values into the LU decomposition above yields
 <math>
\begin{bmatrix} 4 & 3 \\ 6 & 3 \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 1.5 & 1 \end{bmatrix} \begin{bmatrix} 4 & 3 \\ 0 & 1.5 \end{bmatrix}.
</math>
Existence and uniqueness
Square matrices
Any square matrix <math> A </math> admits an LUP factorization.^{[3]} If <math> A </math> is invertible, then it admits an LU (or LDU) factorization if and only if all its leading principal minors are nonsingular.^{[6]} If <math> A </math> is a singular matrix of rank <math> k </math>, then it admits an LU factorization if the first <math> k </math> leading principal minors are nonsingular, although the converse is not true.^{[7]}
If a square, invertible matrix has an LDU factorization with all diagonal entries of L and U equal to 1, then the factorization is unique.^{[6]} In that case, the LU factorization is also unique if we require that the diagonal of <math> L </math> (or <math> U </math>) consists of ones.
Symmetric positive definite matrices
If A is a symmetric (or Hermitian, if A is complex) positive definite matrix, we can arrange matters so that U is the conjugate transpose of L. That is, we can write A as
 <math> A = L L^{*}. \, </math>
This decomposition is called the Cholesky decomposition. The Cholesky decomposition always exists and is unique. Furthermore, computing the Cholesky decomposition is more efficient and numerically more stable than computing some other LU decompositions.
General matrices
For a (not necessarily invertible) matrix over any field, the exact necessary and sufficient conditions under which it has an LU factorization are known. The conditions are expressed in terms of the ranks of certain submatrices. The Gaussian elimination algorithm for obtaining LU decomposition has also been extended to this most general case.^{[8]}
Algorithms
The LU decomposition is basically a modified form of Gaussian elimination. We transform the matrix A into an upper triangular matrix U by eliminating the entries below the main diagonal. The Doolittle algorithm does the elimination column by column starting from the left, by multiplying A to the left with atomic lower triangular matrices. It results in a unit lower triangular matrix and an upper triangular matrix. The Crout algorithm is slightly different and constructs a lower triangular matrix and a unit upper triangular matrix.
Computing the LU decomposition using either of these algorithms requires 2n^{3} / 3 floating point operations, ignoring lower order terms. Partial pivoting adds only a quadratic term; this is not the case for full pivoting.^{[9]}
Closed formula
When an LDU factorization exists and is unique there is a closed (explicit) formula for the elements of L, D, and U in terms of ratios of determinants of certain submatrices of the original matrix A.^{[10]} In particular, <math>D_1 = A_{1,1}</math> and for <math>i = 2, \ldots, n</math>, <math>D_i</math> is the ratio of the <math>i^{th}</math> principal submatrix to the <math>(i1)^{th}</math> principal submatrix.
Doolittle algorithm
Given an N × N matrix
 <math>
A= (a_{n,n}) </math>
we define
 <math> A^{(0)} := A</math>
We eliminate the matrix elements below the main diagonal in the nth column of A^{(n − 1)} by adding to the ith row of this matrix the nth row multiplied by
 <math>l_{i,n} := \frac{a_{i,n}^{(n1)}}{a_{n,n}^{(n1)}}</math>
for <math>i = n+1,\ldots,N</math>. This can be done by multiplying A^{(n − 1)} to the left with the lower triangular matrix
 <math>
L_n = \begin{pmatrix}
1 & & & & & 0 \\ & \ddots & & & & \\ & & 1 & & & \\ & & l_{n+1,n} & \ddots & & \\ & & \vdots & & \ddots & \\ 0 & & l_{N,n} & & & 1
\end{pmatrix}. </math>
We set
 <math> A^{(n)} := L_n A^{(n1)}.</math>
After N − 1 steps, we eliminated all the matrix elements below the main diagonal, so we obtain an upper triangular matrix A^{(N − 1)}. We find the decomposition
 <math>
A = L_1^{1} L_{1} A^{(0)} = L_1^{1} A^{(1)} = L_1^{1} L_2^{1} L_2 A^{(1)} = L_1^{1}L_2^{1} A^{(2)} =\dotsb = L_1^{1} \ldots L_{N1}^{1} A^{(N1)}. </math>
Denote the upper triangular matrix A^{(N − 1)} by U, and <math>L=L_1^{1} \ldots L_{N1}^{1}</math>. Because the inverse of a lower triangular matrix L_{n} is again a lower triangular matrix, and the multiplication of two lower triangular matrices is again a lower triangular matrix, it follows that L is a lower triangular matrix. Moreover, it can be seen that
 <math>
L = \begin{pmatrix}
1 & & & & & 0 \\
l_{2,1} & \ddots & & & & \\
& & 1 & & & \\ \vdots & & l_{n+1,n} & \ddots & & \\ & & \vdots & & 1 & \\
l_{N,1} & & l_{N,n} & & l_{N,N1} & 1 \end{pmatrix}. </math>
We obtain <math>A=LU</math>.
It is clear that in order for this algorithm to work, one needs to have <math>a_{n,n}^{(n1)}\not=0</math> at each step (see the definition of <math>l_{i,n}</math>). If this assumption fails at some point, one needs to interchange nth row with another row below it before continuing. This is why the LU decomposition in general looks like <math>P^{1}A = L U </math>.
Crout and LUP algorithms
The LUP decomposition algorithm by Cormen et al. generalizes Crout matrix decomposition. It can be described as follows.
 If <math>A</math> has a nonzero entry in its first row, then take a permutation matrix <math>P_1</math> such that <math>A P_1</math> has a nonzero entry in its upper left corner. Otherwise, take for <math>P_1</math> the identity matrix. Let <math>A_1 = A P_1</math>.
 Let <math>A_2</math> be the matrix that one gets from <math>A_1</math> by deleting both the first row and the first column. Decompose <math>A_2 = L_2 U_2 P_2</math> recursively. Make <math>L</math> from <math>L_2</math> by first adding a zero row above and then adding the first column of <math>A_1</math> at the left.
 Make <math>U_3</math> from <math>U_2</math> by first adding a zero row above and a zero column at the left and then replacing the upper left entry (which is 0 at this point) by 1. Make <math>P_3</math> from <math>P_2</math> in a similar manner and define <math>A_3 = A_1 / P_3 = A P_1 / P_3</math>. Let <math>P</math> be the inverse of <math>P_1 / P_3</math>.
 At this point, <math>A_3</math> is the same as <math>L U_3</math>, except (possibly) at the first row. If the first row of <math>A</math> is zero, then <math>A_3 = L U_3</math>, since both have first row zero, and <math>A = L U_3 P</math> follows, as desired. Otherwise, <math>A_3</math> and <math>L U_3</math> have the same nonzero entry in the upper left corner, and <math>A_3 = L U_3 U_1</math> for some upper triangular square matrix <math>U_1</math> with ones on the diagonal (<math>U_1</math> clears entries of <math>L U_3</math> and adds entries of <math>A_3</math> by way of the upper left corner). Now <math>A = L U_3 U_1 P</math> is a decomposition of the desired form.
Theoretical complexity
If two matrices of order n can be multiplied in time M(n), where M(n) ≥ n^{a} for some a>2, then the LU decomposition can be computed in time O(M(n)).^{[11]} This means, for example, that an O(n^{2.376}) algorithm exists based on the Coppersmith–Winograd algorithm.
Sparse matrix decomposition
Special algorithms have been developed for factorizing large sparse matrices. These algorithms attempt to find sparse factors L and U. Ideally, the cost of computation is determined by the number of nonzero entries, rather than by the size of the matrix.
These algorithms use the freedom to exchange rows and columns to minimize fillin (entries which change from an initial zero to a nonzero value during the execution of an algorithm).
General treatment of orderings that minimize fillin can be addressed using graph theory.
Applications
Solving linear equations
Given a system of linear equations in matrix form
 <math>A x = b , \,</math>
we want to solve the equation for x given A and b. Suppose we have already obtained the LUP decomposition of A such that <math>PA = LU</math>, (or the LU composition if one exists, in which case <math>P = I</math>) we can rewrite the equation equivalently as
 <math>L U x = P b . \,</math>
In this case the solution is done in two logical steps:
 First, we solve the equation <math> L y = P b </math> for y;
 Second, we solve the equation <math> U x = y </math> for x.
Note that in both cases we are dealing with triangular matrices (L and U) which can be solved directly by forward and backward substitution without using the Gaussian elimination process (however we do need this process or equivalent to compute the LU decomposition itself).
The above procedure can be repeatedly applied to solve the equation multiple times for different b. In this case it is faster (and more convenient) to do an LU decomposition of the matrix A once and then solve the triangular matrices for the different b, rather than using Gaussian elimination each time. The matrices L and U could be thought to have "encoded" the Gaussian elimination process.
The cost of solving a system of linear equations is approximately <math> \frac23 n^3 </math> floating point operations if the matrix <math> A </math> has size <math> n </math>. This makes it twice as fast as algorithms based on the QR decomposition, which costs about <math> \frac43 n^3 </math> floating point operations when Householder reflections is used. For this reason, the LU decomposition is usually preferred.^{[12]}
Inverting a matrix
When solving systems of equations, b is usually treated as a vector with a length equal to the height of matrix A. Instead of vector b, we have matrix B, where B is an nbyp matrix, so that we are trying to find a matrix X (also a nbyp matrix):
 <math>
A X = L U X = B. </math>
We can use the same algorithm presented earlier to solve for each column of matrix X. Now suppose that B is the identity matrix of size n. It would follow that the result X must be the inverse of A.^{[13]}
Computing the determinant
Given the LUP decomposition <math>A = P^{1} L U</math> of a square matrix A, the determinant of A can be computed straightforwardly as
 <math>\det(A) = \det(P^{1}) \det(L) \det(U) = (1)^S \left( \prod_{i=1}^n l_{ii} \right) \left( \prod_{i=1}^n u_{ii} \right) . </math>
The second equation follows from the fact that the determinant of a triangular matrix is simply the product of its diagonal entries, and that the determinant of a permutation matrix is equal to (−1)^{S} where S is the number of row exchanges in the decomposition.
In the case of LU decomposition with full pivoting, <math>\det(A)</math> also equals the righthand side of the above equation, if we let S be the total number of row and column exchanges.
The same method readily applies to LU decomposition by setting P equal to the identity matrix.
See also
Notes
 ^ doi:10.1093/qjmam/1.1.287
This citation will be automatically completed in the next few minutes. You can jump the queue or expand by hand  ^ Poole (2006)
 ^ ^{a} ^{b} Okunev & Johnson (1997), Corollary 3
 ^ Trefethen & Bau (1997), p. 166
 ^ Trefethen & Bau (1997), p. 161
 ^ ^{a} ^{b} Horn & Johnson (1985), Corollary 3.5.5
 ^ Horn & Johnson (1985), Theorem 3.5.2
 ^ Okunev & Johnson (1997)
 ^ Golub & Van Loan (1996), p. 112, 119
 ^ Householder (1975)
 ^ Bunch & Hopcroft (1974)
 ^ Trefethen & Bau (1997), p. 152
 ^ Golub & Van Loan (1996), p. 121
References
 Bunch, James R.; Hopcroft, John (1974), "Triangular factorization and inversion by fast matrix multiplication", Mathematics of Computation 28: 231–236, ISSN 00255718, doi:10.2307/2005828.
 Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001), Introduction to Algorithms, MIT Press and McGrawHill, ISBN 9780262032933.
 Golub, Gene H.; Van Loan, Charles F. (1996), Matrix Computations (3rd ed.), Baltimore: Johns Hopkins, ISBN 9780801854149.
 Horn, Roger A.; Johnson, Charles R. (1985), Matrix Analysis, Cambridge University Press, ISBN 0521386322. See Section 3.5. N − 1
 Householder, Alston S. (1975), The Theory of Matrices in Numerical Analysis, New York: Dover Publications, MR 0378371.
 Okunev, Pavel; Johnson, Charles R. (1997), Necessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix, arXiv:math.NA/0506382.
 Poole, David (2006), Linear Algebra: A Modern Introduction (2nd ed.), Canada: Thomson Brooks/Cole, ISBN 0534998453.
 Press, WH; Teukolsky, SA; Vetterling, WT; Flannery, BP (2007), "Section 2.3", Numerical Recipes: The Art of Scientific Computing (3rd ed.), New York: Cambridge University Press, ISBN 9780521880688.
 Trefethen, Lloyd N.; Bau, David (1997), Numerical linear algebra, Philadelphia: Society for Industrial and Applied Mathematics, ISBN 9780898713619.
External links
References
 LU decomposition on MathWorld.
 LU decomposition on MathLinux.
 Module for LU Factorization with Pivoting, Prof. J. H. Mathews, California State University, Fullerton
 LU decomposition at Holistic Numerical Methods Institute
 LU matrix factorization. MATLAB reference.
Computer code
 LAPACK is a collection of FORTRAN subroutines for solving dense linear algebra problems
 ALGLIB includes a partial port of the LAPACK to C++, C#, Delphi, etc.
 C++ code, Prof. J. Loomis, University of Dayton
 C code, Mathematics Source Library
 LU in X10
Online resources
 WebApp descriptively solving systems of linear equations with LU Decomposition
 Matrix Calculator, bluebit.gr
 LU Decomposition Tool, unibonn.de
 LU Decomposition by Ed Pegg, Jr., The Wolfram Demonstrations Project, 2007.
