[Python] python计算牛顿迭代多项式 →→→→→进入此内容的聊天室

来自 , 2020-07-14, 写在 Python, 查看 154 次.
URL http://www.code666.cn/view/9fb2c3bd
  1. ''' p = evalPoly(a,xData,x).
  2.    Evaluates Newton's polynomial p at x. The coefficient
  3.    vector 'a' can be computed by the function 'coeffts'.
  4.  
  5.    a = coeffts(xData,yData).
  6.    Computes the coefficients of Newton's polynomial.
  7. '''    
  8. def evalPoly(a,xData,x):
  9.     n = len(xData) - 1  # Degree of polynomial
  10.     p = a[n]
  11.     for k in range(1,n+1):
  12.         p = a[n-k] + (x -xData[n-k])*p
  13.     return p
  14.  
  15. def coeffts(xData,yData):
  16.     m = len(xData)  # Number of data points
  17.     a = yData.copy()
  18.     for k in range(1,m):
  19.         a[k:m] = (a[k:m] - a[k-1])/(xData[k:m] - xData[k-1])
  20.     return a
  21. #//python/7410

回复 "python计算牛顿迭代多项式"

这儿你可以回复上面这条便签

captcha