Penyelesaian Sistem Persamaan Linier

b. Eliminasi Gauss
x + y + 2z = 9 ditulis 1 1 2 9
dalam
2x + 4y – 3z = 1 bentuk
2 4 -3 1
matriks
3x + 6y – 5z = 0 augmented 3 6 -5 0

lalu diusahakan berbentuk 1 1 2 9

0 1 ? ?
0 0 1 ?

dengan proses Operasi Baris Elementer (OBE)

(Elementary Row Operation - ERO)
Matriks Augmented : (Matriks yang diperbesar)
Matriks yang entri-entrinya dibentuk dari koefisien-koefisien
Sistem Persamaan Linier

Contoh : x + y + 2z = 9
2x + 4y – 3z = 1
3x + 6y – 5z = 0

Matriks Augmented-nya : 1 1 2 9
2 4 -3 1
3 6 -5 0
Ciri-ciri eliminasi Gauss (Eselon Baris)
 Jika suatu baris tidak semua nol, maka bilangan
pertama yang tidak nol adalah 1 (1 utama)
 Baris nol terletak paling bawah
 1 utama baris berikutnya berada di kanan 1 utama
baris di atasnya.
 Dibawah 1 utama harus 0
Contoh : 1 4 3 7 0 1 2 6 0
0 1 6 2 0 0 1 1 0
 
0 0 1 5  0 0 0 0 1 

Ciri-ciri eliminasi Gauss Jordan (Eselon Baris Tereduksi)

 Jika suatu baris tidak semua nol, maka bilangan pertama
yang tidak nol adalah 1 (1 utama)
 Baris nol terletak paling bawah
 1 utama baris berikutnya berada di kanan 1utama baris
diatasnya..
 Tiap kolom yang mengandung 1 utama mempunyai nol di
tempat lain

Contoh : 1 0 0 4 0 1 2 0 1
0 0 3
 1 0 7   0 0 1 
0 0 1  1 
0 0 0 0 0

Eliminasi Gauss menggunakan O.B.E :
1 1 2 9 
0 2  7  17  [baris 1 -2] + baris 2
 
0 3  11  27  1   2  2   0 
       
1 *   2 +  4   2 
 2   2   3 =  7 
       
9   2  1    17 
       
[baris 1 -3] + baris 3 1   3  3   0 
       
1   3  6   3 
baris 2 * 1/2  2 *   3 +   5=
   11 
       
9   3  0    27 
       
1 1 2 9 
0 1  7 / 2  17 / 2 [baris 2 -3] + baris 3
 0 
   0 
 *   3
  +  0 
 =
  
0 0  1 / 2  3 / 2   1    3  3   0 
  1/ 2 
 7/2    3   11 
       
  17 / 2    3   27    3 / 2
       

baris 3 -2 Substitusi Balik

1 1 2 9  z=3
 7 17 
0 1  2  

 x  1, y  2, z  3
0 0 1 2 7
y  z  17 / 2 x  y  2z  9
 3  2
y  7 / 2(3)  17 / 2 x  2  2(3)  9
y2 x 1
x y z
1 1 2 9 Substitusi Balik:
0 2 -7 -17
0 0 -½ -3/2 -1/2 z = -3/2 z =3

1 1 2 9
0 2 -7 -17 2y – 7z = - 17
0 0 -½ -3/2 z 2y = 21 – 17 y=2

1 1 2 9 x + y + 2z = 9
0 2 -7 -17 y x =–2–6+9 x =1
0 0 -½ -3/2 z
Bentuk eselon baris:
1. Entri-entri dalam sebuah baris tidak semuanya nol, maka
entri pertama yang tidak nol harus 1 (disebut 1-utama /
leading-1)
2. Baris-baris yang semua entrinya 0, dikelompokkan di bagian
bawah matriks
3. Posisi 1-utama dari baris yang lebih bawah harus lebih ke
kanan d/p 1-utama baris yang lebih atas

Bentuk eselon baris tereduksi:

1, 2, 3, ditambah
4. Semua entri (yang lain) dari kolom yang berisi 1-utama
harus di-0-kan
Operasi Baris Elementer (OBE)
(Elementary Row Operation - ERO)
Perhatikan bahwa tiap baris dari matriks merepresentasikan persamaan linier
1. Mengalikan suatu baris dengan bilangan nyata k  0
2. Menukar posisi dua baris
3. Menambah baris-i dengan k kali baris-j
c. Eliminasi Gauss-Jordan (ringkasan):

Sistem Persamaan → Matriks → Eliminasi → Solusi

Linier Augmented Gauss-Jordan (langsung)

OBE
Eliminasi Gauss-Jordan (contoh yang sama)
x + y + 2z = 9 1 1 2 9
2x + 4y – 3z = 1 2 4 -3 1
3x + 6y – 5z = 0 3 6 -5 0

dan diusahakan berbentuk 1 0 0 ?

0 1 0 ?
0 0 1 ?

dengan proses Operasi Baris Elementer (OBE)

(Elementary Row Operation - ERO)
Eliminasi Gauss-Jordan menggunakan O.B.E
 idem Gauss
 disambung dengan :
