雅克比迭代法和高斯-赛德尔法解线性方程组(C++)

作业：①

分别用J 法和G-S 法求解下列方程，并讨论结果。 123122*********x x x -?????? ??? ?= ??? ? ??? ???????

#include

using namespace std;

//J 法解线性方程

int main(){

int m,n,i,j,times=0,mtimes;

double s,sum,max;

cout<<"请输入系数矩阵行数m 、列数n ："<>m>>n;

if(m

cout<<"方程组无唯一解！"<

double **A=new double *[m];

for (i=0; i

A[i] =new double [n];

}

double *B=new double [m];

double *X=new double [m];

double *T=new double [m];

double *S=new double [m];

cout<<"请输入系数矩阵A ："<

for(i=0;i

for(j=0;j

cin>>A[i][j];

cout<<"请输入常数向量B ："<

for(i=0;i

cin>>B[i];

cout<<"请输入最大允许误差s:"<>s;

cout<<"请输入最大迭代次数:"<

cin>>mtimes;

cout<<"请输入一零级向量X:"<

for(i=0;i

cin>>X[i];

T[i]=X[i];//T[]存放上一次迭代结果 }

do{

for(i=0;i

sum=0;

for(j=0;j

if(j!=i)

sum+=A[i][j]*T[j];

X[i]=(B[i]-sum)/A[i][i];

S[i]=(T[i]-X[i])*(T[i]-X[i]);

}

for(i=0;i

T[i]=X[i];

times++;

max=S[0];

for(i=1;i

if(S[i]>max)

max=S[i];

}while((max>s*s)&&(times

cout<<"该方程组的解为："<

for(i=0;i

cout<

cout<

for (i=0; i

delete[] A[i];

A[i]=NULL;

}

delete[] A; A=0;

delete[] B; B=0;

delete[] T; T=0;

delete[] X; X=0;

delete[] S; S=0;

return 0;

}

#include

using namespace std;

//G-S法解线性方程

int main(){

int m,n,i,j,times=0,mtimes;

double s,sum,sum1,max;

cout<<"请输入系数矩阵行数m、列数n："<

cin>>m>>n;

if(m

cout<<"方程组无唯一解！"<

double **A=new double *[m];

for (i=0; i

A[i] =new double [n];

}

double *B=new double [m];

double *X=new double [m];

double *T=new double [m];

double *S=new double [m];

cout<<"请输入系数矩阵A："<

for(i=0;i

for(j=0;j

cin>>A[i][j];

cout<<"请输入常数向量B："<

for(i=0;i

cin>>B[i];

cout<<"请输入最大允许误差s:"<

cin>>s;

cout<<"请输入最大迭代次数:"<

cin>>mtimes;

cout<<"请输入一零级向量X:"<

for(i=0;i

cin>>X[i];

T[i]=X[i];//T[]存放上一次迭代结果}

do{

for(i=0;i

sum=sum1=0;

for(j=0;j

sum+=A[i][j]*X[j];

for(j=i+1;j

sum1+=A[i][j]*T[j];

X[i]=(B[i]-sum-sum1)/A[i][i];

S[i]=(T[i]-X[i])*(T[i]-X[i]);

}

for(i=0;i

T[i]=X[i];

times++;

max=S[0];

for(i=1;i

if(S[i]>max)

max=S[i];

}while((max>s*s)&&(times

cout<<"该方程组的解为："<

for(i=0;i

cout<

cout<

for (i=0; i

delete[] A[i];

A[i]=NULL;

}

delete[] A; A=0;

delete[] B; B=0;

delete[] T; T=0;

delete[] X; X=0;

delete[] S; S=0;

return 0;

}