三次样条插值算法.docVIP

//三次样条插值算法 #includeiostream.h void main() { cout输入节点个数:; int num; cinnum; int n=num-1; double *x=new double[num]; double *y=new double[num]; cout按序依次输入各处节点及函数值endl; for(int i=0;i=n;i++) cinx[i]y[i]; double *h=new double [num]; for(i=0;i=n-1;i++) h[i]=x[i+1]-x[i]; double *a1=new double[num]; double *b1=new double[num]; cout请输入边界。按1输入第一种边界条件,按2输入第二种边界条件: ; int pd; cinpd; if(pd==1) { cout按顺序输入两端点的微商:endl; int k1,k2; cink1k2; a1[0]=0;a1[n]=1;b1[0]=2*k1;b1[n]=2*k2; } else { cout按顺序输入两端点的二阶微商:endl; int t1,t2; cint1t2; a1[0]=1;a1[n]=0;b1[0]=3*(y[1]-y[0])/h[0];b1[n]=3*(y[n]-y[n-1])/h[n-1]; } for(i=1;i=n-1;i++) { a1[i]=h[i-1]/(h[i-1]+h[i]); b1[i]=((1-a1[i])*(y[i]-y[i-1])/h[i-1]+a1[i]*(y[i+1]-y[i])/h[i])*3; } double*a2=new double[num]; double*b2=new double[num]; a2[0]=-a1[0]/2;b2[0]=b1[0]/2; for(i=1;i=n;i++) { a2[i]=-a1[i]/(2+(1-a1[i])*a2[i-1]); b2[i]=(b1[i]-(1-a1[i])*b2[i-1])/(2+(1-a1[i])*a2[i-1]); } double *m=new double[n+2]; m[n+1]=0; for(i=n;i=0;i--) { m[i]=a2[i]*m[i+1]+b2[i]; } cout输入所要求的点:endl; int xx; cinxx; for(i=0;i=n-1;i++) { if(x[i]=xxxx=x[i+1]) break; } if(i=n-1) { double kk; kk=(1+2*(xx-x[i])/(x[i+1]-x[i]))*(xx-x[i+1])*(xx-x[i+1])*y[i]/(x[i]-x[i+1])/(x[i]-x[i+1])+ (1+2*(xx-x[i+1])/(x[i]-x[i+1]))*(xx-x[i])*(xx-x[i])*y[i+1]/(x[i+1]-x[i])/(x[i+1]-x[i])+ (xx-x[i])*(xx-x[i+1])*(xx-x[i+1])*m[i]/(x[i]-x[i+1])/(x[i]-x[i+1])+ (xx-x[i+1])*(xx-x[i])*(xx-x[i])*m[i+1]/(x[i+1]-x[i])/(x[i+1]-x[i]); coutxx的函数近似值为kkendl; } else { cout输入的值超出范围.endl; } } 用以上算法解问题1：给定y=f (x)的函数表如下，边界条件为s’’(75)=0,s’’(80)=0，用三次样条插值求f(78.3)的近似值。 x 75 76 77 78 79 80 f (x) 2.768 2.833 2.903 2.979 3.062 3.153 程序运行结果如下： 用以上算法解问题2：给定函数y=f (x)的函数表如下，边界条件s’(0.25)=1，s’(0.53)=0.6868,用三次样条插值算法求f (0.35)的近似值。 x 0.25 0.3 0.39 0.45 0.53 y=f (x) 0.5 0.5477 0.6245 0.6708 0.728 程序运行结果如下：