ELEMENTARY ROW OPERA

TIONS
1.2 Gaussian Elimination and Gauss-Jordan Elimination

Elementary Linear Algebra

R. Larson (7 Edition)
 1.2 Gaussian Elimination and Gauss-Jordan Elimination

Matrix form of a System of Linear Equations in n variables:
a11 x1  a12 x2  a13 x3    a1n xn  b1
a21 x1  a22 x2  a23 x3    a2 n xn  b2
a31 x1  a32 x2  a33 x3    a3n xn  b3

am1 x1  a m 2 x2  am 3 x3    amn xn  bm

Matrix form: Ax  b

 a11 a12 a13  a1n 

 a21 a22 a23  a2 n   x1   b1 
   
A   a31 a32 a33  a3n  x   x2  b   b2 
   


  xn  bm 
 a m1 am 2 am 3  amn 

Elementary Linear Algebra: Section 1.2, p.13 2/46

 
Coefficient matrix:

 a11 a12 a13  a1n 

 a21 a22 a23  a2 n 
 a31 a32 a33  a3n   A
  
 
 a m1 am 2 am 3  amn 


Augmented matrix:
 a11 a12 a13  a1n b1 
 a21 a22 a23  a2 n b2 
 a31 a32 a33  a3n b3   [ A b]
  
 
 a m1 am 2 am 3  amn bm 

Elementary Linear Algebra: Section 1.2, p.13 3/46

 
Elementary row operation:

(1) Interchange two rows. rij : Ri  R j

(2) Multiply a row by a nonzero constant. ri( k ) : ( k ) Ri  Ri

(3) Add a multiple of a row to another row. rij( k ) : ( k ) Ri  R j  R j


Row equivalent:
Two matrices are said to be row equivalent if one can be obtained
from the other by a finite sequence of elementary row operation.

Elementary Linear Algebra: Section 1.2, p.14 4/46

 
Ex 2: Elementary row operation

 0 1 3 4 r12   1 2 0 3
  1 2 0 3  0 1 3 4
 2  3 4 1  2  3 4 1

 2  4 6  2 r 1
( 12 )
 1  2 3  1
 1 3  3 0  1 3  3 0
 5  2 1 2 5  2 1 2

 1 2  4 3 r13( 2 )  1 2  4 3
 0 3  2  1 0 3  2  1
2 1 5  2 0  3 13  8

Elementary Linear Algebra: Section 1.2, p.14 5/46

5/9
 
Row-echelon form, REF: (1, 2, 3)

Reduced row-echelon form, RREF: (1, 2, 3, 4)

(1) All row consisting entirely of zeros occur at the bottom

of the matrix.
(2) For each row that does not consist entirely of zeros,
the first nonzero entry is 1 (called a leading 1).
(3) For two successive (nonzero) rows, the leading 1 in the higher
row is farther to the left than the leading 1 in the lower row.
(4) Every column that has a leading 1 has zeros in every position
above and below its leading 1.

Elementary Linear Algebra: Section 1.2, p.15 6/46

 
Ex 3: Row-echelon form or reduced row-echelon form
 1 2  1 4 (row - echelon 0 1 0 5 (reduced row -
0 1 0 3 0 0 1 3
0 0 1  2 form) 0 0 0 0 echelon form)

 1  5 2  1 3 1 0 0  1
0 0 1 3  2 (row - echelon 0 1 0 2 (reduced row -
0 0 0 1 4 form) 0 0 1 3 echelon form)
0 0 0 0 1 0 0 0 0

 1 2  3 4  1 2  1 2
0 2 1  1  0 0 0 0
0 0 1  3 0 1 2  4

Elementary Linear Algebra: Section 1.2, p.16 7/46

 
Gaussian elimination:
The procedure for reducing a matrix to a row-echelon form.

Gauss-Jordan elimination:
The procedure for reducing a matrix to a reduced row-echelon
form.

Notes:
(1) Every matrix has an unique reduced row echelon
form.
(2) A row-echelon form of a given matrix is not unique.
(Different sequences of row operations can produce
different row-echelon forms.)
Elementary Linear Algebra: Section 1.2, pp.17-19 8/46
 
Ex 4: Procedure of Gaussian elimination and Gauss-Jordan elimination
Produce leading 1
0 0  2 0 8 12
r12 2 8  6 4 12 28
2 8  6 4 12 28 0 0  2 0 8 12 
   
2 4  5 6  5 4 2 4  5 6  5 4
The first nonzero column

leading 1 Produce leading 1

r
( 12 )
1 4  3 2 6 14 r13( 2 ) 1 4  3 2 6 14
1
0 0  2 0 0 0  2 0 12
8 12 
8

 
2 4  5 6  5 4 0 0 5 0  17  24
Zeros elements below leading 1 The first nonzero Submatrix
column

Elementary Linear Algebra: Section 1.2, Addition 9/46

 leading 1
(  12 ) 1 4  3 2 6 14
r23( 5)  1 4  3 2 6 14
r 0 0
2
1 0  4  6 0 0 1 0  4  6
   
0 0 5 0  17  24 0 0 0 0 3 6
Zeros elements below leading 1 Submatrix
Produce leading 1
Zeros elsewhere
1
( )
1 4  3 2 6 14 r31( 6 ) 1 4  3 2 0 2
r3 3
0 0
0 0 1 0  4  6 1 0  4  6
   
0 0 0 0 1 2 0 0 0 0 1 2
leading 1
(row - echelon form) (row - echelon form)

r32( 4)  1 4  3 2 0 2  1 4 0 2 0 8
0 0 r21(3)
1 0 0 2 0 0 1 0 0 2 
   
0 0 0 0 1 2 0 0 0 0 1 2
(row - echelon form) (reduced row - echelon form)
Elementary Linear Algebra: Section 1.2, Addition 10/46