# LU decomposition

In numerical analysis and linear algebra, lower–upper (LU) decomposition or 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. LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using LU decomposition, and it is also a key step when inverting a matrix or computing the determinant of a matrix. LU decomposition was introduced by a Polish mathematician Tadeusz Banachiewicz in 1938.

## 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:

$A=LU.$ 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 3 × 3 matrix A, its LU decomposition looks like this:

${\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}}.$ 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 ${\textstyle a_{11}=l_{11}u_{11}}$ . If ${\textstyle a_{11}=0}$ , then at least one of ${\textstyle l_{11}}$ and ${\textstyle u_{11}}$ has to be zero, which implies that either L or U is singular. This is impossible if A is nonsingular (invertible). 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.

### LU factorization with partial pivoting

It turns out that a proper permutation in rows (or columns) is sufficient for LU factorization. LU factorization with partial pivoting (LUP) refers often to LU factorization with row permutations only:

$PA=LU,$ where L and U are again lower and upper triangular matrices, and P is a permutation matrix, which, when left-multiplied to A, reorders the rows of A. It turns out that all square matrices can be factorized in this form, and the factorization is numerically stable in practice. This makes LUP decomposition a useful technique in practice.

### LU factorization with full pivoting

An LU factorization with full pivoting involves both row and column permutations:

$PAQ=LU,$ where L, U and P are defined as before, and Q is a permutation matrix that reorders the columns of A.

### LDU decomposition

An LDU decomposition is a decomposition of the form

$A=LDU,$ where D is a diagonal matrix, and L and U are unitriangular 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 2-by-2 matrix:

${\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}}.$ 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

{\begin{aligned}l_{11}\cdot u_{11}+0\cdot 0&=4\\l_{11}\cdot u_{12}+0\cdot u_{22}&=3\\l_{21}\cdot u_{11}+l_{22}\cdot 0&=6\\l_{21}\cdot u_{12}+l_{22}\cdot u_{22}&=3.\end{aligned}} This system of equations is underdetermined. In this case any two non-zero elements of L and U matrices are parameters of the solution and can be set arbitrarily to any non-zero 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:

{\begin{aligned}l_{21}&=1.5\\u_{11}&=4\\u_{12}&=3\\u_{22}&=-1.5\end{aligned}} Substituting these values into the LU decomposition above yields

${\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}}.$ ## Existence and uniqueness

### Square matrices

Any square matrix ${\textstyle A}$ admits an LUP factorization. If ${\textstyle A}$ is invertible, then it admits an LU (or LDU) factorization if and only if all its leading principal minors are nonzero. If ${\textstyle A}$ is a singular matrix of rank ${\textstyle k}$ , then it admits an LU factorization if the first ${\textstyle k}$ leading principal minors are nonzero, although the converse is not true.

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. In that case, the LU factorization is also unique if we require that the diagonal of ${\textstyle L}$ (or ${\textstyle U}$ ) 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

$A=LL^{*}.\,$ This decomposition is called the Cholesky decomposition. The Cholesky decomposition always exists and is unique — provided the matrix is positive definite. 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.

## Algorithms

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 an LU decomposition using either of these algorithms requires ${\textstyle {\frac {2}{3}}n^{3}}$ floating-point operations, ignoring lower-order terms. Partial pivoting adds only a quadratic term; this is not the case for full pivoting.

### 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. In particular, ${\textstyle D_{1}=A_{1,1}}$ , and for ${\textstyle i=2,\ldots ,n}$ , ${\textstyle D_{i}}$ is the ratio of the ${\textstyle i}$ -th principal submatrix to the ${\textstyle (i-1)}$ -th principal submatrix. Computation of the determinants is computationally expensive, so this explicit formula is not used in practice.

### Doolittle algorithm

Given an N × N matrix

$A=(a_{i,j})_{1\leq i,j\leq N},$ we define

$A^{(0)}:=A.$ We eliminate the matrix elements below the main diagonal in the n-th column of A(n − 1) by adding to the i-th row of this matrix the n-th row multiplied by

