SlideShare a Scribd company logo
1 of 20
LU Decomposition
1
Introduction
• LU Decomposition is another method to solve a set of simultaneous linear
equations.
• For most non-singular matrix [A] that one could conduct Naïve Gauss
Elimination forward elimination steps, one can always write it as
[A] = [L][U]
where
[L] = lower triangular matrix
[U] = upper triangular matrix
2
Method: [A] Decomposes to [L] and [U]
3
    






















33
23
22
13
12
11
32
31
21
0
0
0
1
0
1
0
0
1
u
u
u
u
u
u
U
L
A



• [U] is the same as the coefficient matrix at the end of the forward
elimination step.
• [L] is obtained using the multipliers that were used in the forward
elimination process
Finding the [U] matrix
Using the Forward Elimination Procedure of Gauss Elimination
1
12
144
1
8
64
1
5
25










 
1
12
144
56
.
1
8
.
4
0
1
5
25
56
.
2
1
2
;
56
.
2
25
64














 Row
Row
 
76
.
4
8
.
16
0
56
.
1
8
.
4
0
1
5
25
76
.
5
1
3
;
76
.
5
25
144
















 Row
Row
Step 1:
Finding the [U] Matrix
Step 2:














76
.
4
8
.
16
0
56
.
1
8
.
4
0
1
5
25
 
7
.
0
0
0
56
.
1
8
.
4
0
1
5
25
5
.
3
2
3
;
5
.
3
8
.
4
8
.
16

















Row
Row
 













7
.
0
0
0
56
.
1
8
.
4
0
1
5
25
U
Matrix after Step 1:
Finding the [L] matrix
Using the multipliers used during the Forward Elimination Procedure










1
0
1
0
0
1
32
31
21



56
.
2
25
64
11
21
21 


a
a

76
.
5
25
144
11
31
31 


a
a

From the first step
of forward
elimination
1
12
144
1
8
64
1
5
25










Finding the [L] Matrix
 











1
5
.
3
76
.
5
0
1
56
.
2
0
0
1
L
From the second
step of forward
elimination














76
.
4
8
.
16
0
56
.
1
8
.
4
0
1
5
25
5
.
3
8
.
4
8
.
16
22
32
32 




a
a

Does [L][U] = [A]?
   























7
.
0
0
0
56
.
1
8
.
4
0
1
5
25
1
5
.
3
76
.
5
0
1
56
.
2
0
0
1
U
L
?
Using LU Decomposition to solve SLEs
Solve the following set of
linear equations using LU
Decomposition































2
279
2
177
8
106
1
12
144
1
8
64
1
5
25
3
2
1
.
.
.
x
x
x
Using the procedure for finding the [L] and [U] matrices
    
























7
.
0
0
0
56
.
1
8
.
4
0
1
5
25
1
5
.
3
76
.
5
0
1
56
.
2
0
0
1
U
L
A
Example
Set [L][D] = [B]
Solve for [D]































2
.
279
2
.
177
8
.
106
1
5
.
3
76
.
5
0
1
56
.
2
0
0
1
3
2
1
d
d
d
2
.
279
5
.
3
76
.
5
2
.
177
56
.
2
8
.
106
3
2
1
2
1
1






d
d
d
d
d
d
Example
Complete the forward substitution to solve for [D]
 
   
735
.
0
21
.
96
5
.
3
8
.
106
76
.
5
2
.
279
5
.
3
76
.
5
2
.
279
2
.
96
8
.
106
56
.
2
2
.
177
56
.
2
2
.
177
8
.
106
2
1
3
1
2
1















d
d
d
d
d
d
 























735
.
0
21
.
96
8
.
106
3
2
1
d
d
d
D
Example
Set [U][X] = [D]
Solve for [X] The 3 equations become


































735
0
21
96
8
106
7
.
0
0
0
56
.
1
8
.
4
0
1
5
25
3
2
1
.
.
.
x
x
x
735
.
0
7
.
0
21
.
96
56
.
1
8
.
4
8
.
106
5
25
3
3
2
3
2
1








