10 COM N1,N2,N3,E[64] 20 REM *****SEVS VERSION 1, JUNE 15, 1971 30 REM *****TRANSLATED FROM 'FORTRAN PROGRAMMING FOR THE BEHAVIORAL 40 REM *****SCIENCES' BY D.J. VELDMAN 50 DIM R[64],V[64],P[64],U[64],F[64,20] 60 MAT U=CON 70 MAT U=(-999)*U 80 MAT V=ZER 90 FILES CORR,CORR1,VEC 100 REM N2= NVAR, N3=N FACTORS, N1=NSUBJ 110 M3=20 120 FOR L=1 TO N2 130 READ #1,2*L-1 140 READ #2,2*L-1 150 MAT READ #1;R[N2] 160 MAT PRINT #2;R 170 NEXT L 180 REM COMP TRACE 190 T=0 200 FOR K=1 TO N2 210 K2=2*K-1 220 READ #1,K2 230 MAT READ #1;R[N2] 240 T=T+R[K] 250 NEXT K 260 REM COMP. LOWER LIMIT ON EIGEN VALUES 270 C=0 280 REM 290 REM COMP ROOT IN E(K) 300 IF N3 <= M3 THEN 340 310 N3=M3 320 PRINT "NUMBER OF FACTORS REQUESTED EXCEEDS BOUNDS AND IS THUS SET TO A " 330 PRINT "MAXIMUM OF";M3 340 FOR K=1 TO N3 350 READ #3,2*K-1 360 FOR I=1 TO N2 370 P[I]=1 380 NEXT I 390 E[K]=1 400 E1=1/E[K] 410 FOR I=1 TO N2 420 V[I]=P[I]*E1 430 NEXT I 440 S9=0 450 FOR I9=1 TO N2 460 S9=S9+(U[I9]-V[I9])^2 470 NEXT I9 480 S9=SQR(S9) 490 MAT U=V 500 E2=0 510 MAT P=ZER 520 FOR J=1 TO N2 530 READ #2,2*J-1 540 MAT READ #2;R[N2] 550 FOR I=1 TO N2 560 P[J]=P[J]+V[I]*R[I] 570 NEXT I 580 E2=E2+P[J]*V[J] 590 NEXT J 600 REM 610 REM COMP E(K) = KTH ROOT 620 E[K]=SQR(ABS(E2)) 630 IF S9>.0001 THEN 400 640 REM SAVE V(K) 650 READ #3,2*K-1 660 MAT PRINT #3;V 670 FOR I=1 TO N2 680 F[I,K]=V[I] 690 NEXT I 700 REM 710 IF E2