$-l_{i,n}:=-{\frac {a_{i,n}^{(n-1)}}{a_{n,n}^{(n-1)}}}$ for ${\textstyle i=n+1,\ldots ,N}$ . This can be done by multiplying A(n − 1) to the left with the lower triangular matrix

$L_{n}={\begin{pmatrix}1&0&&\dots &&0\\0&\ddots &\ddots &&&\\&&1&&&\\\vdots &&-l_{n+1,n}&&&\vdots \\&&\vdots &&\ddots &0\\0&&-l_{N,n}&&&1\end{pmatrix}}.$ We set

$A^{(n)}:=L_{n}A^{(n-1)}.$ 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

$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_{N-1}^{-1}A^{(N-1)}.$ Denote the upper triangular matrix A(N − 1) by U, and ${\textstyle L=L_{1}^{-1}\ldots L_{N-1}^{-1}}$ . Because the inverse of a lower triangular matrix Ln 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

$L={\begin{pmatrix}1&0&\dots &&&0\\l_{2,1}&\ddots &\ddots &&&\\&&1&&&\\\vdots &&l_{n+1,n}&\ddots &&\vdots \\&&\vdots &&1&0\\l_{N,1}&&l_{N,n}&&l_{N,N-1}&1\end{pmatrix}}.$ We obtain ${\textstyle A=LU}$ .

It is clear that in order for this algorithm to work, one needs to have ${\textstyle a_{n,n}^{(n-1)}\neq 0}$ at each step (see the definition of ${\textstyle l_{i,n}}$ ). If this assumption fails at some point, one needs to interchange n-th row with another row below it before continuing. This is why an LU decomposition in general looks like ${\textstyle P^{-1}A=LU}$ .

### Crout and LUP algorithms

The LUP decomposition algorithm by Cormen et al. generalizes Crout matrix decomposition. It can be described as follows.

1. If ${\textstyle A}$ has a nonzero entry in its first row, then take a permutation matrix ${\textstyle P_{1}}$ such that ${\textstyle AP_{1}}$ has a nonzero entry in its upper left corner. Otherwise, take for ${\textstyle P_{1}}$ the identity matrix. Let ${\textstyle A_{1}=AP_{1}}$ .
2. Let ${\textstyle A_{2}}$ be the matrix that one gets from ${\textstyle A_{1}}$ by deleting both the first row and the first column. Decompose ${\textstyle A_{2}=L_{2}U_{2}P_{2}}$ recursively. Make ${\textstyle L}$ from ${\textstyle L_{2}}$ by first adding a zero row above and then adding the first column of ${\textstyle A_{1}}$ at the left.
3. Make ${\textstyle U_{3}}$ from ${\textstyle U_{2}}$ 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 ${\textstyle P_{3}}$ from ${\textstyle P_{2}}$ in a similar manner and define ${\textstyle A_{3}=A_{1}/P_{3}=AP_{1}/P_{3}}$ . Let ${\textstyle P}$ be the inverse of ${\textstyle P_{1}/P_{3}}$ .
4. At this point, ${\textstyle A_{3}}$ is the same as ${\textstyle LU_{3}}$ , except (possibly) at the first row. If the first row of ${\textstyle A}$ is zero, then ${\textstyle A_{3}=LU_{3}}$ , since both have first row zero, and ${\textstyle A=LU_{3}P}$ follows, as desired. Otherwise, ${\textstyle A_{3}}$ and ${\textstyle LU_{3}}$ have the same nonzero entry in the upper left corner, and ${\textstyle A_{3}=LU_{3}U_{1}}$ for some upper triangular square matrix ${\textstyle U_{1}}$ with ones on the diagonal (${\textstyle U_{1}}$ clears entries of ${\textstyle LU_{3}}$ and adds entries of ${\textstyle A_{3}}$ by way of the upper left corner). Now ${\textstyle A=LU_{3}U_{1}P}$ is a decomposition of the desired form.

### Randomized algorithm

