python实现追赶法

数学原理

链接: link

python代码

'''
功能：求解线性方程组Ax=b，且A=[b1  c1  0   0   0   0
                             a1  b2  c2  0   0   0
                             0   a2  b3  c3  0   0
                             0   0   a3  b4  c4  0
                             0   0   0   a4  b5  c5
                             0   0   0   0   a5  b6]
                        b=[b1,b2,b3,b4,b5,b6]
输入：a=[a1,a2,a3,a4,a5],b[b1,b2,b3,b4,b5,b6],c=[c1,c2,c3,c4,c5],b=[b1,b2,b3,b4,b5,b6]
输出：线性方程组的解向量x
'''

import numpy as np


def thomas(a, b, c, d)
    n = len(b)
    beta = np.ones(n) * b[0]
    y = np.ones(n) * d[0]
    for i in range(1, n):
        beta[i] = b[i] - (a[i - 1] / beta[i - 1]) * c[i - 1]
        y[i] = d[i] - (a[i - 1] / beta[i - 1]) * y[i - 1]
    x = np.ones(n) * y[-1] / beta[-1]
    iter = np.linspace(n - 2, 0, n - 1)
    for i in iter:
        i = int(i)
        x[i] = (y[i] - c[i] * x[i + 1]) / beta[i]
    print("解向量x:{}".format(x))


a = np.array([-1, -1, -3])
b = np.array([2, 3, 2, 5])
c = np.array([-1, -2, -1])
d = np.array([6, 1, 0, 1])
thomas(a, b, c, d)

注：为了编写方便，代码对数学公式进行了一些修改，如代码中a，c阵都是从0开始n-1结束