1 1 2 9 
0 1  7 / 2  17 / 2
  baris 3  7 + baris 2
0 0 1 3  2
0  7 / 2  0  0
       
0
1
*  7 / 2
 7 / 2
+  1 
 7/2 
= 1
0
       
1 1 2 9   3
 
 7 / 2
 
  17 / 2 
 
 2
 
0 1 0 2 
 
0 0 1 3
baris 3  -2 + baris 1 0
 
0
  2
 
  2
1
 
1
1
 
1
1 * +
  2 =
 2 0
       
 3   2 9  3
       
1 1 0 3 
0 1 0 2 
baris 2  -1 + baris 3 0
 
  1
 
1
 
1
 
  1   1 1 0
0   1 0 0
0 0 1 3   *   +  =  
 2   1  3 1
       

1 0 0 1  x 1
0 1 0 2 
  y  2
0 0 1 3
z 3
Suatu SPL mempunyai 3 kemungkinan jawaban, yaitu :
1.Mempunyai jawaban tunggal
2.Mempunyai banyak jawaban
3.Tidak mempunyai jawaban
Contoh :
Tentukan nilai a agar SPL berikut:
x – 2y + 3z = 1
2x – 3y + 9z = 4
x – 3y + (a2 - 4)z = 1 + a
i. Mempunyai jawaban tunggal
ii. Mempunyai banyak jawaban
iii. Tidak mempunyai jawaban
Penyelesaian :
1  2 3 1 
Matriks Eselon SPL di atas adalah : 0 1 3 2 

0 0  4  a 2 2  a 

i. Mempunyai jawaban tunggal

a2 – 4 ≠ 0  a ≠ -2 dan a ≠ 2

ii. Mempunyai banyak jawaban

a2 – 4 = 0 dan a +2 = 0  a = -2

iii. Tidak mempunyai jawaban

a2 – 4 = 0 dan a + 2 ≠ 0  a = 2
 Halaman 5
Example 3.
In the left column below we solve a system of equations by operating on
the equations in the system, and in the right column we solve the same
system by operating on the rows of the augmented matrix.

x + y + 2z = 9 1 1 2 9
2x + 4y – 3z = 1 2 4 3 1 

3x + 6y -5z = 0 3 6 5 0
Add -2 times the first equation Add -2 times the first row
to the second to obtain to the second to obtain
x + y + 2z = 9 1 1 2 9 
0 2  7  17 
2y – 7z = -17  
3x + 6y -5z = 0 3 6  5 0 
Add -3 times the first equation Add -3 times the first row
to the third to obtain to the third to obtain
x + y + 2z = 9 1 1 2 9 
2y – 7z = -17 0 2  7  17 
 
3y -11z = -27 0 3  11  27 
Multiply the second equation Multiply the second row by
by ½ to obtain ½ to obtain

x  y  2z  9 1 1 2 9 
7 17  7 17 
y z    
2 
0 1
2 2 2
0 3  11
3 y  11z  27   27 

Add -3 times the second Add -3 times the second

equation to the third to obtain row to the third to obtain
x  y  2z  9  
1 1 2 9 
7 17 
y z 7 17 
2 2 0 1   
 2 2
1 3 0 0  1  
3
 z
2 2  2 2 

Multiply the third equation by Multiply the third row by -2

-2 to obtain to obtain
x  y  2z  9 1 1 2 9 
7 17  7 17 
y z 0 1  2  
2
2 2 0 0 1 3 

z3
Add -1 times the second equation Add -1 times the second
to the first to obtain row to the first to obtain
11 35  35 
x z 1 0
11
2 2  2 2 
 7 17 
7 17 0 1   
y z
2 2  2 2
 0 0 1 3 
z3  
Add -11/2 times the third equation to Add -11/2 times the third row to the
the first and 7/2 times the third first and 7/2 times the third row to
equation to the second to obtain the second to obtain

x 1 1 0 0 1 
0 1 0 2 
y2  
0 0 1 3
z3

The solution : x = 1, y = 2, z = 3
 Halaman 11
0 0  2 0 7 12 
2 4  10 6 12 28 
 
2 4  5 6  5  1

Step 1. Locate the leftmost column that does not consist

entirely of zeros.
0 0  2 0 7 12 
2 4  10 6 12 28 
 
2 4  5 6  5  1

Leftmost nonzero column

Step 2. Interchange the top row with another row, if necessary, to bring a
nonzero entry to the top of the column found in Step 1.
2 4  10 6 12 28 
0 0  2 0 7 12  The first and second rows in the
  preceding matrix were interchanged
2 4  5 6  5  1
Step 3 if the entry that is now at the top of the coloumn found in step 1 is
a, multiply the first row by 1/a in order to introduce a leading 1

1 2 -5 3 6 14 The first row of the

0 0 -2 0 7 12 preceding
2 4 -5 6 -5 -1 matrix was multiplied by ½

step 4 add suitable multiples of the top row to the rows below so that all
entries below the leading 1 to zeros

1 2 -5 3 6 14 -2 times the first row

