VC最小二乘法求解方程数多于未知变量的线性方程组.docVIP

c语言实现,用最小二乘法求解方程数多于未知变量的线性方程组的最适解(即矛盾方程组) 收藏 一、代码： /*************************************************************************** * ArgMin.h * Author * Fri Aug 5 17:18:47 2005 * Copyright 2005 * Email ****************************************************************************/ #include stdio.h #include math.h /* Interface */ //solve the linear equations using argmin method int ArgMin(double *inMtrx,int COLUMN,int rowNum,int colNum,double *solution); //Solve a series of linear equations int SolveLinearEqts(double *inMtrx,int COLUMN,int rowNum,int colNum,double *solution); //Elimination of unknowns int ReduceUnknowns(double *mtrx_tmp,int COLUMN,int rowNo,int colNo,int rowNum,int colNum); /* Begin Coding */ //ArgMin using solvelineareqts. int ArgMin(double *mtrx_tmp,int COLUMN,int rowNum,int colNum,double *solution) { int k,l,j; double *eqt; int *q; q=colNum; eqt=(double *)malloc(colNum*colNum*sizeof(double)); //printf(%d,*q); for(k=0;k*q-1;k++) for(l=0;l*q-1;l++) { eqt[k*COLUMN+l]=0; for(j=0;jrowNum;j++) eqt[k*COLUMN+l]+=*(mtrx_tmp+COLUMN*j+k)*(*(mtrx_tmp+COLUMN*j+l)); } for(k=0;k*q-1;k++) { eqt[k*COLUMN+*q-1]=0; for(j=0;jrowNum;j++) eqt[k*COLUMN+*q-1]+=*(mtrx_tmp+COLUMN*j+*q-1)*(*(mtrx_tmp+COLUMN*j+k)); } /* show the contents of eqts */ /*int m,n; printf(eqt:\n); for(m=0;m*q-1;m++) { for(n=0;n*q;n++) printf(%.2lf\t,eqt[m*COLUMN+n]); printf(\n); }*/ if(!SolveLinearEqts(eqt,COLUMN,(*q-1),*q,solution)) { return 0; } return 1; } //Solve the solution of a series of linear equations int SolveLinearEqts(double *inMtrx,int COLUMN,int rowNum,int colNum,double *solution) { int i,j; double tmpSum; if(rowNum!=(colNum-1)) { printf(Cant solve the equations because equation number ); printf(is not the same as unknow parameters!\n); return 0; } //reduce unknown parameters for(i=0;icolNum-2;i++)