LU Decomposition: Solving for A

  • Thread starter Thread starter dirk_mec1
  • Start date Start date
  • Tags Tags
    Decomposition
Physics news on Phys.org
Suppose we have two different LU decompositions, A = LU and A=L'U'. Because A is non-singular L, U, L' and U' are all non-singular and invertible. This implies that U = L^{-1}L'U'. Now you should be able to show that I = L^{-1}L' in order to preserve upper-triangularity.
 
cellotim said:
Suppose we have two different LU decompositions, A = LU and A=L'U'. Because A is non-singular L, U, L' and U' are all non-singular and invertible. This implies that U = L^{-1}L'U'.
Aha, very smart!

Now you should be able to show that I = L^{-1}L' in order to preserve upper-triangularity.
Well...from my instructors note the L is defined in a product of M-matrices(see picture) but if that's the case then L and L' have different M's (for we presume L and L' to be different).

If I invert a upper triangular matrix it remains upper triangular so I don't see what you mean by "preserving upper-triangularity".
 
The M's are not necessary as far as I can see only that L and L' are lower-triangular and U and U' are upper-triangular, and I mean preserve upper-triangularity of U' to U.
 
cellotim said:
The M's are not necessary as far as I can see only that L and L' are lower-triangular and U and U' are upper-triangular, and I mean preserve upper-triangularity of U' to U.

So to preserve upper triangularity of U w.r.t. U' L-1 L' should be I?
 
It needs to be diagonal. It remains to prove that that diagonal matrix must be the identity.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top