x
x
x
x
x
x
Example
From the 3rd equation
050
1
7
0
735
0
735
0
7
0
3
3
3
.
x
.
.
x
.
x
.



Substituting in x3 and using the
second equation
21
96
56
1
8
4 3
2 .
x
.
x
. 



 
70
19
8
4
050
1
56
1
21
96
8
4
56
1
21
96
2
2
3
2
.
x
.
.
.
.
x
.
a
.
.
x









Example
Substituting in x3 and x2 using
the first equation
8
106
5
25 3
2
1 .
x
x
x 


Hence the Solution Vector is:





















050
.
1
70
.
19
2900
.
0
3
2
1
x
x
x
 
2900
0
25
050
1
70
19
5
8
106
25
5
8
106 3
2
1
.
.
.
.
x
x
.
x







Overview of LU Decomposition
15
Example
Solve the following set of
linear equations using LU
Decomposition




















3
2
1
9
8
7
6
5
4
3
2
1
x
x
x
Using LU Decomposition to solve SLEs
    
























0
0
0
6
3
0
3
2
1
1
2
7
0
1
4
0
0
1
U
L
A
Example
• Find an LU decomposition for the following example:
y1+2y2=2
3y1+6y2-y3=8
y1+2y2+y3=0
18
Solution
Solve the following set of
linear equations using LU
Decomposition
Using the procedure for finding the [L] and [U] matrices
    
























0
0
0
1
0
0
0
2
1
1
1
1
0
1
3
0
0
1
U
L
A
Thank You!
20

More Related Content

Similar to 07. LU Decomposition.pptx

Solution of System of Linear Equations
Solution of System of Linear EquationsSolution of System of Linear Equations
Solution of System of Linear Equations
mofassair
 
Matrix-Decomposition-and-Its-application-in-Statistics_NK.ppt
Matrix-Decomposition-and-Its-application-in-Statistics_NK.pptMatrix-Decomposition-and-Its-application-in-Statistics_NK.ppt
Matrix-Decomposition-and-Its-application-in-Statistics_NK.ppt
poojaacharya578
 
Electrical circuits in concept of linear algebra
Electrical circuits in concept of linear algebraElectrical circuits in concept of linear algebra
Electrical circuits in concept of linear algebra
Rajesh Kumar
 
MMAC presentation 16_09_20_20_41.pptx
MMAC presentation 16_09_20_20_41.pptxMMAC presentation 16_09_20_20_41.pptx
MMAC presentation 16_09_20_20_41.pptx
Juber33
 

Similar to 07. LU Decomposition.pptx (20)

Linear and non linear equation
Linear and non linear equationLinear and non linear equation
Linear and non linear equation
 
Unit 3-Laplace Transforms.pdf
Unit 3-Laplace Transforms.pdfUnit 3-Laplace Transforms.pdf
Unit 3-Laplace Transforms.pdf
 
Solution of System of Linear Equations
Solution of System of Linear EquationsSolution of System of Linear Equations
Solution of System of Linear Equations
 
Coueete project
Coueete projectCoueete project
Coueete project
 
algebra
algebraalgebra
algebra
 
Matrix-Decomposition-and-Its-application-in-Statistics_NK.ppt
Matrix-Decomposition-and-Its-application-in-Statistics_NK.pptMatrix-Decomposition-and-Its-application-in-Statistics_NK.ppt
Matrix-Decomposition-and-Its-application-in-Statistics_NK.ppt
 
Chapter 4
Chapter 4Chapter 4
Chapter 4
 
final sci lab.pptx
final sci lab.pptxfinal sci lab.pptx
final sci lab.pptx
 
Gaussian
GaussianGaussian
Gaussian
 
Ch08 1
Ch08 1Ch08 1
Ch08 1
 
Es272 ch4b
Es272 ch4bEs272 ch4b
Es272 ch4b
 
Episode 50 : Simulation Problem Solution Approaches Convergence Techniques S...
Episode 50 :  Simulation Problem Solution Approaches Convergence Techniques S...Episode 50 :  Simulation Problem Solution Approaches Convergence Techniques S...
Episode 50 : Simulation Problem Solution Approaches Convergence Techniques S...
 
