Loading in 5 sec....

Chapter 9.1 = LU DecompositionPowerPoint Presentation

Chapter 9.1 = LU Decomposition

- 100 Views
- Uploaded on
- Presentation posted in: General

Download Presentation
## PowerPoint Slideshow about 'Chapter 9.1 = LU Decomposition ' - kale

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

Introduction:

- LU Decomposition is very useful when we have large matrices n x n and if we use gauss-jordan or the other methods, we can get errors.
- Computers use this method because of roundoff errors, memory usage, and speed concerns

Method of LU Decomposition:

- Rewrite the system Ax = b as LUx = b
- Define a new n x 1 matrix y by Ux = y
- Use Ux = y to rewrite LUx = b as Ly = b and solve the system for y
- Substitute y in Ux = y and solve for x

Explanation on the method

This procedure replaces the single linear system ax = b by a pair of linear systems

that must be solved in succession.However, since each of these systems has a triangular coefficient matrix, it generally turns out to involve no more computation to solve the two systems than to solve the original system directly.

Finding LU Decompositions

- The previous example shows that once an LU-decomposition of A is obtained, a linear system Ax = b can be solved by one forward substitution and one backward substitution.
- The main advantage of this method over Gaussian and Gauss-Jordan elimination is that it “decouples” Afrom b so that for solveing a linear systems with same coefficient matrix A the work in factoring that matrix need only be performed once.

Finding LU Decomposition CONTINUED…

- Such sequences occur in problems in which the matrix A remains fixed but the matrix b varies over time.
- Not every square matrix has an LU-decomposition
- However, if it is possible to reduce a square matrix A to REF by Gaussian elimination (without performing any row exchanges) then Awill have an LU-decomposition.

Solution To obtain an LU-decomposition A = LUwe will reduce A to REF form U using Gaussian elimination and then calculate L from it. Steps are shown below:

Continued next slide

Constructing LU-Decomposition:

- Reduce A to a REF form U by Gaussian elinmination without row exchanges, keeping track of the multipliers used to introduce the leading 1s and multipliers used to introduce the zeros below the leading 1s
- In each position along the main diagonal of L place the reciprocal of the multiplier that introduced the leading 1 in that position in U
- In each position below the main diagonal of L place negative of the multiplier used to introduce the zero in that position in U
- Form the decomposition A = LU