本程序为本人参考一些资料后编写,在visual c++6.0下调试通过。[@more@]/
/拉格朗日一元N点插值
/
#include
using namespace std;
///
///
double LAG1(int n,double x,double *tx,double *ty);
///
///
int main()
{
int i,n;
double x,y;
cout<>n;
while(n<2)
{
cout< cout<>n;
}
double *tx=new double[n];
double *ty=new double[n];
cout< for(i=0;i {
cout<>tx[i];
cout<>ty[i];
cout< }
cout<>x;
cout< y=LAG1(n,x,tx,ty);
cout< delete [] tx;
delete [] ty;
return 0;
}
///
///
double LAG1(int n,double x,double *tx,double *ty)
{
double y=0.0;
int i,j;
double *l=new double[n];
for(i=0;i {
for(j=0;j {
if(j!=i)
l[i]=(x-tx[j])/(tx[i]-tx[j]);
}
cout< y+=l[i]*ty[i];
}
delete [] l;
return (y);
}
//
/拉格朗日一元N点插值
/
#include
using namespace std;
///
///
double LAG1(int n,double x,double *tx,double *ty);
///
///
int main()
{
int i,n;
double x,y;
cout<>n;
while(n<2)
{
cout< cout<>n;
}
double *tx=new double[n];
double *ty=new double[n];
cout< for(i=0;i {
cout<>tx[i];
cout<>ty[i];
cout< }
cout<>x;
cout< y=LAG1(n,x,tx,ty);
cout< delete [] tx;
delete [] ty;
return 0;
}
///
///
double LAG1(int n,double x,double *tx,double *ty)
{
double y=0.0;
int i,j;
double *l=new double[n];
for(i=0;i {
for(j=0;j {
if(j!=i)
l[i]=(x-tx[j])/(tx[i]-tx[j]);
}
cout< y+=l[i]*ty[i];
}
delete [] l;
return (y);
}
//
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/11355887/viewspace-974950/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/11355887/viewspace-974950/