拉格朗日二元N点插值(C++版)

本程序为本人参考一些资料后编写，在visual c++6.0下调试通过。[@more@]/
/拉格朗日二元N点插值
/
#include
using namespace std;
//
//
double LAG2N(int n,int m,double *x,double *tx1,double *tx2,double *ty);
//
int main()
{
int i,j,n,m;
double x[2],y;
cout<>n;
cout<>m;
while(n*m<4)
{
cout< cout<>n;
cout<>m;
}
double *tx1=new double[n];
double *tx2=new double[m];
double *ty=new double[m];
cout< for(i=0;i for(j=0;j {
cout<>tx1[i];
cout<>tx2[j];
cout<>ty[i];
cout< }
cout<>x[0];
cout<>x[1];
cout< y=LAG2N(n,m,x,tx1,tx2,ty);
cout< delete [] tx1;
delete [] tx2;
delete [] ty;
return 0;
}
//
double LAG2N(int n,int m,double *x,double *tx1,double *tx2,double *ty)
{
double y=0.0;
int i,j;
double *lx1=new double[n];
double *lx2=new double[m];
for(i=0;i {
for(j=0;j {
if(j!=i)
lx1[i]=(x[0]-tx1[j])/(tx1[i]-tx1[j]);
}
}
for(i=0;i {
for(j=0;j {
if(j!=i)
lx2[i]=(x[1]-tx2[j])/(tx2[i]-tx2[j]);
}
}
for(i=0;i for(j=0;j {
y+=lx1[i]*lx2[j]*ty[i*m+j];
}
delete [] lx1;
delete [] lx2;
return (y);
}
//

来自 “ ITPUB博客 ” ，链接：http://blog.itpub.net/11355887/viewspace-974952/，如需转载，请注明出处，否则将追究法律责任。

转载于:http://blog.itpub.net/11355887/viewspace-974952/