Applied numerical methods lec6
Applied numerical methods lec6Applied numerical methods lec6
Applied numerical methods lec6
 
Electrical circuits in concept of linear algebra
Electrical circuits in concept of linear algebraElectrical circuits in concept of linear algebra
Electrical circuits in concept of linear algebra
 
Initial value problems
Initial value problemsInitial value problems
Initial value problems
 
ge.ppt
ge.pptge.ppt
ge.ppt
 
solution for 2D truss1
solution for 2D truss1solution for 2D truss1
solution for 2D truss1
 
Determinants. Cramer’s Rule
Determinants. Cramer’s RuleDeterminants. Cramer’s Rule
Determinants. Cramer’s Rule
 
Gauss Jorden and Gauss Elimination method.pptx
Gauss Jorden and Gauss Elimination method.pptxGauss Jorden and Gauss Elimination method.pptx
Gauss Jorden and Gauss Elimination method.pptx
 
MMAC presentation 16_09_20_20_41.pptx
MMAC presentation 16_09_20_20_41.pptxMMAC presentation 16_09_20_20_41.pptx
MMAC presentation 16_09_20_20_41.pptx
 

More from kibriaswe (7)

06. Gaussian Elimination.pptx
06. Gaussian Elimination.pptx06. Gaussian Elimination.pptx
06. Gaussian Elimination.pptx
 
webpresentation.pptx
webpresentation.pptxwebpresentation.pptx
webpresentation.pptx
 
E-learning_3.0(1).pptx
E-learning_3.0(1).pptxE-learning_3.0(1).pptx
E-learning_3.0(1).pptx
 
Decision Tree.pptx
Decision Tree.pptxDecision Tree.pptx
Decision Tree.pptx
 
K MEANS CLUSTERING.pptx
K MEANS CLUSTERING.pptxK MEANS CLUSTERING.pptx
K MEANS CLUSTERING.pptx
 
K MEANS CLUSTERING (1).pptx
K MEANS CLUSTERING (1).pptxK MEANS CLUSTERING (1).pptx
K MEANS CLUSTERING (1).pptx
 
KNN(K NEAREST NEIGHBOURS).pptx
KNN(K NEAREST NEIGHBOURS).pptxKNN(K NEAREST NEIGHBOURS).pptx
KNN(K NEAREST NEIGHBOURS).pptx
 

Recently uploaded

Integrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - NeometrixIntegrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - Neometrix
Neometrix_Engineering_Pvt_Ltd
 
Call Girls in South Ex (delhi) call me [🔝9953056974🔝] escort service 24X7
Call Girls in South Ex (delhi) call me [🔝9953056974🔝] escort service 24X7Call Girls in South Ex (delhi) call me [🔝9953056974🔝] escort service 24X7
Call Girls in South Ex (delhi) call me [🔝9953056974🔝] escort service 24X7
9953056974 Low Rate Call Girls In Saket, Delhi NCR
 
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
ssuser89054b
 
DeepFakes presentation : brief idea of DeepFakes
DeepFakes presentation : brief idea of DeepFakesDeepFakes presentation : brief idea of DeepFakes
DeepFakes presentation : brief idea of DeepFakes
MayuraD1
 

Recently uploaded (20)

Work-Permit-Receiver-in-Saudi-Aramco.pptx
Work-Permit-Receiver-in-Saudi-Aramco.pptxWork-Permit-Receiver-in-Saudi-Aramco.pptx
Work-Permit-Receiver-in-Saudi-Aramco.pptx
 
Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...
Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...
Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...
 
Moment Distribution Method For Btech Civil
Moment Distribution Method For Btech CivilMoment Distribution Method For Btech Civil
Moment Distribution Method For Btech Civil
 
Integrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - NeometrixIntegrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - Neometrix
 
data_management_and _data_science_cheat_sheet.pdf
data_management_and _data_science_cheat_sheet.pdfdata_management_and _data_science_cheat_sheet.pdf
data_management_and _data_science_cheat_sheet.pdf
 
