Nama : Farhan Akmal

NIM : 190534646452
Prodi : S1 Pendidikan Teknik Elektro A’19
Matkul : Sistem Komputasi dan Numerik

SOAL LATIHAN METODE TERBUKA

1. Metode Iterasi
2. Metode Newton-Raphson
a.
ƒu(x) = −1,75x + 1,75

Iterasi x F(x) F’(x)

0 3.1 -0.35875 -3.675
1 3.002381 -0.0083385 -3.5041668
2 3.0000014 -0.0000049 -3.5000025

b.

ƒu(x) = 2,001x2 − 7,8x + 6,21

Iterasi x F(x) F’(x)

0 1 0.877 0.411
1 -1.13382 -15.126864 17.626177
2 -0.2756155 -4.1217963 8.5118047
3 0.2086292 -0.9681077 4.6697881
4 0.4159422 -0.1437316 3.3118397
5 0.4593415 -0.0057236 3.0493365
6 0.4612185 -0.0000105 3.0381534

c.

ƒu(x) = 79,5 − 176,18x + 124,8x2 − 34,72x3 + 3,29x4

Iterasi x F(x) F’(x)
0 3.5 1.9439375 -3.244375
1 4.0991716 -2.0941174 -8.2144236
2 3.8442398 -0.0011859 -7.4164158
3 3.8440799 0.0000239 -7.4150847
4 3.8440831 -0.0000003 -7.4151114
3. Metode Secant
a.

Iterasi X0 X1 Y0 Y1 X2 Y2
1 2 3 0.98984 -9.86229 2.0912116 0.8262443
2 3 2.0912116 -9.86229 0.8262443 2.1614627 0.6224082
3 2.0912116 2.1614627 0.8262443 0.6224082 2.3759726 -0.5042171
4 2.1614627 2.3759726 0.6224082 -0.5042174 2.2799694 0.1018653
5 2.3759726 2.2799694 -0.5042174 0.1018654 2.2961048 0.0121812
6 2.2799694 2.2961048 0.1018654 0.0121813 2.2982964 -0.0003681
7 2.2961048 2.2982964 0.0121813 -0.0003682 2.2982321 0.0000013
8 2.2982964 2.2982321 -0.0003682 0.0000013 2.2982323 1.332D-10

b.
Iteras
X0 X1 Y0 Y1 X2 Y2
i
1 7 9 -39.25 592.83 7.124193 -
1 28.73897
2 9 7.124193 592.83 - 7.210923 -
1 28.73897 2 19.85323
4
3 7.124193 7.210923 - - 7.404702 5.034975
1 2 28.73897 19.85323 6 5
4 5
4 7.210923 7.404702 - 5.034979 7.365500 -
2 6 19.85323 7 3 0.591289
5 4

5 7.404702 7.365500 5.034979 - 7.369620 -

6 3 7 0.591288 2 0.0145793
8
6 7.365500 7.369620 - - 7.369724 0.000044
3 2 0.591288 0.014584 4 1
8 8
7 7.369620 7.369724 - 0.000045 7.369724 -3.353D-
2 4 0.014584 2 1 09
8

c.

Iterasi X0 X1 Y0 Y1 X2 Y2
1 2.5 3.6 -0.375 2.496 2.6436782 -0.37698824
 2 3.6 2.6436782 2.496 -0.3769884 2.769165
-0.3141156
3 2.6436782 2.769165 -0.3769884 -0.3141156 3.3961033 1.3250476
4 2.769165 3.3961033 -0.3141156 1.3250478 2.8893062 -0.1859846
5 3.3961033 2.8893062 1.3250478 -0.1859846 2.951685 -0.0897397
6 2.8893062 2.951685 -0.1859846 -0.0897398 3.0098477 0.0199873
7 2.951685 3.009847 -0.0897398 0.0199873 2.9992531 -0.0014921
8 3.0098477 2.9992531 0.0199873 -0.0014921 2.9999891 -0.0000218

4. Mencari metode yang paling efisien dari persamaan berikut

a. Metode Tabulasi
Tabel 1
X F(x)
0 20.57
0.1 15.4397
0.2 11.3028
0.3 8.0141
0.4 5.4308
0.5 3.4125
0.6 1.8212
0.7 0.5213
0.8 -0.6204
0.9 -1.7347
1 -2.95

Tabel 2
X F(x)
0.7 0.5213
0.71 0.402188
0.72 0.2845242
0.73 0.1681768
0.74 0.0530146
0.75 -0.0610937
0.76 -0.174279
0.77 -0.286672
0.78 -0.398403
0.79 -0.5096024
0.8 -0.6204
Tabel 3
X F(x)
0.74 0.0530146
0.741 0.0415585
0.742 0.0301128
0.743 0.0186774
0.744 0.0072521
0.745 -0.0041631
0.746 -0.0155685
0.747 -0.0269641
0.748 -0.0383501
0.749 -0.0497266
0.75 -0.0610937

