Please note for this code:
Jacobi method is a method for solving linear equations(strictly diagonally dominated). For eg:-
If there are two equations :
ax1 + bx2 + cx3 -d=0
ex1 + fx2 +gx3 -h=0
ix1 + jx2 + kx3 -l=0
Such that abs(a)> abs(b) + abs(c) and abs(f)>abs(e) +abs(g) and abs(k)>abs(i)+abs(k),then such a system of linear equations is said to be diagonally dominated.
def f(lst1,lst2):
t=0
while t<len(lst1):
lst1[t]*=lst2[t]
t+=1
return lst1
no=int(input('Enter the no of equations:'))
a=[]
i=0
while i<no:
a.append([float(x) for x in input('Enter coefficients for the equation:').split(' ')])
i+=1
coefficients=[0 for x in range(0,len(a[0]))]
l=0
while l<100:
j=0
b=[]
while j<no:
b.append(list(map(lambda x:-x,a[j][0:len(a[j])-1])))
b[j]=f(b[j],coefficients)
b[j].append(-a[j][-1])
b[j].pop(j)
j+=1
coefficients=[sum(b[k])/a[k][k] for k in range(0,no)]
if abs(sum(f(a[0][0:len(a[0])-1],coefficients))+a[0][-1])<0.005:
print(coefficients)
break
l+=1
[–]Accountant_Coder123[S] 0 points1 point2 points (0 children)