【delphi实现数学算法】松弛迭代法

松弛迭代法
procedure SSOR(A:matrx2; N:integer; B:array of real;
var X:array of real; EPS,OM:real;var II:integer);
var
IMAX,J,I,L:integer; RX,R:real;
begin
IMAX:=200;
For I:=1 To N do
begin
R:=1 / A[I, I];
B[I]:=B[I] * R;
For J:=1 To N do
A[I, J]:=A[I, J] * R;
end;
For L:=1 To IMAX do
begin
RX:=0;
For I:=1 To N do
begin
R:=B[I];
For J:=1 To N do
R:=R - A[I, J] * X[J];
If Abs(R) > RX Then RX:=Abs(R);
X[I]:=X[I] + OM * R;
end;
If OM * RX <= EPS Then
begin
II:=J;
Exit;
end;
end;
ShowMessage(' Too many iterations');
end;