给定一组数据(xi,yi)(i=0,1,2,...,n),以及边界条件S(x0)=M0,S(xn)=Mn,用三次样条插值方法计算在插值点x处的S(x)值,n+1表示节点个数。
三次样条插值法
#include "stdio.h"#define n 3
main()
{
int i, j, k;
float F[n + 1], X[n + 1], M[n + 1], h[n], A[n - 1], B[n - 1], C[n - 1], d[n - 1], xx, yy;
printf("输入插值节点");
for (i = 0; i <= n; i++)
{
printf("X[%d]=", i); scanf("%f", &X[i]);
}
printf("输入函数值");
for (int i = 0; i < n; i++)
{
printf("F[%d]=", i); scanf("%f", &F[i]);
}
printf("输入边界条件");
printf("M[0]="); scanf("%f", &M[0]);
printf("M[n]="); scanf("%f", &M[n]);
printf("输入插值点");
printf("xx="); scanf("%f", &xx);
for (i = 0; i < n - 1; i++)
{
d[i] = 6 * ((F[i + 2] - F[i]) / (h[i + 1] + h[i]) - (F[i + 1] - F[i]) / h[i]) / h[i + 1];
A[i] = h[i] / (h[i + 1] + h[i]);
C[i] = h[i + 1] / (h[i + 1] + h[i]);
B[i] = 2.0;
}
d[0] = d[0] - A[0] * M[0];
d[n - 2] = d[n - 2] - C[n - 2] * M[n];
//用追赶法解三对角线性方程组
M[1] = d[0];
for (i = 0; i < n - 1; i++)
{
A[i] = A[i] / B[i - 1];
B[i] = B[i] - A[i] * C[i - 1];
M[i + 1] = d[i] - A[i] * M[i];
}
M[n - 2] = M[n - 2] / B[n - 2];
for (i = n - 3; i >= 0; i--)
M[i] = (M[i] - C[i] * M[i + 1]) / B[i];
for (i = 0; i < n; i++)
{
if (xx > X[i] && xx < X[i + 1])
{
yy = pow(M[i] *(X[i + 1] - xx),3 )/ (6 * h[i]) + (F[i] - pow(M[i] * h[i],2) / 6)*(X[i + 1] - xx) / h[i];
yy = yy + (F[i + 1] - pow(M[i + 1] * h[i],2) / 6)*(xx - X[i]) / h[i] + pow(M[i + 1] * (xx - X[i]),3) / (6 * h[i]);
}
}
printf("输出结果 yy=%f", yy);
}