牛顿插值算法的实现

//牛顿插值算法
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
#define Length 10
double NewtonInterpolation(int n, double* x, double* y, double xi,double newtontime) {
	double sinx = 0.0;
	double DifQTable[Length][Length] = { 0 };
	for (int i = 0; i <= n; i++)
		DifQTable[0][i] = y[i];
	for (int i = 1; i <= n; i++) {
		for (int j = i; j <= n; j++) {
			DifQTable[i][j] = (DifQTable[i - 1][j] - DifQTable[i - 1][j - 1]) / (x[j] - x[j - i]);
		}
	}
	for (int i = 0; i <= newtontime; i++) {
		double temp = DifQTable[i][i];
		for (int j = 0; j < i; j++) {
			temp *= xi - x[j];
		}
		sinx += temp;
	}
	return sinx;
}
int main() {
	int n;
	double x[Length], y[Length], xi;
	cout << "-------------录入数据-----------" << endl;
	cout << "请输入插值节点个数(从0开始):";
	cin >> n;
	cout << endl;
	for (int i = 0; i <= n; i++) {
		cout << "x[" << i << "]=";
		cin >> x[i];
		cout << "y[" << i << "]=";
		cin >> y[i];
		cout << endl;
	}
	cout << endl;
	cout << "-------------录入完毕------------" << endl;
	double newtontime;
	cout << "请输入所求newton插值多项式次数:";
	cin >> newtontime;
	cout << "请输入x的值:";
	cin >> xi;
	double sinx = NewtonInterpolation(n, x, y, xi, newtontime);
	cout << "根据Newton插值多项式计算sin(" << xi << ")=" << sinx << endl;
	double error;
	error = abs(sinx - sin(xi));
	cout << setprecision(1) << "sin(" << xi << ")近似值的绝对误差为:" << error << endl;
	system("pause");
	return 0;
}

  • 2
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值