NPM 140310200055
Solusi PL dengan Iterasi Jacobi dan Iterasi Gauss Seidel, bandingkan kecepatan
konvergennya
a. Script Program
Metode Gauss-Seidel
a. Script Program
b. Tampilan
Metode Iterasi Jacobi
a. Script Program
A=[[6, -2, 2, 4], [12, -8, 6, 10], [3, 13, 9, 3], [-6, 4, 1, -18]]
B=[16, 26, -19, -34]
x=[0, 0, 0, 0]
E=1
iterasi=0
j=0
n=len(x)
xb=[]
print("nilai yang diperoleh adalah: \n")
while E>0.00001:
for i in range(0, n):
sigma=0
for j in range(0, i): sigma=sigma+A[i]
[j]*x[j]
for j in range(i+1, n):
sigma=sigma+A[i][j]*x[j]
x1=(1/A[i][i])*(B[i]-sigma)
xb.append(x1)
E=abs(max(x)-max(xb))
x=xb
iterasi=iterasi+1
xb = []
print(x)
print("jumlah iterasi: %d" %iterasi)
b. Tampilan
Metode Gauss-Seidel
a. Script Program
A=[[6, -2, 2, 4], [12, -8, 6, 10], [3, 13, 9, 3], [-6, 4, 1, -18]]
B=[16, 26, -19, -34]
x=[0, 0, 0, 0]
E=1
iterasi=0
j=0
n=len(x)
xb=[]
print("nilai yang diperoleh adalah: \n")
while E>0.00001:
for i in range(0, n):
sigma=0
for j in range(0, i):
sigma=sigma+A[i][j]*xb[j]
for j in range(i+1, n):
sigma=sigma+A[i][j]*x[j]
x1=(1/A[i][i])*(B[i]-sigma)
xb.append(x1)
E=abs(max(x)-max(xb))
x=xb
iterasi=iterasi+1
xb = []
print(x)
print("jumlah iterasi: %d" %iterasi)
b. Tampilan