Roman_Schenk
/
HM1_Aufgabenserie10
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

solved Task 1

This commit is contained in:
schrom01 2022-12-08 14:31:50 +01:00
parent 6c4c492a45
commit b74e3eee77
2 changed files with 25 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
Schenk_Brandenberger_S10_Aufg1.pdf Normal file
View File

Binary file not shown.

25
Schenk_Brandenberger_S10_Aufg1.py Normal file
View File

@ -0,0 +1,25 @@
import numpy as np
print("*********Jacobi-Verfahren*********")
def Jacobi(A,b,x,steps):
L = np.tril(A,k=-1)
D = np.diag(np.diag(A))
R = np.triu(A, k=1)
for steps in range(steps):
x = -np.linalg.inv(D) @ (L + R) @ x + np.linalg.inv(D) @ b
#print(np.linalg.norm((-np.linalg.inv(D) @ (L + R)),np.inf))
return x
A = np.array([[8,5,2],[5,9,1],[4,2,7]])
b = np.array([[19],[5],[34]])
x = np.array([[1],[-1],[3]])
steps = 3
print(Jacobi(A,b,x,steps))
print("Sum of vector:")
#print(np.sum(Jacobi(A,b,x,steps)))
#print(np.linalg.norm(Jacobi(A,b,x,3)-Jacobi(A,b,x,2),np.inf)*7)
print(np.linalg.norm(Jacobi(A,b,x,3)-Jacobi(A,b,x,2),np.inf))
print((0.0001*0.125)/0.7693452380952384)