黑松山资源网 Design By www.paidiu.com

本文实例讲述了python计算牛顿迭代多项式的方法。分享给大家供大家参考。具体实现方法如下:

''' p = evalPoly(a,xData,x).
  Evaluates Newton's polynomial p at x. The coefficient
  vector 'a' can be computed by the function 'coeffts'.
  a = coeffts(xData,yData).
  Computes the coefficients of Newton's polynomial.
'''  
def evalPoly(a,xData,x):
  n = len(xData) - 1 # Degree of polynomial
  p = a[n]
  for k in range(1,n+1):
    p = a[n-k] + (x -xData[n-k])*p
  return p
def coeffts(xData,yData):
  m = len(xData) # Number of data points
  a = yData.copy()
  for k in range(1,m):
    a[k:m] = (a[k:m] - a[k-1])/(xData[k:m] - xData[k-1])
  return a

希望本文所述对大家的Python程序设计有所帮助。

黑松山资源网 Design By www.paidiu.com
广告合作:本站广告合作请联系QQ:858582 申请时备注:广告合作(否则不回)
免责声明:本站资源来自互联网收集,仅供用于学习和交流,请遵循相关法律法规,本站一切资源不代表本站立场,如有侵权、后门、不妥请联系本站删除!
黑松山资源网 Design By www.paidiu.com