Scribd
Upload
5K views

4x4 Gaussian Example

1) The document shows the steps to solve a system of 4 equations with 4 unknowns (x, y, z, w) using Gaussian elimination. 2) The system is initially written as a 4x5 matrix. A series of row operations are performed to transform the matrix into row echelon form. 3) Additional row operations are then performed to transform the matrix into reduced row echelon form. 4) From the reduced row echelon form, the solution is determined to be x=1, y=-1, z=1, w=2.

Uploaded by

rhiya
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
5K views

4x4 Gaussian Example

1) The document shows the steps to solve a system of 4 equations with 4 unknowns (x, y, z, w) using Gaussian elimination. 2) The system is initially written as a 4x5 matrix. A series of row operations are performed to transform the matrix into row echelon form. 3) Additional row operations are then performed to transform the matrix into reduced row echelon form. 4) From the reduced row echelon form, the solution is determined to be x=1, y=-1, z=1, w=2.

Uploaded by

rhiya
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

4X4 Gaussian Elimination / Gauss Jordan Example

x + z + 2w = 6

y 2z = 3
Solve:
x + 2y z = 2
+ y + 3z 2w = 0
2x

1
0 1 2 6 R1 +R 3 R 3 1
0 1 2 6

0
1 2 0 3 0
1 2 0 3

1
2 1 0 2 2R1 +R 4 R 4 0
2 2 2 8

2
1 3 2 0
0
1 1 6 12

2R 2 +R 3 R 3 1
0 1 2 6

0
1 2 0 3

R 2 +R 4 R 4 0
0 2 2 2

0
0 3 6 9


1
0 2
1 6 1
0 1 2 6

0 1 2 0 3 0 1 2 0 3
1 R R
2 3 3
0
0 1 1 1 3R 3 +R 4 R 4 0
0 1 1 1

0
0 3 6

9


0
0 0 3

6
13 R 4 R 4



1
0 1 2 6

0
1 2 0 3
0


0 1 1 1

0
0 0 1 2

This is row echelon form. If using Gaussian elimination you can stop
your row operations here, write the corresponding system, and use
back substitution to find the solution. If using Gauss-Jordan then
continue with row operations until reduced row echelon form is
achieved.

Continuing, getting zeros above the leading ones


R 4 +R 3 R 3 1
0 1 0 2 2R 3 +R 2 R 2

0
1 2 0 3
2R 4 +R1 R1 0
0 1 0 1 R 3 +R1 R1

00 0 1
1
0
0 0 1 2


0
1 0 0 1
0
0 1 0 1

0
0 0 1 2
From here we can see the solution, x=1, y=-1, z=1, w=2, that is (1, -1,
1, 2).

There are many other sequences of row operations that are
acceptable, but they must achieve the same solution in the end. With
practice, you will be able to combine more operations into each step.

You might also like