313
Jacobi Algorithm
ملحق أ
APPENDIX A
10 REM Jacobi algorithm
15 INPUT "The dimension"; N
17 DIM A(N, N), X (N), XO (N)
20 PRINT "The coefficient matrix"
30 FOR I=1 TO N
35 PRINT "The coefficient matrix, row by row"
40
50
60
FOR J=1 TO N
INPUT A(I, J)
NEXT J
70 NEXT I
80 PRINT "The constant vector,b"
90 FOR I=1 TO N : INPUT B(I) NEXT I
95 PRINT "The initial guess"
97 FOR I=1 TO N INPUT XO(I) NEXT I
المصفوفات - د. مجدي الطويل
100 INPUT "The tolerance"; TOL
110 INPUT "The no. of iterations"; M
120 FOR K=1 TO M
130
FOR I=1 TO N
140
150
U=0 FOR J=1 TO I-1 U=U+A(I, J)*X0(J) V=0 FOR J=1+1 TO N V=V+A(I, J)*XO (J)
NEXT J
NEXT J
160
X(I)=(B(I)-U-V)/A(I,I)
170
NEXT I
180
FOR I=1 TO NIF ABS (X(I)-XO (I)) >TOL THEN 300 ELSE NEXT I 190 PRINT "The solution"
200 FOR I=1 TO N PRINT X(I), NEXT I
210 STOP
300
310
FOR I=1 TO N XO(I)=X(I) NEXT I NEXT K
320 PRINT "The no. ofiterations are exceeded" 330 FOR I=1 TO N PRINT X(I), : NEXT I
الكتاب — ص ٣١٣