111
This commit is contained in:
@@ -71,14 +71,14 @@ def IterativeMethod(A, b, err, N):
|
||||
A_c = [[A[i][j] for j in range(len(A[0]))] for i in range(len(A))]
|
||||
d1 = SovleRowMain(A_c, r1,4)[3]
|
||||
x0 = [x0[i] + d1[i] for i in range(len(x0))]
|
||||
print(f"第{count+1}次迭代, x{count+2} = {x0}, r{count+1} = {r1}, d{count+1} = {d1}")
|
||||
print(f"第{count+1}次迭代, r{count+1} = {r1}, d{count+1} = {d1}, x{count+2} = {x0}")
|
||||
err_now = max(abs(r1[i]) for i in range(len(r1)))
|
||||
count += 1
|
||||
if err_now < err:
|
||||
break
|
||||
return x0,count
|
||||
|
||||
|
||||
#把矩阵换成题干的矩阵,b换成题干结果,err精度要求修改##########################
|
||||
if __name__ == "__main__":
|
||||
A = [
|
||||
[51,82],
|
||||
@@ -91,5 +91,5 @@ if __name__ == "__main__":
|
||||
|
||||
x = IterativeMethod(A, b, err, N)[0]
|
||||
print(f"解为: {x}")
|
||||
|
||||
#先用15题的代码求范数与逆矩阵
|
||||
|
||||
|
||||
Reference in New Issue
Block a user