It is possible to find a low rank approximation to an LU decomposition using a randomized algorithm. Given an input matrix ${\textstyle A}$ and a desired low rank ${\textstyle k}$ , the randomized LU returns permutation matrices ${\textstyle P,Q}$ and lower/upper trapezoidal matrices ${\textstyle L,U}$ of size ${\textstyle m\times k}$ and ${\textstyle k\times n}$ respectively, such that with high probability ${\textstyle \Vert PAQ-LU\Vert _{2}\leq C\sigma _{k+1}}$ , where ${\textstyle C}$ is a constant that depends on the parameters of the algorithm and ${\textstyle \sigma _{k+1}}$ is the ${\textstyle (k+1)}$ th singular value of the input matrix ${\textstyle A}$ .

### Theoretical complexity

If two matrices of order n can be multiplied in time M(n), where M(n) ≥ na for some a > 2, then an LU decomposition can be computed in time O(M(n)). This means, for example, that an O(n2.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 fill-in (entries that change from an initial zero to a non-zero value during the execution of an algorithm).

General treatment of orderings that minimize fill-in can be addressed using graph theory.

## Applications

### Solving linear equations

Given a system of linear equations in matrix form

$Ax=b,$ we want to solve the equation for x, given A and b. Suppose we have already obtained the LUP decomposition of A such that ${\textstyle PA=LU}$ , so ${\textstyle LUx=Pb}$ .

In this case the solution is done in two logical steps:

1. First, we solve the equation ${\textstyle Ly=Pb}$ for y.
2. Second, we solve the equation ${\textstyle Ux=y}$ for x.

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 ${\textstyle {\frac {2}{3}}n^{3}}$ floating-point operations if the matrix ${\textstyle A}$ has size ${\textstyle n}$ . This makes it twice as fast as algorithms based on QR decomposition, which costs about ${\textstyle {\frac {4}{3}}n^{3}}$ floating-point operations when Householder reflections are used. For this reason, LU decomposition is usually preferred.

### 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. In matrix inversion however, instead of vector b, we have matrix B, where B is an n-by-p matrix, so that we are trying to find a matrix X (also a n-by-p matrix):

$AX=LUX=B.$ 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.

### Computing the determinant

Given the LUP decomposition ${\textstyle A=P^{-1}LU}$ of a square matrix A, the determinant of A can be computed straightforwardly as

$\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).$ 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, ${\textstyle \det(A)}$ also equals the right-hand 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.

### C code examples

/* INPUT: A - array of pointers to rows of a square matrix having dimension N
*        Tol - small tolerance number to detect failure when the matrix is near degenerate
* OUTPUT: Matrix A is changed, it contains a copy of both matrices L-E and U as A=(L-E)+U such that P*A=L*U.
*        The permutation matrix is not stored as a matrix, but in an integer vector P of size N+1
*        containing column indexes where the permutation matrix has "1". The last element P[N]=S+N,
*        where S is the number of row exchanges needed for determinant computation, det(P)=(-1)^S
*/
int LUPDecompose(double **A, int N, double Tol, int *P) {

int i, j, k, imax;
double maxA, *ptr, absA;

for (i = 0; i <= N; i++)
P[i] = i; //Unit permutation matrix, P[N] initialized with N

for (i = 0; i < N; i++) {
maxA = 0.0;
imax = i;

for (k = i; k < N; k++)
if ((absA = fabs(A[k][i])) > maxA) {
maxA = absA;
imax = k;
}

if (maxA < Tol) return 0; //failure, matrix is degenerate

if (imax != i) {
//pivoting P
j = P[i];
P[i] = P[imax];
P[imax] = j;

//pivoting rows of A
ptr = A[i];
A[i] = A[imax];
A[imax] = ptr;

//counting pivots starting from N (for determinant)
P[N]++;
}

for (j = i + 1; j < N; j++) {
A[j][i] /= A[i][i];

for (k = i + 1; k < N; k++)
A[j][k] -= A[j][i] * A[i][k];
}
}

return 1;  //decomposition done
}

