No. Iterasi t1
1 0
2 0.05
3 0.1
4 0.15
5 0.2
6 0.25
7 0.3
8 0.35
9 0.4
10 0.45
11 0.5
12 0.55
13 0.6
14 0.65
15 0.7
Metode Exhaustive Search
No. a b k Lk* t1 t2
1 0 1 2 0.382 0.382 0.618
2 0.382 1 3 0.235 0.617 0.765
3 0.617 1 4 0.147 0.764 0.853
4 0.617 0.853 5 0.088 0.705 0.765
5 0.705 0.853 6 0.059 0.764 0.794
6 0.764 0.853 7 0.029 0.793 0.824
ubah layout
f(t1) f(t2) titik min
-0.427076 -0.545076 (0.382,1)
-0.544811 -0.562275 (0.617,1)
-0.562304 -0.551891 (0.617,0.853)
-0.560475 -0.562275 (0.705,0.853)
-0.562304 -0.560564 (0.764,0.853)
-0.560651 -0.557024 (0.764,0.824)
Metode Bisection
No a b z f(a)
1 1 2 1.5 -7
f(x) = x^3-8 2 1.5 2 1.75 -4.625
f'(x) =3x^2 3 1.75 2 1.875 -2.640625
dengan interval [1,2] 4 1.875 2 1.9375 -1.408203
e 5 1.9375 2 1.96875 -0.726807
0.005 6 1.96875 2 1.984375 -0.369171
fa*fz>0, a=z 7 1.984375 2 1.992188 -0.186039
fa*fz<0, b=z 8 1.992188 2 1.996094 -0.093384
9 1.996094 2 1.998047 -0.046784
10 1.998047 2 1.999023 -0.023415
11 1.999023 2 1.999512 -0.011713
12 1.999512 2 1.999756 -0.005858
a di kolom syarat
Metode Golden Section Search
No. aw bw Lw w1 w2 f(w1)
1 0 1 1 0.618 0.382 -0.545076
2 0.382 1 0.618 0.763924 0.618076 -0.562306
3 0.618 1 0.382 0.854076 0.763924 -0.551668
4 0.382 0.854 0.472 0.673696 0.562304 -0.556678
5 0.562304 0.854 0.291696 0.742572 0.673732 -0.562445
6 0.67373 0.854 0.18027 0.785137 0.742593 -0.561265
7 0.67373 0.785137 0.111407 0.74258 0.716287 -0.562445
8 0.71629 0.785137 0.068847 0.758837 0.74259 -0.562422