Professional Documents
Culture Documents
2013/9/9
GAUSS-SEIDEL METHOD
Adalah metode ITERASI
Prosedur dasar:
- Menyelesaikan tiap persamaan linier secara aljabar untuk xi
- Membuat nilai asumsi solusi
- Selesaikan untuk tiap xi dan ulangi
- Gunakan perkiraan kesalahan relatif tiap akhir iterasi untuk
mengecek apakah error sudah mencapai angka toleransi.
GAUSS-SEIDEL METHOD
Kenapa?
Untuk mengatasi round-off error (kesalahan pembulatan).
GAUSS-SEIDEL METHOD
Algorithm
Sistem persamaan linier
.
.
.
GAUSS-SEIDEL METHOD
Algorithm
General Form of each equation
n
c1 a1 j x j
x1
j 1
j 1
a11
cn 1
xn 1
j 1
j n 1
n 1, j
an 1,n 1
n
c n a nj x j
c2 a2 j x j
x2
j 1
j2
a 22
xj
xn
j 1
j n
a nn
MENJADI:
Untuk sistem
persamaan 3x3
b1 a12 x2 a13 x3
x1
a11
b2 a21x1 a23 x3
x2
a22
b3 a31x1 a32 x2
x3
a33
a i
baru
i
lama
i
baru
i
100 diperkenankan
25 5 1 x1 106.8
64 8 1 x 177.2
144 12 1 x 3 279.2
x1 1
x 2
2
x3 5
25 5 1 x1 106.8
64 8 1 x 177.2
144 12 1 x 3 279.2
106.8 5 x2 x3
x1
25
177.2 64 x1 x3
x2
8
279.2 144 x1 12 x2
x3
1
x1
177.2 643.6720 5
x2
7.8510
8
279.2 1443.6720 12 7.8510
x3
155.36
1
x inew x iold
100
new
xi
a 1
3.6720 1.0000
x100 72.76%
3.6720
a 2
7.8510 2.0000
x100 125.47%
7.8510
a 3
155.36 5.0000
x100 103.22%
155.36
a1 3.6720
a 7.8510
2
a3 155.36
The maximum absolute
relative approximate error is
125.47%
a1 3.6720
a 7.8510
2
a3 155.36
from iteration #1
a2
12.056 3.6720
x100 69.542%
12.056
a 2
54.882 7.8510
x100 85.695%
54.882
a 3
798.34 155.36
x100 80.54%
798.34
a1 12.056
a 54.882
2
a3 798.34
Galat absolut terbesar
85.695%
1
2
3
4
5
6
a1
3.672
12.056
47.182
193.33
800.53
3322.6
a 1 %
72.767
67.542
74.448
75.595
75.850
75.907
a2
-7.8510
-54.882
-255.51
-1093.4
-4577.2
-19049
a 2 %
125.47
85.695
78.521
76.632
76.112
75.971
a3
-155.36
-798.34
-3448.9
-14440
-60072
-249580
a 3 %
103.22
80.540
76.852
76.116
75.962
75.931
aii aij
j 1
j i
Untuk semua i ;
DAN
aii aij
j 1
j i
Untuk minimal
sebuah i
124 34 56
[ B] 23 53 5
96 33 129
12x1 3x 2 - 5x 3 1
x1 5x 2 3x 3 28
3x1 7x2 13x3 76
12 3 5
A 1 5 3
3 7 13
x1 1
x 0
2
x3 1
12 3 5 a1 1
1 5 3 a 28
2
3 7 13 a3 76
1 3 x 2 5 x3
x1
12
28 x1 3x3
x2
5
76 3x1 7 x2
x3
13
x1 1
x 0
2
x3 1
x1
x2
1 30 51
0.50000
12
28 0.5 31
4.9000
5
76 30.50000 74.9000
x3
3.0923
13
0.50000 1.0000
a 1
100 67.662%
0.50000
a
a
4.9000 0
100 100.00%
4.9000
3.0923 1.0000
100 67.662%
3.0923
x3 3.0923
x3 3.8118
x1
1 34.9000 53.0923
0.14679
12
x2
28 0.14679 33.0923
3.7153
5
x3
76 30.14679 73.7153
3.8118
13
Setelah iterasi #2
0.14679 0.50000
100 240.62%
0.14679
a 2
3.7153 4.9000
100 31.887%
3.7153
a 3
3.8118 3.0923
100 18.876%
3.8118
a1
0.50000
0.14679
0.74275
0.94675
0.99177
0.99919
x1 0.99919
Hasil akhir x 3.0001
2
x3 4.0001
a 1
a2
67.662
240.62
80.23
21.547
4.5394
0.74260
4.900
3.7153
3.1644
3.0281
3.0034
3.0001
a3
2
100.00
31.887
17.409
4.5012
0.82240
0.11000
3.0923
3.8118
3.9708
3.9971
4.0001
4.0001
67.662
18.876
4.0042
0.65798
0.07499
0.00000
x1 1
Mendekati solusi sejati x 3
2
x3 4
LATIHAN
Sistem persamaan linier
GAUSS-SEIDEL METHOD
The Gauss-Seidel Method can still be used
The coefficient matrix is not
diagonally dominant
3 7 13
A 1 5 3
12 3 5
12 3 5
A 1 5 3
3 7 13
GAUSS-SEIDEL METHOD
Not every system of equations can be rearranged to have a
diagonally dominant coefficient matrix.
Observe the set of equations
x1 x2 x3 3
2 x1 3x2 4 x3 9
x1 7 x2 x3 9
Which equation(s) prevents this set of equation from having a
diagonally dominant coefficient matrix?
GAUSS-SEIDEL METHOD
Summary
-Advantages of the Gauss-Seidel Method
-Algorithm for the Gauss-Seidel Method
-Pitfalls of the Gauss-Seidel Method
GAUSS-SEIDEL METHOD
Questions?
METODE PENYELESAIAN
Metode grafik
Eliminasi Gauss
Metode Gauss Jourdan
Metode Gauss Seidel
LU decomposition
LU DECOMPOSITION
A=LU
Ax=b LUx=b
Define Ux=y
Ly=b
Ux=y
LU DECOMPOSITION BY GAUSSIAN
ELIMINATION
There are infinitely many different ways to decompose A.
Most popular one: U=Gaussian eliminated matrix
L=Multipliers used for elimination
1
m
2,1
m3,1
A
mn 1,1
mn ,1
0
1
m3, 2
mn 1, 2
mn , 2
0
0
1
mn 1,3
mn ,3
0
0
0
1
mn , 4
(1)
0 a11
0 0
0 0
0
0
1 0
(1)
a12
( 2)
a22
0
0
0
(1)
a13
( 2)
a23
( 3)
a33
0
0
an( n1) n 1
0
a1(1n)
a2( 2n)
a3(3n)
an( n1) n
(n)
ann