LU Decomposition.

Slides:



Advertisements
Similar presentations
Method If an nxn matrix A has an LU-factorization, then the solution of AX = b can be determined by a Forward substitution followed by a Back substitution.
Advertisements

E. T. S. I. Caminos, Canales y Puertos1 Engineering Computation Lecture 6.
Chapter 2 Solutions of Systems of Linear Equations / Matrix Inversion
4/22/ LU Decomposition Electrical Engineering Majors Authors: Autar Kaw Transforming.
4/26/ LU Decomposition Civil Engineering Majors Authors: Autar Kaw Transforming.
LU Factorization LU-factorization Matrix factorization Forward substitution Back substitution.
Major: All Engineering Majors Authors: Autar Kaw
SOLVING SYSTEMS OF LINEAR EQUATIONS. Overview A matrix consists of a rectangular array of elements represented by a single symbol (example: [A]). An individual.
Solution of linear system of equations
Linear Algebraic Equations
Linear Systems of Equations Ax = b Marco Lattuada Swiss Federal Institute of Technology - ETH Institut für Chemie und Bioingenieurwissenschaften ETH Hönggerberg/
Solving Linear Equations Rule 7 ‑ 1: We can perform any mathematical operation on one side of an equation, provided we perform the same operation on the.
Part 3 Chapter 10 LU Factorization PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill Companies,
LU method 1) factor (decompose) A into L and U 2) given b, determine d 3) using Ux=d and backsubstitution, solve for x Advantage: Once you have L and U,
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 17 Solution of Systems of Equations.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 10 LU Decomposition and Matrix.
Here is a preview of one type of problem we are going to solve using matrices. Solve this system of equations:
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 15 Solution of Systems of Equations.
Math for CSLecture 31 LU Decomposition Pivoting Diagonalization Gram-Shcmidt Orthogonalization Lecture 3.
Math for CSLecture 31 LU Decomposition Pivoting Diagonalization Gram-Shcmidt Orthogonalization Lecture 3.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 10 LU Decomposition and Matrix.
17 Jul 2007 KKKQ 3013 PENGIRAAN BERANGKA Week 2 – Systems of Linear Equations 17 July am – 9.00 am.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 18 LU Decomposition and Matrix Inversion.
Using Matrices to Solve a 3-Variable System
Chapter 8 Objectives Understanding matrix notation.
LU Decomposition 1. Introduction Another way of solving a system of equations is by using a factorization technique for matrices called LU decomposition.
Engineering Analysis ENG 3420 Fall 2009
Scientific Computing Linear Systems – LU Factorization.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Part 31 Linear.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Using LU Decomposition to Optimize the modconcen.m Routine Matt Tornowske April 1, 2002.
4.5 Solving Systems using Matrix Equations and Inverses.
Inverses and Systems Section Warm – up:
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 101.
13.6 MATRIX SOLUTION OF A LINEAR SYSTEM.  Examine the matrix equation below.  How would you solve for X?  In order to solve this type of equation,
Lecture 8 Matrix Inverse and LU Decomposition
MECN 3500 Inter - Bayamon Lecture 8 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
Simultaneous Linear Equations
1/18/ LU Decomposition Industrial Engineering Majors Authors: Autar Kaw Transforming.
3/1/ LU Decomposition Computer Engineering Majors Authors: Autar Kaw Transforming.
Autar Kaw Benjamin Rigsby Transforming Numerical Methods Education for STEM Undergraduates.
Linear Algebra Review Tuesday, September 7, 2010.
Numerical Methods.  LU Decomposition is another method to solve a set of simultaneous linear equations  For most non-singular matrix [A] that one could.
Numerical Computation Lecture 6: Linear Systems – part II United International College.
LU Decomposition ● In Gauss elimination; Forward elimination Backward substitution Major computational effort Low computational effort can be used for.
Part B. Linear Algebra, Vector Calculus
Simultaneous Linear Equations
Spring Dr. Jehad Al Dallal
Linear Equations.
Linear Algebra Lecture 15.
CHAPTER 9: GAUSSIAN ELIMINATION.
Chapter 10 and Matrix Inversion LU Decomposition
Chapter 10.
RECORD. RECORD Gaussian Elimination: derived system back-substitution.
Chemical Engineering Majors Authors: Autar Kaw
Metode Eliminasi Pertemuan – 4, 5, 6 Mata Kuliah : Analisis Numerik
Simultaneous Linear Equations
Find the inverse of the matrix
Use Inverse Matrices to Solve 2 Variable Linear Systems
Numerical Computation and Optimization
Part 3 Chapter 10 LU Factorization
Numerical Analysis Lecture10.
Simultaneous Linear Equations
Systems of Equations Solve by Graphing.
Major: All Engineering Majors Authors: Autar Kaw
Multivariable Linear Systems
Example 2B: Solving Linear Systems by Elimination
Lecture 8 Matrix Inverse and LU Decomposition
The Gauss Jordan method
Matrices and Linear Equations
Presentation transcript:

LU Decomposition

Solve A . x = b (system of linear equations) Decompose A = L . U * L : Lower Triangular Matrix U : Upper Triangular Matrix

[L][U]=[A]  [L][U]{x}={b} To solve [A]{x}={b} [L][U]=[A]  [L][U]{x}={b} Consider [U]{x}={d} [L]{d}={b} Solve [L]{d}={b} using forward substitution to get {d} Use back substitution to solve [U]{x}={d} to get {x}

[ L ] [ U ]

[ U ] Gauss Elimination   Coefficients used during the elimination step

[ L . U ]

[ L ] [ U ] Example: A = L . U Gauss Elimination Coefficients

Using the Forward Elimination Procedure of Gauss Elimination Finding the [U] matrix Using the Forward Elimination Procedure of Gauss Elimination Step 1: http://numericalmethods.eng.usf.edu

Finding the [U] Matrix Matrix after Step 1: Step 2: http://numericalmethods.eng.usf.edu

Using the multipliers used during the Forward Elimination Procedure Finding the [L] matrix Using the multipliers used during the Forward Elimination Procedure From the first step of forward elimination http://numericalmethods.eng.usf.edu

Finding the [L] Matrix From the second step of forward elimination http://numericalmethods.eng.usf.edu

Does [L][U] = [A]? ? http://numericalmethods.eng.usf.edu

Example Set [L][Z] = [C] Solve for [Z] http://numericalmethods.eng.usf.edu

Example Complete the forward substitution to solve for [Z] http://numericalmethods.eng.usf.edu

Example Math 685/CSI 700 Spring 08 George Mason University, Department of Mathematical Sciences

LU decomposition Gauss Elimination can be used to decompose [A] into [L] and [U]. Therefore, it requires the same total FLOPs as for Gauss elimination: In the order of (proportional to) N3 where N is the # of unknowns. lij values (the factors generated during the elimination step) can be stored in the lower part of the matrix to save storage. This can be done because these are converted to zeros anyway and unnecessary for the future operations. Saves computing time by separating time-consuming elimination step from the manipulations of the right hand side. Provides efficient means to compute the matrix inverse