1 / 18

LU Decomposition

LU Decomposition. Major: All Engineering Majors Authors: Autar Kaw http://numericalmethods.eng.usf.edu Transforming Numerical Methods Education for STEM Undergraduates. Reflection Exercise. Write last name, first name, last name initial on a fresh sheet of paper.

cpenn
Télécharger la présentation

LU Decomposition

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 Major: All Engineering Majors Authors: Autar Kaw http://numericalmethods.eng.usf.edu Transforming Numerical Methods Education for STEM Undergraduates http://numericalmethods.eng.usf.edu

  2. Reflection Exercise Write last name, first name, last name initial on a fresh sheet of paper. Write complete sentences and more than 50 words on how you study between the end of Tuesday class and beginning of Friday class. Submit at the end of class as an in-class exercise. http://numericalmethods.eng.usf.edu

  3. CANVAS Grades http://numericalmethods.eng.usf.edu

  4. Time Taken by Back Substitution n = length(B); X(n)=B(n)/A(n,n) for i=n-1:-1:1 X(i) = B(i); for j=(i+1):1:n X(i) = X(i) - A(i, j)*X(j); end X(i) = X(i)/A(i, i); end Back Substitution http://numericalmethods.eng.usf.edu

  5. Is LU Decomposition better than Gaussian Elimination? Solve [A][X] = [B] T = clock cycle time and nxn = size of the matrix Forward Elimination Decomposition to LU Back Substitution Forward Substitution Back Substitution http://numericalmethods.eng.usf.edu

  6. Is LU Decomposition better than Gaussian Elimination? To solve [A][X] = [B] Time taken by methods T = clock cycle time and nxn = size of the matrix So both methods are equally efficient. http://numericalmethods.eng.usf.edu

  7. Truss Problem http://nm.mathforcollege.com

  8. Finding the inverse of a square matrix The inverse [B] of a square matrix [A] is defined as [A][B] = [I] OR [B][A] = [I] http://numericalmethods.eng.usf.edu

  9. Finding the inverse of a square matrix How can LU Decomposition be used to find the inverse? [A][B] = [I] First column of [B] Second column of [B] The remaining columns in [B] can be found in the same manner http://numericalmethods.eng.usf.edu

  10. Example: Inverse of a Matrix Find the inverse of a square matrix [A] Using the decomposition procedure, the [L] and [U] matrices are found to be http://numericalmethods.eng.usf.edu

  11. Example: Inverse of a Matrix • Solving for the each column of [B] requires two steps • Solve [L] [Z] = [C] for [Z] • Solve [U] [X] = [Z] for [X] Step 1: This generates the equations: http://numericalmethods.eng.usf.edu

  12. Example: Inverse of a Matrix Solving for [Z] http://numericalmethods.eng.usf.edu

  13. Example: Inverse of a Matrix Solving [U][X] = [Z] for [X] http://numericalmethods.eng.usf.edu

  14. Example: Inverse of a Matrix Using Backward Substitution So the first column of the inverse of [A] is: http://numericalmethods.eng.usf.edu

  15. Example: Inverse of a Matrix Repeating for the second and third columns of the inverse Second Column Third Column http://numericalmethods.eng.usf.edu

  16. Example: Inverse of a Matrix The inverse of [A] is To check your work do the following operation [A][A]-1 = [I] = [A]-1[A] http://numericalmethods.eng.usf.edu

  17. To find inverse of [A] Time taken by Gaussian Elimination Time taken by LU Decomposition http://numericalmethods.eng.usf.edu

  18. To find inverse of [A] Time taken by Gaussian Elimination Time taken by LU Decomposition Table 1 Comparing computational times of finding inverse of a matrix using LU decomposition and Gaussian elimination. For large n, CT|inverse GE / CT|inverse LU ≈ n/4 http://numericalmethods.eng.usf.edu

More Related