高斯消元法类头及其实现.doc

高斯消元法类头文件及其实现/matrix.h#ifndef _M_H#define _M_H#include#include#include#includeusing namespace std;class matrixGuessprivate:int level;vector coefficient; /系数aijdouble *result; /未知数xvector b;public:void solving(); /求解int getMaxInColumn(int k); /最大元查找void swapLine(int k,int i); /行交换void normalization(int k); /归一化void elimination(int k); /消元void setLevel(int l);void setCofficient(vector &c);void setB(vector &b_);double * getResult();int getLevel();#endif/ matrix.cpp#includematrix.hvoid matrixGuess:solving()int k=0;int i;while(k=0)double sum=0;for(int j=k+1;jlevel;j+)sum+=coefficientk*level+j*resultj;ans=bk-sum;resultk=ans;k-;int matrixGuess:getMaxInColumn(int k)int i=k;int tagI=k;int max=fabs(coefficienti*level+k);while(ilevel)if(maxfabs(coefficienti*level+k)max=fabs(coefficienti*level+k);tagI=i;i+;return tagI;void matrixGuess:swapLine(int k,int i)int j=k+1;swap(coefficientk*level+k,coefficienti*level+k);while(jlevel)swap(coefficientk*level+j,coefficienti*level+j);j+;swap(bk,bi);void matrixGuess:normalization(int k)int j=k+1;while(jlevel)coefficientk*level+j/=coefficientk*level+k;j+;bk/=coefficientk*level+k;coefficientk*level+k=1;void matrixGuess:elimination(int k)int i=k+1;while(ilevel)for(int j=k+1;jlevel;j+)coefficienti*level+j-=coefficienti*level+k*coefficientk*level+j;bi-=coefficienti*level+k*bk;coefficienti*level+k=0;i+;void matrixGuess:setCofficient(vector &c)this-coefficient.clear();for(int i=0;icoefficient.push_back(ci);void matrixGuess:setLevel(int l)this-level=l;this-result=new doublelevel;double * matrixGuess:getResult()return this-result;void matrixGuess:setB(vector &b_)this-b.clear();for(int i=0;ilevel;i+)b.push_back(b_i);int matrixGuess:getLevel()return this-level;追赶法头文件及其实现/ CHASE.H#ifndef _X_H#define _X_H#includeusing namespace std;class diagonalMatrixprivate:int level; /阶数double *a,*b,*c; /存储首地址 存放系数矩阵double *f; /行列式合存放首地址double *ans; /结果存放public:void solving();void setLevel(int l);void setABCf(double *A,double *B,double *C,double *F);double * getAns();int getLevel();#endif/ CHASE.cpp#includeCHASE.hvoid diagonalMatrix:solving()/a-/b-/c-c0=c0/b0; /LU分解 ， 直接将数据存储在原本空间中for(int i=1;ilevel-1;i+)bi=bi-ai*ci-1;ci=ci/bi;bi=bi-ai*ci-1; /LU分解结束ans0=f0/b0;for(i=1;i=0;i-) /求解xiansi=ansi-ci*ansi+1;void diagonalMatrix:setLevel(int l)this-level=l;a=new doublelevel;b=new doublelevel;c=new doublelevel;f=new doublelevel;ans=new doublelevel;void diagonalMatrix:setABCf(double *A,double *B,double *C ,double *F)for(int i=0;