LU decomposition

Let be a square matrix. An LU factorization refers to expression of into product of two factors – a lower triangular matrix and an upper triangular matrix such that . Sometimes factorization is impossible without prior reordering of to prevent division by zero or uncontrolled growth of rounding errors hence alternative expression becomes , where in formal notation permutation matrices factors and indicate permutation of rows (or columns) of . In theory (or ) are obtained by permutations of rows (or columns) of the identity matrix, in practice the corresponding permutations are applied directly to rows (or columns) of . Matrix of side has n^{2} coefficients while two triangle matrices combined contain coefficients, therefore coefficients of matrices are not independent. Usual convention is to set unitriangular, i.e. with all main diagonal elements equal one. However, setting instead matrix unitriangular reduces to the same procedure after transpose of matrix product (cf. properties of matrix transposition): B = A^\textsf{T} = (LU)^\textsf{T} =U^\textsf{T}L^\textsf{T}. After transposition, is lower triangle while is upper unitriangular factor of . This demonstrates also, that operations on rows (e.g. pivoting) are equivalent to those on columns of a transposed matrix, and in general choice of row or column algorithm offers no advantage. In the lower triangular matrix all elements above the main diagonal are zero, in the upper triangular matrix, all the elements below the diagonal are zero. For example, for a matrix , 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} \ell_{11} & 0 & 0 \\ \ell_{21} & \ell_{22} & 0 \\ \ell_{31} & \ell_{32} & \ell_{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 a_{11} = \ell_{11} u_{11}. If a_{11} = 0, then at least one of \ell_{11} and u_{11} has to be zero, which implies that either or is singular. This is impossible if is nonsingular (invertible). In terms of operations, zeroing/elimination of remaining elements of first column of involves division of a_{21}, a_{31} with a_{11}, impossible if it is 0. This is a procedural problem. It can be removed by simply reordering the rows of so that the first element of the permuted matrix is nonzero. The same problem in subsequent factorization steps can be removed the same way. For numerical stability against rounding errors/division by small numbers it is important to select a_{11} of large absolute value (cf. pivoting). LU Through recursion The above example of matrices demonstrates that matrix product of top row and leftmost columns of involved matrices plays special role for to succeed. Let us mark consecutive versions of matrices with (0),\;(1),\dots and then let us write matrix product A\equiv A^{(0)}=L^{(0)}U^{(0)} in such way that these rows and columns are separated from the rest. In doing so we shall use block matrix notation, such that e.g. a\equiv a_{11} is an ordinary number, {\bf w}^\textsf{T} \equiv(a_{12}, a_{13})^\textsf{T} is a row vector and {\bf v}=(a_{21},a_{31}) is a column vector and A' is sub-matrix of matrix A^{(0)} without top row and leftmost column. Then we can replace A^{(0)}=L^{(0)}U^{(0)} with a block matrix product. Namely it turns out that one can multiply matrix blocks in such way as if they were ordinary numbers, i.e. row times column, except that now their components are sub-matrices, sometimes reduced to scalars or vectors. Thus u{\bf l} denotes a vector obtained from {\bf l} after multiplication of each component by a number {\bf lu}^\textsf{T} is an outer product of vectors {{nowrap|{\bf l, u},}} i.e. a matrix which first column is {{nowrap|u_{12}{\bf l},}} next is u_{13}{\bf l} and so on for all components of {\bf u} and L^{(1)}U^{(1)} is a product of sub-matrices of L^{(0)},\;U^{(0)} \begin{align} \left( \begin{array}{c|c} a & {\bf w}^\textsf{T} \\ \hline \\[-0.5em] {\bf v} & \quad A' \quad \\[-0.5em] \\ \end{array} \right) &= \left( \begin{array}{c|c} {\rm 1} & {\bf 0}^\textsf{T} \\ \hline \\[-0.5em] {\bf l} & \quad L^{(1)} \quad \\[-0.5em] \\ \end{array} \right)\; \left( \begin{array}{c|c} u & {\bf u}^\textsf{T} \\ \hline \\[-0.5em] {\bf 0} & \quad U^{(1)} \\[-0.5em] \\ \end{array} \right) \\ &=\left( \begin{array}{c|c} u & {\bf u}^\textsf{T} \\ \hline \\[-0.5em] u{\bf l} & \quad {\bf lu}^\textsf{T} + L^{(1)}U^{(1)} \\[-0.5em] \\ \end{array} \right) \end{align} From equality of first and last matrices follow final {\bf l}={(1/a)}{\bf v} while matrix A' becomes updated/replaced with A^{(1)}\equiv L^{(1)}U^{(1)}= {{nowrap|A'-{\bf lu}^\textsf{T}.}} Now comes the crucial observation: nothing prevents us to treat A^{(1)} the same way as we did with {{nowrap|A^{(0)},}} repeatedly. If dimension of A is , after such steps all columns \bf v form sub-diagonal part of triangle matrix L and all pivots a combined with rows {\bf w}^\textsf{T} form upper triangle matrix as required. In the above example so only two steps suffice. The above procedure demonstrates that at no step the top diagonal pivot element a of consecutive sub-matrices can be zero. To avoid it columns or rows may be swapped so that a becomes nonzero. Such procedure involving permutation is called LUP, decomposition with pivoting. Permutation of columns corresponds to matrix product AQ^{(0)} where Q^{(0)} is a permutation matrix, i.e. the identity matrix I after the same column permutation. After all steps such LUP decomposition applies to {{nowrap|AQ^{(0)}\cdots Q^{(n-1)}\equiv AQ=LU.}} Present computation scheme and similar in Cormen et al. are examples of ''''. They demonstrate two general properties of LU factorization: Recurrence algorithms are not overly costly in terms of algebraic operations yet they suffer from practical disadvantage due to need to update and store most elements of at each step. It will be seen that by reordering calculations it is possible to dispose with storage of intermediate values. LU factorization with partial pivoting It turns out that a proper permutation of rows (or columns) to select column (or row) absolute maximal pivot is sufficient for numerically stable LU factorization, except for known pathological cases. It is called '''''' (LUP): PA = LU, \quad (AQ=LU), where and are again lower and upper triangular matrices, and and are corresponding permutation matrices, which, when correspondingly left- and right-multiplied to , reorder the rows and columns of . 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. A variant called '''''' at each step involves search of maximum element the way rook moves on a chessboard, along column, row, column again and so on till reaching a pivot maximal in both its row and column. It can be proven that for large matrices of random elements its cost of operations at each step is similarly to partial pivoting proportional to the length of matrix side unlike its square for full pivoting. LU factorization with full pivoting An '''''' involves both row and column permutations to find absolute maximum element in the whole submatrix: PAQ = LU, where , , and are defined as before, and is a permutation matrix that reorders the columns of . Lower-diagonal-upper (LDU) decomposition A '''''' (LDU) is a decomposition of the form A = LDU, where is a diagonal matrix, and and are unitriangular matrices, meaning that all the entries on the diagonals of and are one. Rectangular matrices Above we required that be a square matrix, but these decompositions can all be generalized to rectangular matrices as well. In that case, and are square matrices both of which have the same number of rows as , and has exactly the same dimensions as . 'Upper triangular' should be interpreted as having only zero entries below the main diagonal, which starts at the upper left corner. Similarly, the more precise term for is that it is the row echelon form of the matrix . == Example ==

We factor the following matrix: \begin{bmatrix} 4 & 3 \\ 6 & 3 \end{bmatrix} = \begin{bmatrix} \ell_{11} & 0 \\ \ell_{21} & \ell_{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 \left\{ \begin{alignat}{4} \ell_{11} \cdot u_{11} && \;+\; && 0 \cdot 0 &&\;=\; && 4 \\ \ell_{11} \cdot u_{12} && \;+\; && 0 \cdot u_{22} &&\;=\; && 3 \\ \ell_{21} \cdot u_{11} && \;+\; && \ell_{22} \cdot 0 &&\;=\; && 6 \\ \ell_{21} \cdot u_{12} && \;+\; && \ell_{22} \cdot u_{22} &&\;=\; && 3 \end{alignat}\right. This system of equations is underdetermined. In this case any two nonzero elements of and 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 and matrices. For example, we can conveniently require the lower triangular matrix to be a unit triangular matrix, so that all the entries of its main diagonal are set to one. Then the system of equations has the following solution: \begin{align} \ell_{11} &= \ell_{22} = 1 \\ \ell_{21} &= 1.5 \\ u_{11} &= 4 \\ u_{12} &= 3 \\ u_{22} &= -1.5 \end{align} 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 admits LUP and PLU factorizations. (for example \left[\begin{smallmatrix} 0 & 1 \\ 1 & 0 \end{smallmatrix}\right] does not admit an LU or LDU factorization). If is a singular matrix of rank , then it admits an LU factorization if the first 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 and equal to ), then the factorization is unique. Symmetric positive-definite matrices If is a symmetric (or Hermitian, if is complex) positive-definite matrix, we can arrange matters so that is the conjugate transpose of . That is, we can write as A = LL^*\,. This decomposition is called the Cholesky decomposition. If is positive definite, then the Cholesky decomposition 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. == Algorithms ==

Closed formula When an LDU factorization exists and is unique, there is a closed (explicit) formula for the elements of , , and in terms of ratios of determinants of certain submatrices of the original matrix . In particular, , and for , is the ratio of the -th principal submatrix to the -th principal submatrix. Computation of the determinants is computationally expensive, so this explicit formula is not used in practice. Using Gaussian elimination The following algorithm is essentially a modified form of Gaussian elimination. Computing an LU decomposition using this algorithm requires floating-point operations, ignoring lower-order terms. Partial pivoting adds only a quadratic term; this is not the case for full pivoting. Generalized explanation Notation Given an matrix {{nowrap|A = (a_{i,j})_{1 \leq i,j \leq N},}} define A^{(0)} as the original, unmodified version of the matrix . The parenthetical superscript (e.g., ) of the matrix is the version of the matrix. The matrix is the matrix in which the elements below the main diagonal have already been eliminated to 0 through Gaussian elimination for the first columns. Below is a matrix to observe to help us remember the notation (where each represents any real number in the matrix): A^{(n-1)} = \begin{pmatrix} * & & & \cdots & & & * \\ 0 & \ddots & & & & \\ & \ddots & * & & & \\ \vdots & & 0 & a_{n,n}^{(n-1)} & & & \vdots \\ & & \vdots & a_{i,n}^{(n-1)} & * \\ & & & \vdots & \vdots & \ddots \\ 0 & \cdots & 0 & a_{i,n}^{(n-1)} & * & \cdots & * \end{pmatrix} Procedure During this process, we gradually modify the matrix using row operations until it becomes the matrix in which all the elements below the main diagonal are equal to zero. During this, we will simultaneously create two separate matrices and , such that . We define the final permutation matrix as the identity matrix which has all the same rows swapped in the same order as the matrix while it transforms into the matrix . For our matrix , we may start by swapping rows to provide the desired conditions for the -th column. For example, we might swap rows to perform partial pivoting, or we might do it to set the pivot element on the main diagonal to a nonzero number so that we can complete the Gaussian elimination. For our matrix , we want to set every element below a_{n,n}^{(n-1)} to zero (where a_{n,n}^{(n-1)} is the element in the -th column of the main diagonal). We will denote each element below a_{n,n}^{(n-1)} as a_{i,n}^{(n-1)} (where ). To set a_{i,n}^{(n-1)} to zero, we set for each row . For this operation, {{nowrap|\ell_{i,n} := {a_{i,n}^{(n-1)}}/{a_{n,n}^{(n-1)}}.}} Once we have performed the row operations for the first columns, we have obtained an upper triangular matrix which is denoted by . We can also create the lower triangular matrix denoted as , by directly inputting the previously calculated values of via the formula below. L = \begin{pmatrix} 1 & 0 & \cdots & 0 \\ \ell_{2,1} & \ddots & \ddots & \vdots \\ \vdots & \ddots & \ddots & 0 \\ \ell_{N,1} & \cdots & \ell_{N,N-1} & 1 \end{pmatrix} Example If we are given the matrix A = \begin{pmatrix} 0 & 5 & \frac{22}{3} \\ 4 & 2 & 1 \\ 2 & 7 & 9 \\ \end{pmatrix}, we will choose to implement partial pivoting and thus swap the first and second row so that our matrix and the first iteration of our matrix respectively become A^{(0)}=\begin{pmatrix} 4 & 2 & 1 \\ 0 & 5 & \frac{22}{3} \\ 2 & 7 & 9 \\ \end{pmatrix},\quad P^{(0)}=\begin{pmatrix} 0 & 1 & 0 \\ 1 & 0 & 0 \\ 0 & 0 & 1 \\ \end{pmatrix}. Once we have swapped the rows, we can eliminate the elements below the main diagonal on the first column by performing \begin{alignat}{0} row_2=row_2-(\ell_{2,1})\cdot row_1 \\ row_3=row_3-(\ell_{3,1})\cdot row_1 \end{alignat} such that, \begin{alignat}{0} \ell_{2,1}= \frac{0}{4}=0 \\ \ell_{3,1}= \frac{2}{4}=0.5 \end{alignat} Once these rows have been subtracted, we have derived from the matrix A^{(1)}= \begin{pmatrix} 4 & 2 & 1 \\ 0 & 5 & \frac{22}{3} \\ 0 & 6 & 8.5 \\ \end{pmatrix}. Because we are implementing partial pivoting, we swap the second and third rows of our derived matrix and the current version of our matrix respectively to obtain A^{(1)}=\begin{pmatrix} 4 & 2 & 1 \\ 0 & 6 & 8.5 \\ 0 & 5 & \frac{22}{3} \\ \end{pmatrix}, \quad P^{(1)}=\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \\ \end{pmatrix}. Now, we eliminate the elements below the main diagonal on the second column by performing such that . Because no nonzero elements exist below the main diagonal in our current iteration of after this row subtraction, this row subtraction derives our final matrix (denoted as ) and final matrix: A^{(2)}=A^{(N-1)}=U=\begin{pmatrix} 4 & 2 & 1 \\ 0 & 6 & 8.5 \\ 0 & 0 & 0.25 \\ \end{pmatrix}, \quad P=\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \\ \end{pmatrix}. After also switching the corresponding rows, we obtain our final matrix: L = \begin{pmatrix} 1 & 0 & 0 \\ \ell_{3,1} & 1 & 0 \\ \ell_{2,1} & \ell_{3,2} & 1 \\ \end{pmatrix} = \begin{pmatrix} 1 & 0 & 0 \\ 0.5 & 1 & 0 \\ 0 & \frac{5}{6} & 1 \\ \end{pmatrix} Now these matrices have a relation such that . Relations when no rows are swapped If we did not swap rows at all during this process, we can perform the row operations simultaneously for each column by setting A^{(n)} := L^{-1}_n A^{(n-1)}, where L^{-1}_n is the identity matrix with its -th column replaced by the transposed vector . In other words, the lower triangular matrix L^{-1}_n = \begin{pmatrix} 1 & & & & & \\ & \ddots & & & & \\ & & 1 & & & \\ & & -\ell_{n+1,n} & & & \\ & & \vdots & & \ddots & \\ & & -\ell_{N,n} & & & 1 \end{pmatrix}. Performing all the row operations for the first columns using the A^{(n)} := L^{-1} _n A^{(n-1)} formula is equivalent to finding the decomposition A = L_1 L_1^{-1} A^{(0)} = L_1 A^{(1)} = L_1 L_2 L_2^{-1} A^{(1)} = L_1 L_2 A^{(2)} = \dotsm = L_1 \dotsm L_{N-1} A^{(N-1)}. Denote so that . Now let's compute the sequence of . We know that has the following formula: L_n = \begin{pmatrix} 1 & & & & & \\ & \ddots & & & & \\ & & 1 & & & \\ & & \ell_{n+1,n} & & & \\ & & \vdots & & \ddots & \\ & & \ell_{N,n} & & & 1 \end{pmatrix} If there are two lower triangular matrices with 1s in the main diagonal, and neither have a nonzero item below the main diagonal in the same column as the other, then we can include all nonzero items at their same location in the product of the two matrices. For example: \left(\begin{array}{ccccc} 1 & 0 & 0 & 0 & 0 \\ 77 & 1 & 0 & 0 & 0 \\ 12 & 0 & 1 & 0 & 0 \\ 63 & 0 & 0 & 1 & 0 \\ 7 & 0 & 0 & 0 & 1 \end{array}\right)\left(\begin{array}{ccccc} 1 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 \\ 0 & 22 & 1 & 0 & 0 \\ 0 & 33 & 0 & 1 & 0 \\ 0 & 44 & 0 & 0 & 1 \end{array}\right)=\left(\begin{array}{ccccc} 1 & 0 & 0 & 0 & 0 \\ 77 & 1 & 0 & 0 & 0 \\ 12 & 22 & 1 & 0 & 0 \\ 63 & 33 & 0 & 1 & 0 \\ 7 & 44 & 0 & 0 & 1 \end{array}\right) Finally, multiply together and generate the fused matrix denoted as (as previously mentioned). Using the matrix , we obtain . It is clear that in order for this algorithm to work, one needs to have a_{n,n}^{(n-1)} \neq 0 at each step (see the definition of . If this assumption fails at some point, one needs to interchange -th row with another row below it before continuing. This is why an LU decomposition in general looks like . LU Banachiewicz decomposition Although Banachiewicz (1938) LU decomposition algorithm preceded the advent of programmed electronic computers, it was ready made for direct implementation into code as index swapping, transpose and column by column multiplication remain native built capabilities of the most programming languages and they are handled by compilers alone with little delay of the actual execution. The peculiar matrix notation used by Banachiewicz enabled him to multiply matrices column by column, a convenient feature for mechanical calculations as he could reveal consecutive factors by sliding a ruler to next rows of matrices. For human readers however, his equations are best transformed into standard matrix notation. To obtain from a full matrix triangle matrices and calculations, start by copying top row and leftmost column of respectively into corresponding positions of matrices and . The known unit diagonal elements of are not stored nor used throughout the whole process. Next calculations continue for the subsequent rows and columns till the bottom right corner of . The figure illustrates calculations for 3rd row and column, assuming previous stages were already completed. Involved matrices are named above squares marking their content. Matrix products and subtractions are applied only to elements in the thick frame boxes. Green filled thin frame boxes indicate values already known, from previous stages. Blue boxes indicate places in and matrices for storing of results. Note that at each stage the result elements of need to be divided by the corresponding pivot element on the main diagonal of . This applies to the leftmost column of too. Note that after completion of 3rd stage the involved elements of matrix are no longer used and neither those from the previous stages. This enables replacement of these elements with the result values of and , i.e. execution of LU decomposition , so that the whole is replaced with and except for the unit diagonal of . Banachiewicz LU algorithm is well suited for partial pivoting by choosing the absolute maximum pivot from the newly calculated row of and subsequently swapping its columns so that it lands on the main diagonal. More details can be figured out from inspection of the enclosed Fortran90 code. All partial pivoting LU algorithms cost roughly the same amount, of order O\left({2\over3}n^3\right) operations, where is the number of rows or columns of . LU Crout decomposition Note that the decomposition obtained through this procedure is a '': the main diagonal of is composed solely of ones. If one would proceed by removing elements the main diagonal by adding multiples of the (instead of removing elements the diagonal by adding multiples of the ), we would obtain a Crout decomposition'', where the main diagonal of is of ones. Another (equivalent) way of producing a Crout decomposition of a given matrix is to obtain a Doolittle decomposition of the transpose of . Indeed, if is the LU-decomposition obtained through the algorithm presented in this section, then by taking and , we have that is a Crout decomposition. Randomized algorithm It is possible to find a low rank approximation to an LU decomposition using a randomized algorithm. Given an input matrix and a desired low rank , the randomized LU returns permutation matrices , and lower/upper trapezoidal matrices , of size and respectively, such that with high probability , where is a constant that depends on the parameters of the algorithm and is the -th singular value of the input matrix . Theoretical complexity If two matrices of order can be multiplied in time , where for some , then an LU-decomposition can be computed in time . This means, for example, that an algorithm exists based on the Coppersmith–Winograd algorithm. See also for fast matrix multiplication algorithms article for more details. Sparse-matrix decomposition Special algorithms have been developed for factorizing large sparse matrices. These algorithms attempt to find sparse factors and . 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 nonzero 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 A\mathbf x = \mathbf b, we want to solve the equation for , given and . Suppose we have already obtained the LUP decomposition of such that , so . In this case the solution is done in two logical steps: • First, we solve the equation for . • Second, we solve the equation for . In both cases we are dealing with triangular matrices ( and ), 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 . In this case it is faster (and more convenient) to do an LU decomposition of the matrix once and then solve the triangular matrices for the different , rather than using Gaussian elimination each time. The matrices and could be thought to have "encoded" the Gaussian elimination process. The cost of solving a system of linear equations is approximately floating-point operations if the matrix has size . This makes it twice as fast as algorithms based on QR decomposition, which costs about floating-point operations when Householder reflections are used. For this reason, LU decomposition is usually preferred. Inverting a matrix When solving systems of equations, is usually treated as a vector with a length equal to the height of matrix . In matrix inversion however, instead of vector , we have matrix , where is an matrix, so that we are trying to find a matrix (also a matrix): AX = LUX = B. We can use the same algorithm presented earlier to solve for each column of matrix . Now suppose that is the identity matrix of size , . It follows that the result must be the inverse of . Computing the determinant Given the LUP decomposition of a square matrix , the determinant of can be computed straightforwardly as \begin{align} \det(A) &= \det\left(P^{-1}\right) \det(L) \det(U) \\ &= (-1)^S \left( \prod_{i=1}^n l_{ii} \right) \left( \prod_{i=1}^n u_{ii} \right) . \end{align} 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 where is the number of row exchanges in the decomposition. In the case of LU decomposition with full pivoting, also equals the right-hand side of the above equation, if we let be the total number of row and column exchanges. The same method readily applies to LU decomposition by setting equal to the identity matrix. == History ==

The LU decomposition is related to elimination of linear systems of equations, as e.g. described by Ralston. The solution of linear equations in unknowns by elimination was already known to ancient Chinese. Before Gauss many mathematicians in Eurasia were performing and perfecting it yet as the method became relegated to school grade, few of them left any detailed descriptions. Thus the name Gaussian elimination is only a convenient abbreviation of a complex history. The Polish astronomer Tadeusz Banachiewicz introduced the LU decomposition in 1938. About Banachiewicz, Paul Dwyer stated: Banachiewicz was the first to consider elimination in terms of matrices and in this way formulated LU decomposition, as demonstrated by his graphic illustration. His calculations follow ordinary matrix ones, yet notation deviates in that he preferred to write one factor transposed, to be able to multiply them mechanically column by column, by sliding ruler down consecutive rows of both (using arithmometer). Combined with swapped order of indices his formulae in modern notation read \begin{align} {\mathbf x}\cdot IA'={\mathbf 0} &\rightarrow A'{\mathbf x=0}\equiv(A|{\mathbf l}){\mathbf x}, \\ A=G\cdot H &\rightarrow A^T=G^TH, \end{align} where ; ; refers to extended with the last column; and the last component of is . Matrix formulae to calculate rows and columns of LU factors by recursion are given in the remaining part of Banachiewicz's paper as Eq. (2.3) and (2.4) . This paper by Banachiewicz contains both derivation of and factors of respectively non-symmetric and symmetric matrices. They are sometimes confused as later publications tend to tie his name solely with the rediscovery of Cholesky decomposition. Banachiewicz himself can be excused of inaction as already next year he suffered from persecution by occupiers, spending three month in the Sachsenhausen Concentration Camp, on release from which he carried himself from a train his collaborator and co-prisoner Antoni Wilk, who died of exhaustion a week later. == Code examples ==

Fortran90 code example Module mlu Implicit None Integer, Parameter :: SP = Kind(1d0) ! set I/O real precision Private Public luban, lusolve Contains Subroutine luban (a, tol, g, h, ip, condinv, detnth) Real (SP), Intent (In) :: a (:, :)! input matrix A(m,n), n size(a, dim=1) .Or. n C code example /* 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 maxA) { maxA = absA; imax = k; } if (maxA = 0; i--) { for (int k = i + 1; k = 0; i--) { for (int k = i + 1; k C# code example 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 = 0; i--) { sum = 0; for (int k = i + 1; k MATLAB code example function LU = LUDecompDoolittle(A) n = length(A); LU = A; for k = 2:n for i = 1 : k-1 lamda = LU(k,i) / LU (i, i); LU(k,i) = lamda; LU(k,i+1:n) = LU(k,i+1:n) - LU(i,i+1:n) * lamda; end end end function x = SolveLinearSystem(LU, B) n = length(LU); y = zeros(size(B)); % find solution of Ly = B for i = 1:n y(i,:) = B(i,:) - LU(i,1:i)*y(1:i,:); end % find solution of Ux = y x = zeros(size(B)); for i = n:(-1):1 x(i,:) = (y(i,:) - LU(i,(i + 1):n)*x((i + 1):n,:))/LU(i, i); end end A = [ 4 3 3; 6 3 3; 3 4 3 ] LU = LUDecompDoolittle(A) B = [ 1 2 3; 4 5 6; 7 8 9; 10 11 12 ]' x = SolveLinearSystem(LU, B) A * x == See also ==