C++最小二乘法求多项式拟合曲线.doc

《C++最小二乘法求多项式拟合曲线.doc》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、//shujunihe.cpp:定义控制台应用程序的入口点。////quanzhuyuan.cpp:定义控制台应用程序的入口点。//#include"stdafx.h"#include#include#includeusingnamespacestd;classshujunihe{public:shujunihe():xlh(0),fyl(false),cnt(0),n(9){}voidprintb(double(&)[3]);voidprinta(double[3][3]);void

2、printx(doublex[3],doublea[3][3],doubleb[3],intn);voidquanzhuyuan(doublea[3][3],doubleb[],intx2[3]);voidrestoreA(doublea[3][3],doublex[]);doubleSum(intr,intc,double[]);doubleSumf(intr,doublef[],doublex[]);voidrestoreB(doubleb[],doublef[],doublex[]);voidprintx2(intx[]);pr

3、ivate:intxlh;boolfyl;intcnt;intn;};voidshujunihe::printx2(intx2[]){for(inti=0;i<3;i++)cout<

4、or(inti=0;i<=n-1;i++){sum+=f[i]*pow(x[i],r);}returnsum;}doubleshujunihe::Sum(intr,intc,doublex[]){doublesum=0;for(inti=0;i<=n-1;i++){sum+=pow(x[i],r+c);}returnsum;}voidshujunihe::restoreA(doublea[3][3],doublex[]){for(inti=0;i<=2;i++){for(intj=0;j<=2;j++){a[i][j]=Sum(i,j

5、,x);}}a[0][0]=n;}voidshujunihe::quanzhuyuan(doubled[3][3],doublec[3],intx2[3]){doublemax;introw,col;doubletemp1,temp2;inttemp3;doublebtemp1;for(inti=0;i<3;i++){max=fabs(d[i][i]);row=i;col=i;for(intj=i;j<3;j++){for(intk=i;k<3;k++){if(fabs(d[j][k])>max){max=fabs(d[j][k]);

6、row=j;col=k;}}}/*for(intn=0;n

7、;n++)//hang{temp1=d[i][n];d[i][n]=d[row][n];d[row][n]=temp1;btemp1=c[i];c[i]=c[row];c[row]=btemp1;}for(intm=0;m<3;m++)//lie{temp2=d[m][i];d[m][i]=d[m][col];d[m][col]=temp2;}}elseif(row!=i&&col==i){for(intn=0;n<3;n++)//hang{temp1=d[i][n];d[i][n]=d[row][n];d[row][n]=temp1

8、;btemp1=c[i];c[i]=c[row];c[row]=btemp1;}}elseif(col!=i&&row==i){fyl=true;for(intm=0;m<3;m++)//lie{xlh=col;temp