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

作业： 分别用J法和G-S法求解下列方程，并讨论结果。#includeusing namespace std;/J法解线性方程int main()int m,n,i,j,times=0,mtimes;double s,sum,max; cout请输入系数矩阵行数m、列数n：mn;if(mn)cout方程组无唯一解！endl;double *A=new double *m; for (i=0; im; i+) Ai =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：endl;for(i=0;im;i+)for(j=0;jAij; cout请输入常数向量B：endl;for(i=0;iBi; cout请输入最大允许误差s:s;cout请输入最大迭代次数:mtimes; cout请输入一零级向量X:endl; for(i=0;iXi; Ti=Xi;/T存放上一次迭代结果dofor(i=0;im;i+)sum=0;for(j=0;jn;j+)if(j!=i)sum+=Aij*Tj; Xi=(Bi-sum)/Aii;Si=(Ti-Xi)*(Ti-Xi);for(i=0;im;i+)Ti=Xi; times+;max=S0;for(i=1;imax)max=Si;while(maxs*s)&(timesmtimes);cout该方程组的解为：endl;for(i=0;im;i+)coutXi ;coutendl迭代次数为:timesendl; for (i=0; im; i+) delete Ai; Ai=NULL; delete A; A=0; delete B; B=0;delete T; T=0;delete X; X=0;delete S; S=0; return 0;#includeusing namespace std;/G-S法解线性方程int main()int m,n,i,j,times=0,mtimes;double s,sum,sum1,max; cout请输入系数矩阵行数m、列数n：mn;if(mn)cout方程组无唯一解！endl;double *A=new double *m; for (i=0; im; i+) Ai =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：endl;for(i=0;im;i+)for(j=0;jAij; cout请输入常数向量B：endl;for(i=0;iBi; cout请输入最大允许误差s:s;cout请输入最大迭代次数:mtimes; cout请输入一零级向量X:endl; for(i=0;iXi; Ti=Xi;/T存放上一次迭代结果dofor(i=0;im;i+)sum=sum1=0;for(j=0;ji;j+) sum+=Aij*Xj; for(j=i+1;jn;j+) sum1+=Aij*Tj; Xi=(Bi-sum-sum1)/Aii; Si=(Ti-Xi)*(Ti-Xi); for(i=0;im;i+)Ti=Xi;times+;max=S0;for(i=1;imax)max=Si;while(maxs*s)&(timesmtimes);cout该方程组的解为：endl;for(i=0;im;i+)coutXi ;coutendl迭代次数为:timesendl; for (i=0; im; i+) delete Ai; Ai=NUL