1 / 10

LU Decomposition and Matrix Inversion Chapter 10

LU Decomposition and Matrix Inversion Chapter 10. Credit: Prof. Lale Yurttas, Chemical Eng., Texas A&M University. 0. 0. Solve A . x = b (system of linear equations) Decompose A = L . U * L : Lower Triangular Matrix U : Upper Triangular Matrix.

wendi
Télécharger la présentation

LU Decomposition and Matrix Inversion Chapter 10

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. LU Decomposition and Matrix Inversion Chapter 10 Credit: Prof. Lale Yurttas, Chemical Eng., Texas A&M University

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

  3. 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}

  4. [ L ] [ U ]

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

  6. [ L .U ]

  7. Example: A = L . U Gauss Elimination Coefficients l21 = -2/-1= 2 l31 =4/-1= -4 [ L ] l32 =-12/4= -3 [ U ]

  8. Example: A = L . U Gauss Elimination with pivoting Coefficients l21 = -2/4= -.5 l31 =-1/4= -.25 Coefficients l32 =-2/-3 [ U ]

  9. 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

  10. MATRIX INVERSE A. A-1 = I Solve in n=3 major steps 1 2 3 Solve each one using A=L.U method  e.g. Solve Problem 10.6. Solution file is available on the web.

More Related