高斯—赛德尔求解线性方程+C代码

高斯—赛德尔迭代求矩阵特征值公式如下：

举例：

实现代码：

#include "stdio.h"
#include "stdlib.h"
#include "math.h"


#define N 3 
#define MAXITER 10000 


void main()
{
int i, j, k;
int iter = 0;
int count;
double a[N][N] = {10, -2, -1, -2, 10, -1, -1, -2, 5};
double b[N] = {3, 15, 10};
double new_x[N] = {0};
double old_x[N] = {0};
double e = 0.0000001;
bool flag = false;


//开始迭代
while(iter<MAXITER && !flag)
{
count = 0;
iter++;


for(i=0; i<N; i++)
old_x[i] = new_x[i];


for(i=0; i<N; i++)
new_x[i] = 0;


//高斯—赛德尔计算
for(i=0; i<N; i++)
{

for(j=0; j<N; j++)
{
if(i==j)
continue;


new_x[i] -= a[i][j]*old_x[j];
}


new_x[i] += b[i];


new_x[i] = new_x[i]/a[i][i];
}


//检测是否收敛
for(i=0; i<N; i++)
if(fabs(new_x[i]-old_x[i])>e)
{
count++;
break;
}


if(count==0)
flag = true;


}


for(i=0; i<N; i++)
{
for(j=0; j<N; j++)
printf("%lf  ", a[i][j]);
printf("%lf\n", b[i]);
}


for(i=0; i<N; i++)
printf("%lf  ", new_x[i]);


printf("\n迭代次数：%d  \n", iter);


}

运行结果：