本程序为G-S迭代法，若系数矩阵满足

1.G-S迭代矩阵谱半径小于一

2.jacobi迭代矩阵一范数或无穷范数小于一

3.系数矩阵A正定

4.系数矩阵A严格对角占优或不可约对角占优

则可返回A*x=b的解。算法迭代次数比

x=M*x+g形式的标准化迭代次数多，但所用时间少很多。-The program for the G-S iteration method, if the coefficient matrix

1.G-S iterative matrix spectral radius less than one

2.jacobi iterative matrix norm or the infinity norm of less than one

3 coefficient matrix A Definite

The coefficient matrix A is strictly diagonally dominant or irreducible diagonally dominant

You can return to the A* x = b solution. Algorithm the number of iterations than

x = M* x+ g in the form of standardized number of iterations, but used much less time.