python统计分析中文版托马斯.pdf_三对角矩阵算法（TDMA）又名托马斯算法，在NumPy数组中使用Python...

function x = TDMAsolver(a,b,c,d)

%a, b, c are the column vectors for the compressed tridiagonal matrix, d is the right vector

n = length(b); % n is the number of rows

% Modify the first-row coefficients

c(1) = c(1)/b(1); % Division by zero risk.

d(1) = d(1)/b(1); % Division by zero would imply a singular matrix.

for i = 2:n-1

temp = b(i) - a(i) * c(i-1);

c(i) = c(i)/temp;

d(i) = (d(i) - a(i) * d(i-1))/temp;

end

d(n) = (d(n) - a(n) * d(n-1))/(b(n) - a(n) * c(n-1));

% Now back substitute.

x(n) = d(n);

for i = n-1:-1:1

x(i) = d(i) - c(i) * x(i + 1);

end

end

我需要它在python中使用numpy数组，这里我第一次尝试在python中的算法。

import numpy

aa = (0.,8.,9.,3.,4.)

bb = (4.,5.,9.,4.,7.)

cc = (9.,4.,5.,7.,0.)

dd = (8.,4.,5.,9.,6.)

ary = numpy.array