计算方法 | NEWTON 插值

先引入差商的概念，类似一种迭代计算？

丢代码：

import numpy as np
data = [(0.4,0.41075),(0.55,0.57815),(0.65,0.69675),(0.8,0.88811),(0.9,1.02652)]

count = len(data)
N = [[0 for j in range(count-i)] for i in range(count)]
for i in range(count):
    N[0][i] = data[i][1]
print(N)
# 求差商表（关键点）
for i in range(1, len(N)):
    for j in range(len(N[i])):
        N[i][j] = (N[i-1][j+1] - N[i-1][j]) / (data[j+i][0] - data[j][0])
print(N)

# 差值x
x = 0.596
_sum = 0
for i in range(count):
    _mult = N[i][0]
    print(N[i][0],end="")
    for j in range(i):
        _mult *= x-data[j][0]
        print("(x-{})".format(data[j][0]),end= "")
    print("+")
    _sum += _mult
print(_sum)

over。