/* INPUT: A,P filled in LUPDecompose; b - rhs vector; N - dimension
* OUTPUT: x - solution vector of A*x=b
*/
void LUPSolve(double **A, int *P, double *b, int N, double *x) {

for (int i = 0; i < N; i++) {
x[i] = b[P[i]];

for (int k = 0; k < i; k++)
x[i] -= A[i][k] * x[k];
}

for (int i = N - 1; i >= 0; i--) {
for (int k = i + 1; k < N; k++)
x[i] -= A[i][k] * x[k];

x[i] = x[i] / A[i][i];
}
}

/* INPUT: A,P filled in LUPDecompose; N - dimension
* OUTPUT: IA is the inverse of the initial matrix
*/
void LUPInvert(double **A, int *P, int N, double **IA) {

for (int j = 0; j < N; j++) {
for (int i = 0; i < N; i++) {
if (P[i] == j)
IA[i][j] = 1.0;
else
IA[i][j] = 0.0;

for (int k = 0; k < i; k++)
IA[i][j] -= A[i][k] * IA[k][j];
}

for (int i = N - 1; i >= 0; i--) {
for (int k = i + 1; k < N; k++)
IA[i][j] -= A[i][k] * IA[k][j];

IA[i][j] = IA[i][j] / A[i][i];
}
}
}

/* INPUT: A,P filled in LUPDecompose; N - dimension.
* OUTPUT: Function returns the determinant of the initial matrix
*/
double LUPDeterminant(double **A, int *P, int N) {

double det = A;

for (int i = 1; i < N; i++)
det *= A[i][i];

if ((P[N] - N) % 2 == 0)
return det;
else
return -det;
}


### C# code examples

    public class SystemOfLinearEquations
{
public double[] SolveUsingLU(double[,] matrix, double[] rightPart, int n)
{
// decomposition of matrix
double[,] lu = new double[n, n];
double sum = 0;
for (int i = 0; i < n; i++)
{
for (int j = i; j < n; j++)
{
sum = 0;
for (int k = 0; k < i; k++)
sum += lu[i, k] * lu[k, j];
lu[i, j] = matrix[i, j] - sum;
}
for (int j = i + 1; j < n; j++)
{
sum = 0;
for (int k = 0; k < i; k++)
sum += lu[j, k] * lu[k, i];
lu[j, i] = (1 / lu[i, i]) * (matrix[j, i] - sum);
}
}

// lu = L+U-I
// find solution of Ly = b
double[] y = new double[n];
for (int i = 0; i < n; i++)
{
sum = 0;
for (int k = 0; k < i; k++)
sum += lu[i, k] * y[k];
y[i] = rightPart[i] - sum;
}
// find solution of Ux = y
double[] x = new double[n];
for (int i = n - 1; i >= 0; i--)
{
sum = 0;
for (int k = i + 1; k < n; k++)
sum += lu[i, k] * x[k];
x[i] = (1 / lu[i, i]) * (y[i] - sum);
}
return x;
}
}


### MATLAB code examples

function x = SolveLinearSystem(A, b)
n = length(b);
x = zeros(n, 1);
y = zeros(n, 1);
% decomposition of matrix, Doolittle’s Method
for i = 1:1:n
for j = 1:1:(i - 1)
alpha = A(i,j);
for k = 1:1:(j - 1)
alpha = alpha - A(i,k)*A(k,j);
end
A(i,j) = alpha/A(j,j);
end
for j = i:1:n
alpha = A(i,j);
for k = 1:1:(i - 1)
alpha = alpha - A(i,k)*A(k,j);
end
A(i,j) = alpha;
end
end
%A = L+U-I
% find solution of Ly = b
for i = 1:1:n
alpha = 0;
for k = 1:1:i
alpha = alpha + A(i,k)*y(k);
end
y(i) = b(i) - alpha;
end
% find solution of Ux = y
for i = n:(-1):1
alpha = 0;
for k = (i + 1):1:n
alpha = alpha + A(i,k)*x(k);
end
x(i) = (y(i) - alpha)/A(i, i);
end
end