0 0 -2 0 7 12 of the preceding matrix was
0 0 5 0 -17 -29 added to the third row

step 5 Now cover the top row in the matrix and begin again with step 1
applied to the submatrix that remains. Continue in this way until
the entire matrix is in row-echelon form
1 2 -5 3 6 14
0 0 -2 0 7 12
0 0 5 0 -17 -29 left most nonzero coloumn in the
submatrix
1 2 -5 3 6 14
0 0 1 0 -3,5 -6 The first row in the submatrix
0 0 5 0 -17 29 was multiplied
by -1/2 to introduce a leading 1

1 2 -5 3 6 14
-5 times the first row of the submatirx
0 0 1 0 -3,5 -6 was added to the second row of the submatrix
0 0 5 0 -17 29 to introduce a zero below the leading 1

1 2 -5 3 6 14
The top row in the submatrix was
0 0 1 0 -3,5 -6
covered, and we returned again
0 0 0 0 0.5 1 to the step 1

leftmost non zero coloumn

in the new submatrix
1 2 -5 3 6 14
0 0 1 0 -3,5 -6
0 0 0 0 1 2 The first(and only) row in the submatrix
was multiplied by 2 to introduce a leading 1

•The entire matrix is now in row-echelonform. To find the reduce row-echelon

form we need the following additional step
Step 6 Begining with the last nonzero row and working upward, add suitable
multiplies of each row to the rows above to introduce zeros above the
leading 1’s

1 2 -5 3 6 14 7/2 times the third row of the

0 0 1 0 0 1 preceding matrix was added
0 0 0 0 1 2
to the second row

1 2 -5 3 0 2
-6 times the third row was
0 0 1 0 0 1
0 0 0 0 0 1
added
to the first row

1 2 0 3 0 7 5 times the second row was

0 0 1 0 0 1 added to the first row
0 0 0 0 1 2

The last matrix is in reduced row echelon form

Sistem Persamaan Linier Homogen :
1. Sistem Persamaan Linier dikatakan homogen jika semua suku di
kanan tanda “=“ adalah 0.
2. Solusi Sistem Persamaan Linier Homogen:
Solusi Trivial ( semua xi = 0; i = 1 .. n ): pasti ada
Solusi Non-trivial ( solusi trivial, plus solusi di mana ada xi ≠ 0 )

Contoh: lihat contoh 6 halaman 18 dan verifikasi proses penyelesaiannya

2 2 -1 0 1 0
-1 -1 2 -3 1 0
1 1 -2 0 -1 0
0 0 1 1 1 0
Contoh: lihat contoh 6 halaman 18 dan verifikasi proses penyelesaiannya

2 2 -1 0 1 0
-1 -1 2 -3 1 0
1 1 -2 0 -1 0
0 0 1 1 1 0 Brs-1  (1/2)

1 1 -1/2 0 1/2 0
-1 -1 2 -3 1 0 Brs-2 + brs-1
1 1 -2 0 -1 0
0 0 1 1 1 0 Brs-3 – brs-1

1 1 -1/2 0 1/2 0
0 0 3/2 -3 3/2 0
0 0 -3/2 0 -3/2 0
0 0 1 1 1 0
 1 1 -1/2 0 1/2 0
0 0 3/2 -3 3/2 0
Brs-2  (2/3)
0 0 -3/2 0 -3/2 0
0 0 1 1 1 0 Brs-3  (– 2/3)

1 1 -1/2 0 1/2 0
0 0 1 -2 1 0
Brs-3 – brs-2
0 0 1 0 1 0
Brs-4 – brs-2
0 0 1 1 1 0

1 1 -1/2 0 1/2 0
0 0 1 -2 1 0
0 0 0 2 0 0

0 0 0 3 0 0
1 1 -1/2 0 1/2 0
0 0 1 -2 1 0
0 0 0 2 0 0 Brs-3  (1/2)
0 0 0 3 0 0
Brs-4  (1/3)

1 1 -1/2 0 1/2 0
0 0 1 -2 1 0
0 0 0 1 0 0
Brs-4 – brs-3
0 0 0 1 0 0

1 1 -1/2 0 1/2 0
0 0 1 -2 1 0
0 0 0 1 0 0

0 0 0 0 0 0
 1 1 -1/2 0 1/2 0
0 0 1 -2 1 0
0 0 0 1 0 0
0 0 0 0 0 0

1 1 -1/2 0 1/2 0
0 0 1 0 1 0
0 0 0 1 0 0
baris-1 + (1/2)  baris-2
0 0 0 0 0 0

1 1 0 0 1 0
0 0 1 0 1 0
0 0 0 1 0 0

0 0 0 0 0 0
 1 1 0 0 1 0
0 0 1 0 1 0
0 0 0 1 0 0

0 0 0 0 0 0

x1 + x2 + x5 = 0
x3 + x5 = 0
x4 =0
x5 = s  x3 + x5 = 0  x3 = – x5
x2 = t  x1 + x2 + x5 = 0  x1 = – x2 – x5
Ruang solusinya = { (-t-s, t, -s, 0, s ) }
Catt => yang diumpamakan dahulu adalah  index terbesar