高斯-赛德尔迭代法

#include

using namespace std;

int main()

{

int n,i,j,k=0,max;

float error,p,e;

cout

cin>>n;

float A[n][n+1],B[n][n+1],X[n],Y[n];

cout

for(j=0;j

cin>>A[i][j];

cout

cin>>max;

cout

cin>>e;

for(i=0;i

while(1)

{

error=0;

k++;

for(i=0;i

{

p=0;

for(j=0;j

{

if(i==j) continue;

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

}

Y[i]=(A[i][n]-p)/A[i][i];

error=error+fabs(Y[i]-X[i]);

X[i]=Y[i];

}

if(error

{

cout

for(i=0;i

}

if(k>=max)

{

cout

return 0;

} } }

#include

using namespace std;

int main()

{

int n,i,j,k=0,max;

float error,p,e;

cout

cin>>n;

float A[n][n+1],B[n][n+1],X[n],Y[n];

cout

for(j=0;j

cin>>A[i][j];

cout

cin>>max;

cout

cin>>e;

for(i=0;i

while(1)

{

error=0;

k++;

for(i=0;i

{

p=0;

for(j=0;j

{

if(i==j) continue;

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

}

Y[i]=(A[i][n]-p)/A[i][i];

error=error+fabs(Y[i]-X[i]);

X[i]=Y[i];

}

if(error

{

cout

for(i=0;i

}

if(k>=max)

{

cout

return 0;

} } }