This preview shows pages 1–12. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: The right half of the resulting augmented matrix is the inverse of the original matrix. Check: Example: GaussJordan Elimination Method If the diagonal element of the current row, the element (i,i) position in iteration i, is 0, switch that row with another row that has nonzero value in that column position. For invertible matrices, this is always feasible. This switching of rows to ensure the diagonal element is nonzero is called pivoting . Solution to system of Linear equations Note : If the equations are independent, that is, none of the equations can be obtained by a linear combination of the other two equations, then the corresponding matrix is nonsingular. GaussJordan Elimination to Solve System of Linear Equations Example: Problem 5, Section 2.6...
View
Full
Document
This note was uploaded on 03/21/2012 for the course CS 3333 taught by Professor Boppana during the Fall '11 term at The University of Texas at San Antonio San Antonio.
 Fall '11
 Boppana

Click to edit the document details