目录
1、概述
逐次超松弛迭代法是在高斯赛德尔迭代法的基础上发展而来的,高斯赛德尔迭代法上一节我们已经讲过了,可以对比起来看。然后逐次超松弛迭代法中有一个很重要的思想:权重思想。我们下面直接上代码:
2、代码
import numpy as np
##超松弛迭代法
def SOR(n, A, B, x0, x, eps, k, w):
times = 0
while times < k:
for i in range(n):
temp = 0
temps = x0.copy()
for j in range(n):
if i != j:
temp += x0[j] * A[i][j]
x[i] = (1-w)*x[i]+w * ((B[i] - temp) / A[i][i])
x0[i] = x[i].copy()
calTemp = max(abs(x - temps))
times += 1
if calTemp < eps:
print("精确度等于{0}时,逐次超松弛迭代法需要迭代{1}次收敛".format(eps,times))
return (x, times)
else:
x0 = x.copy()
print("在最大迭代次数内不收敛", "最大迭代次数后的结果为", x)
return None
def main():
k = 100 # 最大迭代次数
n = 3
w=1.005
A = np.array([[8,-1,1], [2,10,-1], [1,1,-5]])
B = np.array([1,4,3])
x0 = np.array([1.0, 1, 1])
x = np.array([0.0, 0, 0])
eps = 10 ** (-3)
Sor=SOR(n, A, B, x0, x, eps, k, w)
print('come on...............................')
print("迭代值为:",Sor)
if __name__ == '__main__':
main()
3、结果
精确度等于0.001时,逐次超松弛迭代法需要迭代4次收敛
come on...............................
迭代值为: (array([ 0.22502629, 0.30559256, -0.49387565]), 4)
Process finished with exit code 0