Engineering Drawing focus on projection of planes
Engineering Drawing focus on projection of planesEngineering Drawing focus on projection of planes
Engineering Drawing focus on projection of planes
 
Call Girls in South Ex (delhi) call me [🔝9953056974🔝] escort service 24X7
Call Girls in South Ex (delhi) call me [🔝9953056974🔝] escort service 24X7Call Girls in South Ex (delhi) call me [🔝9953056974🔝] escort service 24X7
Call Girls in South Ex (delhi) call me [🔝9953056974🔝] escort service 24X7
 
COST-EFFETIVE and Energy Efficient BUILDINGS ptx
COST-EFFETIVE  and Energy Efficient BUILDINGS ptxCOST-EFFETIVE  and Energy Efficient BUILDINGS ptx
COST-EFFETIVE and Energy Efficient BUILDINGS ptx
 
PE 459 LECTURE 2- natural gas basic concepts and properties
PE 459 LECTURE 2- natural gas basic concepts and propertiesPE 459 LECTURE 2- natural gas basic concepts and properties
PE 459 LECTURE 2- natural gas basic concepts and properties
 
FEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced Loads
FEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced LoadsFEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced Loads
FEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced Loads
 
HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx
HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptxHOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx
HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx
 
Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptx
Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptxOrlando’s Arnold Palmer Hospital Layout Strategy-1.pptx
Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptx
 
kiln thermal load.pptx kiln tgermal load
kiln thermal load.pptx kiln tgermal loadkiln thermal load.pptx kiln tgermal load
kiln thermal load.pptx kiln tgermal load
 
Unleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leapUnleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leap
 
Navigating Complexity: The Role of Trusted Partners and VIAS3D in Dassault Sy...
Navigating Complexity: The Role of Trusted Partners and VIAS3D in Dassault Sy...Navigating Complexity: The Role of Trusted Partners and VIAS3D in Dassault Sy...
Navigating Complexity: The Role of Trusted Partners and VIAS3D in Dassault Sy...
 
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
 
DeepFakes presentation : brief idea of DeepFakes
DeepFakes presentation : brief idea of DeepFakesDeepFakes presentation : brief idea of DeepFakes
DeepFakes presentation : brief idea of DeepFakes
 
Employee leave management system project.
Employee leave management system project.Employee leave management system project.
Employee leave management system project.
 
Computer Lecture 01.pptxIntroduction to Computers
Computer Lecture 01.pptxIntroduction to ComputersComputer Lecture 01.pptxIntroduction to Computers
Computer Lecture 01.pptxIntroduction to Computers
 
AIRCANVAS[1].pdf mini project for btech students
AIRCANVAS[1].pdf mini project for btech studentsAIRCANVAS[1].pdf mini project for btech students
AIRCANVAS[1].pdf mini project for btech students
 

