python实现jacobi/雅克比迭代_记录计算物理课后作业第三弹

最新推荐文章于 2024-07-09 12:00:00 发布

baishou002

最新推荐文章于 2024-07-09 12:00:00 发布

阅读量213

点赞数

文章标签： python 算法

本文链接：https://blog.csdn.net/baishou002/article/details/108068896

版权

依旧是计算一元线性方程组的方法，即jacobi迭代法

a = [[5,0,0,-3,-1],[-1,4,0,0,-1],[0,0,2,-1,0],[-1,0,0,4,-2],[0,0,0,-1,2]]
b = [2,3,-1,0,-1]

m,n = len(a),len(a[0])         #m行,n列
end_num = 0.000000000001
es = [0] * n
intal = [0] * n
l = 1

while l <=100:        #迭代nxl
    for i in range(m):
        temp = 0
        for j in range(n):
            if i != j:
                temp = temp + a[i][j] * intal[j]
        x_temp = (b[i] - temp)/a[i][i]
        es[i] = abs(x_temp - intal[i])
        intal[i] = x_temp
    print('迭代次数：',l,intal)
    if max(es) < end_num:
        break
    l += 1