数据建模——迭代法求解Ax=b及其改进（高斯——塞尔德迭代法）

#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
#define maxn 3
#define tor 0.00001
double isve[maxn],iisve[maxn];
double B[maxn]={7,-21,15},D[maxn][maxn]={4,-1,1,4,-8,1,-2,1,5};
double compute(double a,double b,double c,double d,double e,double f)
{
    return 1.0*(e-a*c-d*b*1.0)/f;
}
double cmp()
{
    double xx=isve[0]-iisve[0];
    double yy=isve[1]-iisve[1];
    double zz=isve[2]-iisve[2];
    return sqrt(xx*xx+yy*yy+zz*zz);
}
void solve()
{
    isve[0]=1,isve[1]=2,isve[2]=3;
    do{
            iisve[0]=compute(D[0][1],D[0][2],isve[1],isve[2],B[0],D[0][0]);
            iisve[1]=compute(D[1][0],D[1][2],isve[0],isve[2],B[1],D[1][1]);
            iisve[2]=compute(D[2][0],D[2][1],isve[0],isve[1],B[2],D[2][2]);
            //cout<<D[0][0]<<" "<<D[0][1]<<" "<<isve[0]<<" "<<isve[1]<<" "<<B[2]<<" "<<D[2][2]<<endl;
            if(abs(cmp())<=tor) return ;
            memcpy(isve,iisve,sizeof(isve));
    }while(1);
}
int main()
{
    solve();
    for(int i=0;i<maxn;i++)
        cout<<iisve[i]<<" ";
    cout<<endl;
    return 0;
}