ملحق أ
SOR Algorithm
10 REM SOR ALGORITHM
20 INPUT "The number of equations"; N
30 DIM A(N,N), B(N), XO(N)
35 PRINT "The coefficient matrix, row by row" 40 FOR I=1 TO N
50
60
70
FOR J=1 TO N
INPUT A(I, J) NEXT J
80 NEXT I
90 PRINT "The constant 100 FOR I=1 TO N: INPUT 110 PRINT "The initial
vector b" B(I): NEXT I vector x0"
120 FOR I=1 TO N: INPUT XO(I)
:NEXT I
130 INPUT "The relaxation parameter w";W
140 INPUT "The tolerance tol"; TOL
150 INPUT "The maximum number of iterations"; M 160 FOR K=1 TO M
170 FOR I=1 TO N
U=0: FOR J=1 TO 1-1 :U=U+A(I, J ) * X ( J ) : NEXT J V=0: FOR J=1+1 TO N :V=V+A{I,J)*X0(J) : NEXT J X ( I ) = ( 1-W) * XO ( I ) + W* ( − U−V+B { I } }/A (I,I)
FOR I=1 TO N
180
190
200
210
NEXT I
220
230
300
310
320
400
410
IF ABS (X(I)-X0(I)) >TOL THEN 400 ELSE NEXT I PRINT The solution"
FOR I=1 TO N PRINT X(1), :NEXT I STOP
FOR I=1 TO N :X0(I)=X(I): NEXT I NEXT K
420 PRINT "Maximum number of iterations exceeded" 430 FOR I=1 TO N PRINT X(I), NEXT I
314
الكتاب — ص ٣١٤