Numerical Methods.  LU Decomposition is another method to solve a set of simultaneous linear equations  For most non-singular matrix [A] that one could.

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

LU Factorization.
4/22/ LU Decomposition Electrical Engineering Majors Authors: Autar Kaw Transforming.
4/26/ LU Decomposition Civil Engineering Majors Authors: Autar Kaw Transforming.
Chapter 8 Numerical Technique 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
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.
Lecture 9: Introduction to Matrix Inversion Gaussian Elimination Sections 2.4, 2.5, 2.6 Sections 2.2.3, 2.3.
Chapter 9.1 = LU Decomposition MATH 264 Linear Algebra.
Lecture 11 - LU Decomposition
Linear Algebraic Equations
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.
ECIV 520 Structural Analysis II Review of Matrix Algebra.
Ordinary least squares regression (OLS)
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.
Copyright © Cengage Learning. All rights reserved. 7.6 The Inverse of a Square Matrix.
Major: All Engineering Majors Author(s): Autar Kaw
LU Decomposition 1. Introduction Another way of solving a system of equations is by using a factorization technique for matrices called LU decomposition.
Scientific Computing Linear Systems – LU Factorization.
Chap. 2 Matrices 2.1 Operations with Matrices
F UNDAMENTALS OF E NGINEERING A NALYSIS Eng. Hassan S. Migdadi Inverse of Matrix. Gauss-Jordan Elimination Part 1.
Copyright © 2009 Pearson Education, Inc. CHAPTER 9: Systems of Equations and Matrices 9.1 Systems of Equations in Two Variables 9.2 Systems of Equations.
Chapter 9 Matrices and Determinants Copyright © 2014, 2010, 2007 Pearson Education, Inc Multiplicative Inverses of Matrices and Matrix Equations.
Ch X 2 Matrices, Determinants, and Inverses.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Chapter 3 Solution of Algebraic Equations 1 ChE 401: Computational Techniques for Chemical Engineers Fall 2009/2010 DRAFT SLIDES.
Lecture 8 Matrix Inverse and LU Decomposition
Chapter 6 Systems of Linear Equations and Matrices Sections 6.3 – 6.5.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
1/18/ LU Decomposition Industrial Engineering Majors Authors: Autar Kaw Transforming.
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
3/1/ LU Decomposition Computer Engineering Majors Authors: Autar Kaw Transforming.
Unit #1 Linear Systems Fall Dr. Jehad Al Dallal.
Autar Kaw Benjamin Rigsby Transforming Numerical Methods Education for STEM Undergraduates.
2 - 1 Chapter 2A Matrices 2A.1 Definition, and Operations of Matrices: 1 Sums and Scalar Products; 2 Matrix Multiplication 2A.2 Properties of Matrix Operations;
Numerical Computation Lecture 6: Linear Systems – part II United International College.
Copyright © Cengage Learning. All rights reserved. 8 Matrices and Determinants.
LU Decomposition ● In Gauss elimination; Forward elimination Backward substitution Major computational effort Low computational effort can be used for.
College Algebra Chapter 6 Matrices and Determinants and Applications
Chapter 8 Numerical Technique
Lecture 2 Matrices Lat Time - Course Overview
Simultaneous Linear Equations
Spring Dr. Jehad Al Dallal
Finding the Inverse of a Matrix
Linear Equations.
Linear Algebra Lecture 15.
Chapter 10 and Matrix Inversion LU Decomposition
Matrix Algebra.
Major: All Engineering Majors Authors: Autar Kaw
Substitution, Elimination, Graphing, Matrices
Chemical Engineering Majors Authors: Autar Kaw
Multiplicative Inverses of Matrices and Matrix Equations
Major: All Engineering Majors Author(s): Autar Kaw
Numerical Computation and Optimization
Numerical Analysis Lecture10.
Section 9.5 Inverses of Matrices
ARRAY DIVISION Identity matrix Islamic University of Gaza
Matrix Algebra.
Simultaneous Linear Equations
Major: All Engineering Majors Authors: Autar Kaw
LU Decomposition.
Lecture 8 Matrix Inverse and LU Decomposition
Linear Systems of Equations: solution and applications
Solving Linear Systems of Equations - Inverse Matrix
Major: All Engineering Majors Authors: Autar Kaw
Presentation transcript:

Numerical Methods

 LU Decomposition is another method to solve a set of simultaneous linear equations  For most non-singular matrix [A] that one could conduct Gauss Elimination forward elimination steps, one can always write it as [A] = [L][U] where [L] = lower triangular matrix [U] = upper triangular matrix

If solving a set of linear equations If [A] = [L][U] then Multiply by Which gives Remember [L] -1 [L] = [I] which leads to Now, if [I][U] = [U] then Now, let Which ends with and [A][X] = [C] [L][U][X] = [C] [L] -1 [L] -1 [L][U][X] = [L] -1 [C] [I][U][X] = [L] -1 [C] [U][X] = [L] -1 [C] [L] -1 [C]=[Z] [L][Z] = [C] (1) [U][X] = [Z] (2)

Given [A][X] = [C] 1.Decompose [A] into [L] and [U] 2.Solve [L][Z] = [C] for [Z] 3.Solve [U][X] = [Z] for [X]

[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

Using the Forward Elimination Procedure of Gauss Elimination (without partial pivoting technique) Step 1:

Step 2: Matrix after Step 1:

Using the multipliers used during the Forward Elimination Procedure From the first step of forward elimination

From the second step of forward elimination

?

Solve the following set of linear equations using LU Decomposition Using the procedure for finding the [L] and [U] matrices

Set [L][Z] = [C] Solve for [Z]

Set [U][X] = [Z] Solve for [X]

The inverse [B] of a square matrix [A] is defined as [A][B] = [I] = [B][A]

How can LU Decomposition be used to find the inverse? Assume the first column of [B] to be [b 11 b 12 … b n1 ] T Using this and the definition of matrix multiplication First column of [B] Second column of [B] The remaining columns in [B] can be found in the same manner

Find the inverse of a square matrix [A] Using the decomposition procedure, the [L] and [U] matrices are found to be

Solving for the each column of [B] requires two steps 1)Solve [L] [Z] = [C] for [Z] 2)Solve [U] [X] = [Z] for [X] Step 1: This generates the equations:

Solving [U][X] = [Z] for [X]

Repeating for the second and third columns of the inverse Second ColumnThird Column

The inverse of [A] is To check your work do the following operation [ A ][ A ] -1 = [ I ] = [ A ] -1 [ A ]

Thanks