07. LU Decomposition.pptx

  • 2. Introduction • LU Decomposition is another method to solve a set of simultaneous linear equations. • For most non-singular matrix [A] that one could conduct Naïve Gauss Elimination forward elimination steps, one can always write it as [A] = [L][U] where [L] = lower triangular matrix [U] = upper triangular matrix 2
  • 3. Method: [A] Decomposes to [L] and [U] 3                            33 23 22 13 12 11 32 31 21 0 0 0 1 0 1 0 0 1 u u u u u u U L A    • [U] is the same as the coefficient matrix at the end of the forward elimination step. • [L] is obtained using the multipliers that were used in the forward elimination process
  • 4. Finding the [U] matrix Using the Forward Elimination Procedure of Gauss Elimination 1 12 144 1 8 64 1 5 25             1 12 144 56 . 1 8 . 4 0 1 5 25 56 . 2 1 2 ; 56 . 2 25 64                Row Row   76 . 4 8 . 16 0 56 . 1 8 . 4 0 1 5 25 76 . 5 1 3 ; 76 . 5 25 144                  Row Row Step 1:
  • 5. Finding the [U] Matrix Step 2:               76 . 4 8 . 16 0 56 . 1 8 . 4 0 1 5 25   7 . 0 0 0 56 . 1 8 . 4 0 1 5 25 5 . 3 2 3 ; 5 . 3 8 . 4 8 . 16                  Row Row                7 . 0 0 0 56 . 1 8 . 4 0 1 5 25 U Matrix after Step 1:
  • 6. Finding the [L] matrix Using the multipliers used during the Forward Elimination Procedure           1 0 1 0 0 1 32 31 21    56 . 2 25 64 11 21 21    a a  76 . 5 25 144 11 31 31    a a  From the first step of forward elimination 1 12 144 1 8 64 1 5 25          
  • 7. Finding the [L] Matrix              1 5 . 3 76 . 5 0 1 56 . 2 0 0 1 L From the second step of forward elimination               76 . 4 8 . 16 0 56 . 1 8 . 4 0 1 5 25 5 . 3 8 . 4 8 . 16 22 32 32      a a 
  • 8. Does [L][U] = [A]?                            7 . 0 0 0 56 . 1 8 . 4 0 1 5 25 1 5 . 3 76 . 5 0 1 56 . 2 0 0 1 U L ?
  • 9. Using LU Decomposition to solve SLEs Solve the following set of linear equations using LU Decomposition                                2 279 2 177 8 106 1 12 144 1 8 64 1 5 25 3 2 1 . . . x x x Using the procedure for finding the [L] and [U] matrices                              7 . 0 0 0 56 . 1 8 . 4 0 1 5 25 1 5 . 3 76 . 5 0 1 56 . 2 0 0 1 U L A
  • 10. Example Set [L][D] = [B] Solve for [D]                                2 . 279 2 . 177 8 . 106 1 5 . 3 76 . 5 0 1 56 . 2 0 0 1 3 2 1 d d d 2 . 279 5 . 3 76 . 5 2 . 177 56 . 2 8 . 106 3 2 1 2 1 1       d d d d d d
  • 11. Example Complete the forward substitution to solve for [D]       735 . 0 21 . 96 5 . 3 8 . 106 76 . 5 2 . 279 5 . 3 76 . 5 2 . 279 2 . 96 8 . 106 56 . 2 2 . 177 56 . 2 2 . 177 8 . 106 2 1 3 1 2 1                d d d d d d                          735 . 0 21 . 96 8 . 106 3 2 1 d d d D
  • 12. Example Set [U][X] = [D] Solve for [X] The 3 equations become                                   735 0 21 96 8 106 7 . 0 0 0 56 . 1 8 . 4 0 1 5 25 3 2 1 . . . x x x 735 . 0 7 . 0 21 . 96 56 . 1 8 . 4 8 . 106 5 25 3 3 2 3 2 1         x x x x x x
  • 13. Example From the 3rd equation 050 1 7 0 735 0 735 0 7 0 3 3 3 . x . . x . x .    Substituting in x3 and using the second equation 21 96 56 1 8 4 3 2 . x . x .       70 19 8 4 050 1 56 1 21 96 8 4 56 1 21 96 2 2 3 2 . x . . . . x . a . . x         
  • 14. Example Substituting in x3 and x2 using the first equation 8 106 5 25 3 2 1 . x x x    Hence the Solution Vector is:                      050 . 1 70 . 19 2900 . 0 3 2 1 x x x   2900 0 25 050 1 70 19 5 8 106 25 5 8 106 3 2 1 . . . . x x . x       
  • 15. Overview of LU Decomposition 15
  • 16. Example Solve the following set of linear equations using LU Decomposition                     3 2 1 9 8 7 6 5 4 3 2 1 x x x
  • 17. Using LU Decomposition to solve SLEs                              0 0 0 6 3 0 3 2 1 1 2 7 0 1 4 0 0 1 U L A
  • 18. Example • Find an LU decomposition for the following example: y1+2y2=2 3y1+6y2-y3=8 y1+2y2+y3=0 18
  • 19. Solution Solve the following set of linear equations using LU Decomposition Using the procedure for finding the [L] and [U] matrices                              0 0 0 1 0 0 0 2 1 1 1 1 0 1 3 0 0 1 U L A