DIRECTS

METHODS
 GAUSSIAN
ELIMINATION

0 A system of equations is solved by the Gauss when

their solutions are obtained by reducing an equivalent
system given in which each equation has one fewer
variables than the last.

0 When applying this process, the resulting matrix is

known as: “Form staggered”.
 EXAMPLE
0 Solve the following system of linear equations by
Gaussian Elimination method.
x1  5 x2  9 x3 117
12 x1  x2  3 x3  46
4 x1  6 x2  x3 55
 1 5 9 117 
 
12 1 3 18 
 4 6 1 6 
  1 5 9 117  1 5 9 117 
  f1*12 f 2  
 12 1 3 18       0  59 105  1358
 4 6 1 6  4 6 1 6 

1 5 9 117  1 5 9 117 
  f1*4 f 3  
0  59 105  1358   0  59 105  1358
4 6 1 6  0  14  35  413 
 1 5 9 117  1 5 9 117 
  f1* 159  
0  59 105  1358   0 1 105 59 1358 59
0  14  35  413  0  14  35  413 

1 5 9 117  1 5 9 117 
  f 2 *14 f 3  
0 1 105 59 1358 59   0 1 105 59 1358 59 
0  14  35  413  0 0  595 59  5355 59
1 5 9 117  1 5 9 117 
  f 3 *59559  
0 1 105 59 1358 59   0 1 105 59 1358 59
0 0  595 59  5355 59 0 0 1 9 

x1  5 x2  9 x3  117
x2  105 59 x3 1358 59
x3  9

x3  9
x2  7
x1  1
 GAUSS-JORDAN

0 The Gauss-Jordan is a variant of the method of Gauss.

When you delete an unknown in an equation, Gauss-Jordan
eliminates that unknown quantity in the rest of the
equations, the basis for disposing the pivot equation. Also
all the rows are normalized when taken as pivot equation.
The end result of such disposal creates an identity matrix
instead of a triangular Gauss as it does, so do not use the
back substitution.
 EXAMPLE
0 Solve the following system of linear equations by Gauss-
Jordan method.

2x  3y  z  1
3x  2 y  4 z   3
5x  y z  4
0 Then we write the augmented matrix of the system.

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

0 We take this matrix to reduced row-echelon form by

elementary operations on the rows of the matrix, for
this, write the matrix and then an arrow. Above this
arrow will indicate the operations we're making so that
the reader can follow the development.
0 Development to obtain the reduced row echelon form.

2 3 1 1 1 1 3 2 1 2 1 2
  2 f1  
 3  2  4  3   3  2  4  3 
5  1  1 4  5  1  1 4 

1 3 2 1 2 1 2 3 f  f 1 32 12 12 
  5 f11  f 32  
 3  2  4  3      0  13 2  11 2  9 2 
5  1  1 4  0  17 2  7 2 3 2 
1 32 1 2 1 2  2 13 f 1 3 2 1 2 1 2 
  2 f3 2  
0  13 2  11 2  9 2  0 1 11 13 9 13
0  17 2  7 2 3 2  0  17  7 3 

1 3 2 1 2 1 2  1 3 2 1 2 1 2 
  17 f 2  f 3  
 0 1 11 13 9 13     0 1 11 13 9 13 
0  17  7 3  0 0 96 13 192 13
1 3 2 1 2 1 2  1 3 2 1 2 1 2 
  13 96 f 3  
 0 1 11 13 9 13      0 1 11 13 9 13 
0 0 96 13 192 13 0 0 1 2 

1 3 2 1 2 1 2  11 13 f  f 1 3 2 0  1 2
  1 2 f 3 3 f1 2  
 0 1 11 13 9 13       0 1 0  1 
0 0 1 2  0 0 1 2 
1 3 2 0  1 2 1 0 0 1 
  3 2 f 2  f1  
0 1 0  1   0 1 0  1
0 0 1 2  0 0 1 2 

1 0 0 1  x 1
 
0 1 0  1  y   1
0 0 1 2  z 2
0 The final reduced row echelon matrix indicates that:
The solution of the system is x = 1, y =- 1 and z = 2.

x  1
y  1
z  2
 GAUSS-JORDAN
WITH PIVOTING

0 It is a kind of direct method for calculating matrices.

0 The system consists of taking a system of equations as

an equation as a pivot in order to give a matrix
identical to the system of equations. When you delete
an unknown in an equation, Gauss-Jordan eliminates
that unknown in the rest of the equations.
0 The number arr in the coefficient matrix A that is
used to eliminate akr , where k = r + 1, r + 2, . . . , N, is
called the r th pivotal element, and the r th row is
called the pivot row.

0 The following example illustrates how to use the

operations to obtain an equivalent upper-triangular
system UX = Y from a linear system AX = B, where A is
an N × N matrix.
 EXAMPLE
0 Solve the following system of linear equations by Gauss-
Jordan with pivoting method.

x1  2 x2  x3  4 x4  13
2 x1  4 x3  3 x4  28
4 x1  2 x2  2 x3  x4  20
 3x1  x2  3 x3  2 x4  6
0 The augmented matrix is:

pivot  1 2 1 4 13 
 
m21  2 2 0 4 3 28
m31  4 4 2 2 1 20
 
m41   3  3 1 3 2 6 
0 The first row is used to eliminate elements in the first
column below the diagonal. We refer to the first row
as the pivotal row and the element a11 = 1 is called the
pivotal element. The values mk1 are the multiples of
row 1 that are to be subtracted from row k for k = 2, 3,
4. The result after elimination is:

1 2 1 4 13 
 
pivot   0  4 2  5 2 
m32  1.5 0  6  2  15  32
 
m42   1.75 0 7 6 14 45 
0 The second row is used to eliminate elements in the
second column that lie below the diagonal. The
second row is the pivotal row and the values mk2 are
the multiples of row 2 that are to be subtracted from
row k for k = 3, 4. The result after elimination is:

1 2 1 4 13 
 
0  4 2 5 2 
pivot  0 0  5  7.5  35
 
m43   1.9 0 0 9.5 5.25 48.5
0 Finally, the multiple m43 = −1.9 of the third row is
subtracted from the fourth row, and the result is the
upper-triangular system.

1 2 1 4 13 
 
 0  4 2  5 2 
0 0  5  7.5  35
 
0 0 9.5  9  18 
0 The back-substitution algorithm can be used to solve,
and we get: x4 = 2, x3 = 4, x2 = −1, x1 = 3.

x4  2
x3  4
x2  1
x1  3
 BIBLIOGRAPHY
0 http://cbi.azc.uam.mx/archivos/varios/Problemario
W.pdf
0 http://www.ecs.fullerton.edu/~mathews/n2003/gau
ssjordan/GaussianJordanProof.pdf