| |
|
| Table of contents |
|
2 Solving 3 Another method 4 Applications 5 Related articles |
The basic line of thought to get this upper and lower triangular matrix is as follows.
Using gaussian elimination on a matrix A we actually apply a number of elementary matrix transformations to obtain an upper triangular matrix U and then use back substitution to quickly solve the problem.
Suppose T is the product of all elementary transformations and applying it to A, this gives us:
Factorization
The gaussian elimination algorithm uses only the third form of the three elementary matrix transformations to make TA upper triangular. Using the properties of these elementary transformations, we calculate the inverse of T which shows us it is a lower triangular matrix L which can be added to the left and right side of the previous equation resulting in:
Once the upper and lower triangular matrices are known, solving this equation becomes very efficient as it can be split up into:
Here is a direct method for decomposing an matrix into the product of a lower triangular matrix and an upper triangular matrix ,
The matrices L and U can be used to calculate the matrix inverse. Computer implementations that invert matrices often use this approach.
Applications
Related articles