Professional Documents
Culture Documents
INTRODUCTION:
LU decomposition is a method to solve a system of
linear equations by converting the coefficient matrix
as a product of a lower triangular matrix(L) and a
upper triangular matrix(U).
PROCESS:
25 5 1 x1 106.8
64 8 1 x 177.2
2
144 12 1 x3 279.2
25 5 1
64 8 1
144 12 1
Step-1:
25 5 1
64
2.56; Row2 Row1 2.56 0 4.8 1.56
25
144 12 1
25 5 1
144
5.76; Row3 Row1 5.76 0 4.8 1.56
25
0 16.8 4.76
Step -2:
25 5 1
16.8
3.5; Row3 Row2 3.5 0 4.8 1.56
4. 8
0 0 0.7
25 5 1
U 0 4.8 1.56
0 0 0.7
FINDING THE [L] MATRIX
Let L matrix is
1 0 0
0
21 1
31 32 1
25 5 1 a 21 64
From the first step of 64 8 1 21 2.56
a11 25
forward elimination
144 12 1
a 31 144
31 5.76
a11 25
From the second
step of forward
elimination
25 5 1
0 4.8 1.56 a 32 16.8
32 3.5
a 22 4.8
0 16.8 4.76
1 0 0
L 2.56 1 0
5.76 3.5 1
USING LU DECOMPOSITION TO SOLVE THE SLES
NOW:
1 0 0 25 5 1
A LU 2.56 1 0 0 4.8 1.56
5.76 3.5 1 0 0 0.7
z1 10
2.56 z1 z2 177.2
5.76 z1 3.5 z 2 z3 279.2
z1 106.8
z 2 177.2 2.56 z1
177.2 2.56106.8
96.2
z3 279.2 5.76 z1 3.5 z 2
279.2 5.76106.8 3.5 96.21
0.735
z1 106.8
Hence Z z2 96.21
z3 0.735
25 5 1 x1 106.8
0 4.8 1.56 x 96.21
2
0 0 0.7 x3 0.735
Solve for [X]
96.21 1.56a3
a2
4.8
96.21 1.561.050
a2
4.8
a2 19.70
Substituting in a3 and a2 using the first equation
106.8 5a2 a3
a1
25
106.8 519.70 1.050
25
0.2900
A = [L][*L]T
REFERENCES:-
https://
www.sciencedirect.com/topics/engineering/cholesky
-decomposition
http://numericalmethods.eng.usf.edu
THANK YOU