MAT.116
5.2
Systems of Linear Equations: Unique Solutions
Row Operations
Interchange any two rows (equations)
R_i <--> R_j
Replace an row (equation) by a nonzero constant multiple of itself
cR_i --> R_i
Replace any row (equation) by the sum of that row (equation) and a constant multiple of any other row (equation)
R_i + aR_j --> R_i
Augmented Matrix
Row-Reduced Form
Each row consisting entirely of zeros lies below all rows having nonzero entries.
The first nonzero entry in each (nonzero) row is 1 (called a leading 1).
In any two successive (nonzero) rows, the leading 1 in the lower row lies to the right of the leading 1 in the upper row.
If a column in the coefficient matrix contains a leading 1, then the other entries in that column are zeros.
Gauss-Jordan Elimination
Write the augmented matrix corresponding to the linear system
Interchange rows, if necessary, to obtain an augmented matrix in which the first entry in the first row is nonzero. Then pivot the matrix about this entry.
Interchange the second row with any row below it, if necessary, to obtain an augmented matrix in which the second entry in the second row is nonzero. Pivot the matrix about this entry.
Continue until the final matrix is in row-reduced form.
Pivoting
Transform a column into a unit column
Make the pivot element 1 by swapping the row with a row below it, or by multiplying the row by the reciprocal of the pivot element
Make all other entries in the same column zero by replacing each nonpivot row with the sum of that row and a constant multiple of the pivot row (the constant multiple should be the opposite of the entry that is being changed to a zero)