用高斯消去法解线性方程组C++程序及结果

用高斯消去法解线性方程组。设有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结束，进行以下步骤：首先，第k行第k列的数不能为0，若为0，则与下面不为0的行交换。将k行所有数除以第k行第k列的数.其次，进行消去：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)//构造函数 { index=dims;//保护数据赋值 MatrixA=newdouble[index*index];//动态内存分配 } ~Matrix() {delete[]MatrixA;}//内存释放 voidsetMatrix(double*rmatr)//设置矩阵值 { 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