315
Power Method Algorithm
10 REM Power Method Algorithm 20 INPUT "The dimension"; N 30 DIM A(N,N), X(N), Y(N), R(N)
40 PRINT "The matrix, row by row"
50 FOR I= 1 TO N
60
70
80
FOR J1 TO N
INPUT A(I, J)
NEXT J
90 NEXT I
100 PRINT "The vector x,with infinite-norm unity"
110 FOR I=1 TO N: INPUT X(I) NEXT I
120 INPUT "tolerance"; TOL
130 INPUT "the max. no. of iterations": M
135 FOR I=1 TO N
136 IF X(I) <> 1 THEN 138 ELSE P=I GOTO 140 138 NEXT I
140 FOR K=1 TO M
150
FOR I=1 TO N
155 Y(I)=0
160
FOR J=1 TO N
170
Y(I)=Y(I) +A (I, J)*X(J)
180
NEXT J
190
NEXT I
200 MU=Y(P)
205 MAX=Y(1) : P=1
210
220
230
250
FOR I=2 TO N
IF MAX >= Y(I) THEN 250 MAX=Y(I) :P=I
NEXT I
260 IF MAX=0 THEN 270 ELSE 295
270 PRINT "A has 0 as an eigenvalue "
275 PRINT "eigenvector: "
280 FOR I=1 TO N PRINT X(I), NEXT I
290 STOP
295 FOR I=1 TO N :R(I)=X(I)-Y(I)/MAX :NEXT I
300 FOR I=1 TO N :X(I)=Y(I)/Y(P) :NEXT I
310 MAX=R (1)
320
330
340
360
FOR I=2 TO N
IF MAX >= R(I) THEN 360 MAX=R (I)
NEXT I
370 E=ABS (MAX)
380 IF E <= TOL THEN 400 ELSE 390
390 NEXT K
392 PRINT "Max. no. of iterations exceeded"
394 STOP
400 PRINT "dominant eigenvalue"; MU
410 PRINT "corresponding eigenvector";
420 FOR I=1 TO N PRINT X(I), NEXT I
430 STOP
المصفوفات
الكتاب — ص ٣١٥