高斯赛德尔迭代算法C.docx

高斯赛德尔迭代算法C++实现

依据公式

(i=1,2,…,n)

#include

#include

stdafx.h

iostream

#includeiomanip

usingnamespacestd;

intmain()

inti,j,k=0,m,n;

doublet1,t2,el,e2=0.0;

cout请输入精度e:;

cinel;

cout请输入系数矩阵行数：;

cinm;

cout请输入系数矩阵列数：;

cinn;

coutendl;

double(**a)=newdouble*[m];//生成二维动态数组

for(i=0;i=m;i++)

a[i]=newdouble[n];

double(*b)=newdouble[m];

double(*x)=newdouble[n];

cout请输入系数矩阵：endl;

cout-----------------------------------------------------endl;

for(intnuml=0;num1m;num1++)

for(intnum2=0;num2n;num2++)

{

cina[numl][num2];

coutendl;

cout输入的系数矩阵为：endl;

for(intnum3=0;num3m;num3++)

for(intnum4=0;num4n;num4++)

couta[num3][num4]

coutendl;

cout-----------------------------------------endl;

cout请输入矩阵b:endl;

cout-------------------------------------------------------------endl;

for(intnum5=0;num5m;num5++)

cinb[num5];

cout输入的矩阵b为：endl;

for(intnum6=0;num6m;num6++)

coutb[num6];

coutendl;

cout------------------

for(intnum7=0;num7n;num7++)

endl

x[num7]=0.0000

do

cout第k次迭代值：;

e2=0.0;

for(i=0;im;i++)

doublesum=0.0;

for(j=0;jn;j++)

if(j!=i)

sum+=a[i][j]*x[j];

tl=x[i];

t2=e2;

x[i]=(b[i]-sum)/a[i][i];

e2=(x[i])-tl=0?(x[i])-t1:t1-(x[i]);

e2=(e2=t2?e2:t2);

coutsetprecision(8)x[i]

}

coutendl;

k++;

}while(e2=elk30);

cout共迭代了k次;

delete[]a;

delete[]b;

delete[]x;

return0;