3
$\begingroup$

The first question: what is the proof that LU factorization of matrix is unique? Or am I mistaken?

The second question is, how can theentries of L below the main diagonal be obtained from the matrix $A$ and $A_1$ that results from the row echelon reduction to $U$? ($A=LU$)

  • 2
    Note that an $LU$ decomposition does not always _exist_: for instance among permutation matrices, only the identity matrices have an $LU$ decomposition. _If_ an $LU$ decomposition exists it can be made unique by requiring diagonal entries $1$ for (say) $L$; however if a permutation matrix is thrown into the mix, (e.g. $LUP$) then uniqueness is no longer possible. The general notion is [Bruhat decomposition](http://en.wikipedia.org/wiki/Bruhat_decomposition), which at the element level is not unique.2012-08-21

2 Answers 2

2

The factorisation is not unique. There are $n^2+n$ coefficients to estimate and only $n^2$ "equations". As such, that is why there are the two "common" methods, Doolittle and Crout see wiki page. For each of these two approaches, you can show that the resulting linear system has a unique solution.

  • 0
    Edited! For some reason I had $3\times3$ matrices in my brain...2012-08-21