Tabel 4
X F(x)
0.744 0.0072521
0.7441 0.0061101
0.7442 0.0049683
0.7443 0.0038265
0.7444 0.0026848
0.7445 0.0015432
0.7446 0.0004018
0.7447 -0.0007396
0.7448 -0.0018809
0.7449 -0.0030221
0.745 -0.0041631

Tabel 5
X F(x)
0.7446 0.0004018
0.74461 0.0002876
0.74462 0.0001735
0.74463 0.0000593
0.74464 -0.0000548
0.74465 -0.0001689
0.74466 -0.0002831
0.74467 -0.0003972
0.74468 -0.0005114
0.74469 -0.0006255
0.7447 -0.0007396
b. Metode Biseksi

Iterasi A B X F(x) F(a) Ket

1
0 1 0.5 3.4125 20.57
2 -
0.5 1 0.75 0.061093 3.4125 berlawanan
7
3 1.474150
0.5 0.75 0.625 3.4125
4
4 0.672427 1.474150
0.625 0.75 0.6875
4 4
5 0.299157 0.672427
0.6875 0.75 0.71875
4 4
6 0.117655 0.299157
0.71875 0.75 0.734375
2 4
7 0.742187 0.027967 0.117655
0.734375 0.75
5 9 2
8 -
0.742187 0.746093 0.027967
0.75 0.016637 berlawanan
5 8 9
3
9 0.742187 0.746093 0.744140 0.005645 0.027967
5 8 7 9 9
10 -
0.744140 0.746093 0.745117 0.005645
0.005500 berlawanan
7 8 3 4
9
11 0.744140 0.745117 0.000070 0.005645
0.744629
7 3 7 4

c. Metode Regula Falsi

Iterasi a b x F(x) F(a) F(b)
1 1 0 0.8745748 - -2.95 20.57
1.4468599
2 0.8745748 0 0.8171013 - - 20.57
0.8093185 1.4468595
3 0.8171013 0 0.7861697 - -0.809319 20.57
0.4670647
4 0.7861697 0 0.7687152 - - 20.57
0.2722714 0.4670642
5 0.7687152 0 0.7586731 - - 20.57
0.1593094 0.2722715
6 0.7586731 0 0.7528425 - - 20.57
0.0933554 0.1593089
7 0.7528425 0 0.7494412 - - 20.57
0.0547434 0.0933549
8 0.7494412 0 0.747452 - - 20.57
0.0321118 0.0547429
 9 0.747452 0 0.746287 - - 20.57
0.0188397 0.0321118
10 0.746287 0 0.7456041 - -0.01884 20.57
0.0110543
11 0.7456041 0 0.7452036 - - 20.57
0.0064864 0.0110543
12 0.7452036 0 0.7449687 -0.003806 - 20.57
0.0064861
13 0.7449687 0 0.7448309 - -0.003806 20.57
0.0022334
14 0.7448309 0 0.74475 - -0.0022335 20.57
0.0013107
15 0.74475 0 0.7447026 - -0.0013103 20.57
0.0007689
16 0.7447026 0 0.7446748 -0.0004514 -0.0007693 20.57

d. Metode Iterasi Sederhana

x f(x) Galat
1 3.95 2.95
3.95 13.663606 9.7136055
13.663606 20.921369 7.2577635
20.921369 22.201031 1.2796625
22.201031 22.344029 0.1429977
22.344029 22.359038 0.015009
22.359038 22.360603 0.0015648
22.360603 22.360766 0.0001628
22.360766 22.360783 0.0000168

e. Metode Newton Raphson

Iterasi x f(x) f’(x)
0 1 -2.95 -13.08
1 0.7744648 -0.3366317 -11.175775
2 0.7443432 0.0033333 -11.416806
3 0.7446352 -1.847D-08 -11.4139

f. Metode Secant
Iteras X0 X1 Y0 Y1 X2 Y2
i
1 0 1 20.57 -2.95 0.874574 -
8 1.446859
9
2 1 0.874574 -2.95 - 0.753845 -
8 1.446859 8 0.104724
5 6
3 0.874574 0.753845 - - 0.744425 0.002393
8 8 1.446859 0.104724 5 6
5 6
 4 0.753845 0.744425 - 0.002393 0.744636 -
8 5 0.104724 7 0.000009
6 2

Sehingga dapat disimpulkan berdasarkan data yang telah diperoleh, metode yang
paling efisien dalam mencari akar persamaan di atas yaitu metode Newton-Raphson dan
Secant hanya dengan 4 kali iterasi.

SIMULASI