CHEN 3201 Lecture Notes - Lecture 16: Lu Decomposition, Diagonal Matrix, Gaussian Elimination
Document Summary
Chen3201_numericalmethods page 2 look @ 2nd column and see who"s the biggest --> swap that row with the 2nd row. Problem 2: do the same calculation by lu decomposition. we have already made upper diagonal matrix, but we can similarly make lower diagonal matrix use the terms in parenthases when we subtracted rows. From u x = y --> calculate x. Chen3201_numericalmethods page 8 no extra cost to do lu decomposition we still get same answers as pivoting gaussian elimination now doing forward substitution instead of backwards. Problem 3: solve the system by jacobi"s method with an initial guess (0,0). Problem 4: what happens if we switch the order of the equations in problem 3. Problem 3 and 4: use jacobi"s method to solve system of eqns. Chen3201_numericalmethods page 12 just rearranging original eqns to solve for x1 and x2 do iterations to see how close you can get to real value.