用高斯消去法解線性方程組C++程序及結(jié)果

用高斯消去法解線性方程組。設(shè)有n元線性方程組如下：aa00x0+a01x1+…+a0,n-1xn-1=b0a10x0+a11x1+…+a1,n-1xn-1=b1…An-1,0x0+an-1,1x1+…+an-1,n-1xn-1=bn-1算法：對于k從0開始到n-2結(jié)束，進行以下步驟：首先，第k行第k列的數(shù)不能為0，若為0，則與下面不為0的行交換。將k行所有數(shù)除以第k行第k列的數(shù).其次，進行消去：a[i][j]=a[i][j]-a[i][k]*a[k][j],j,i=k+1,k+2,…，n-1b[i]=b[i]-a[i][k]*b[k],i=k+1,k+2,……,n-1最后，回代過程x[n-1]=b[n-1]/a[n-1][n-1]x[i]=b[i]-∑a[i][j]x[j],I=n-2,…1,0定義一個矩陣類Matrix作為基類，然后由矩陣類派生出線性方程組類Linequ。程序清單：#include<iostream>#include<cmath>usingnamespacestd;classMatrix//定義矩陣類{public: Matrix(intdims=2)//構(gòu)造函數(shù) { index=dims;//保護數(shù)據(jù)賦值 MatrixA=newdouble[index*index];//動態(tài)內(nèi)存分配 } ~Matrix() {delete[]MatrixA;}//內(nèi)存釋放 voidsetMatrix(double*rmatr)//設(shè)置矩陣值 { for(inti=0;i<index*index;i++) {*(MatrixA+i)=rmatr[i];}//矩陣成員賦初值 } voidprintM();//顯示矩陣protected: intindex; double*MatrixA;};classLinequ:publicMatrix//線性方程組類{public: Linequ(intdims=2):Matrix(dims) { sums=newdouble[dims]; solu=newdouble[dims]; }~Linequ(); voidsetLinequ(double*a,double*b);//方程賦值 voidprintL();//顯示方程 intSolve();//高斯消元法求解 voidshowX();//輸出方程的解private: double*sums; double*solu;};voidMatrix::printM()//顯示矩陣的元素{ cout<<"TheMatrixis:"<<endl; for(inti=0;i<index;i++) { for(intj=0;j<index;j++) cout<<*(MatrixA+i*index+j)<<""; cout<<endl; }}Linequ::~Linequ(){ delete[]sums; delete[]solu;}voidLinequ::setLinequ(double*a,double*b)//方程賦值{ setMatrix(a); for(inti=0;i<index;i++) sums[i]=b[i]; {2,-0.5,-0.5,0,-0.5,2,0,-0.5,-0.5,0,2,-0.5,0,-0.5,-0.5,2}; doubleb[4]={0,3,3,0}; Linequequl(4); equl.setLinequ(a