sdrvvx.f
来自「famous linear algebra library (LAPACK) p」· F 代码 · 共 859 行 · 第 1/3 页
F
859 行
ELSE IF( ITYPE.EQ.3 ) THEN
*
* Jordan Block
*
DO 80 JCOL = 1, N
A( JCOL, JCOL ) = ANORM
IF( JCOL.GT.1 )
$ A( JCOL, JCOL-1 ) = ONE
80 CONTINUE
*
ELSE IF( ITYPE.EQ.4 ) THEN
*
* Diagonal Matrix, [Eigen]values Specified
*
CALL SLATMS( N, N, 'S', ISEED, 'S', WORK, IMODE, COND,
$ ANORM, 0, 0, 'N', A, LDA, WORK( N+1 ),
$ IINFO )
*
ELSE IF( ITYPE.EQ.5 ) THEN
*
* Symmetric, eigenvalues specified
*
CALL SLATMS( N, N, 'S', ISEED, 'S', WORK, IMODE, COND,
$ ANORM, N, N, 'N', A, LDA, WORK( N+1 ),
$ IINFO )
*
ELSE IF( ITYPE.EQ.6 ) THEN
*
* General, eigenvalues specified
*
IF( KCONDS( JTYPE ).EQ.1 ) THEN
CONDS = ONE
ELSE IF( KCONDS( JTYPE ).EQ.2 ) THEN
CONDS = RTULPI
ELSE
CONDS = ZERO
END IF
*
ADUMMA( 1 ) = ' '
CALL SLATME( N, 'S', ISEED, WORK, IMODE, COND, ONE,
$ ADUMMA, 'T', 'T', 'T', WORK( N+1 ), 4,
$ CONDS, N, N, ANORM, A, LDA, WORK( 2*N+1 ),
$ IINFO )
*
ELSE IF( ITYPE.EQ.7 ) THEN
*
* Diagonal, random eigenvalues
*
CALL SLATMR( N, N, 'S', ISEED, 'S', WORK, 6, ONE, ONE,
$ 'T', 'N', WORK( N+1 ), 1, ONE,
$ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, 0, 0,
$ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
*
ELSE IF( ITYPE.EQ.8 ) THEN
*
* Symmetric, random eigenvalues
*
CALL SLATMR( N, N, 'S', ISEED, 'S', WORK, 6, ONE, ONE,
$ 'T', 'N', WORK( N+1 ), 1, ONE,
$ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, N, N,
$ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
*
ELSE IF( ITYPE.EQ.9 ) THEN
*
* General, random eigenvalues
*
CALL SLATMR( N, N, 'S', ISEED, 'N', WORK, 6, ONE, ONE,
$ 'T', 'N', WORK( N+1 ), 1, ONE,
$ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, N, N,
$ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
IF( N.GE.4 ) THEN
CALL SLASET( 'Full', 2, N, ZERO, ZERO, A, LDA )
CALL SLASET( 'Full', N-3, 1, ZERO, ZERO, A( 3, 1 ),
$ LDA )
CALL SLASET( 'Full', N-3, 2, ZERO, ZERO, A( 3, N-1 ),
$ LDA )
CALL SLASET( 'Full', 1, N, ZERO, ZERO, A( N, 1 ),
$ LDA )
END IF
*
ELSE IF( ITYPE.EQ.10 ) THEN
*
* Triangular, random eigenvalues
*
CALL SLATMR( N, N, 'S', ISEED, 'N', WORK, 6, ONE, ONE,
$ 'T', 'N', WORK( N+1 ), 1, ONE,
$ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, N, 0,
$ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
*
ELSE
*
IINFO = 1
END IF
*
IF( IINFO.NE.0 ) THEN
WRITE( NOUNIT, FMT = 9992 )'Generator', IINFO, N, JTYPE,
$ IOLDSD
INFO = ABS( IINFO )
RETURN
END IF
*
90 CONTINUE
*
* Test for minimal and generous workspace
*
DO 130 IWK = 1, 3
IF( IWK.EQ.1 ) THEN
NNWORK = 3*N
ELSE IF( IWK.EQ.2 ) THEN
NNWORK = 6*N + N**2
ELSE
NNWORK = 6*N + 2*N**2
END IF
NNWORK = MAX( NNWORK, 1 )
*
* Test for all balancing options
*
DO 120 IBAL = 1, 4
BALANC = BAL( IBAL )
*
* Perform tests
*
CALL SGET23( .FALSE., BALANC, JTYPE, THRESH, IOLDSD,
$ NOUNIT, N, A, LDA, H, WR, WI, WR1, WI1,
$ VL, LDVL, VR, LDVR, LRE, LDLRE, RCONDV,
$ RCNDV1, RCDVIN, RCONDE, RCNDE1, RCDEIN,
$ SCALE, SCALE1, RESULT, WORK, NNWORK,
$ IWORK, INFO )
*
* Check for RESULT(j) > THRESH
*
NTEST = 0
NFAIL = 0
DO 100 J = 1, 9
IF( RESULT( J ).GE.ZERO )
$ NTEST = NTEST + 1
IF( RESULT( J ).GE.THRESH )
$ NFAIL = NFAIL + 1
100 CONTINUE
*
IF( NFAIL.GT.0 )
$ NTESTF = NTESTF + 1
IF( NTESTF.EQ.1 ) THEN
WRITE( NOUNIT, FMT = 9999 )PATH
WRITE( NOUNIT, FMT = 9998 )
WRITE( NOUNIT, FMT = 9997 )
WRITE( NOUNIT, FMT = 9996 )
WRITE( NOUNIT, FMT = 9995 )THRESH
NTESTF = 2
END IF
*
DO 110 J = 1, 9
IF( RESULT( J ).GE.THRESH ) THEN
WRITE( NOUNIT, FMT = 9994 )BALANC, N, IWK,
$ IOLDSD, JTYPE, J, RESULT( J )
END IF
110 CONTINUE
*
NERRS = NERRS + NFAIL
NTESTT = NTESTT + NTEST
*
120 CONTINUE
130 CONTINUE
140 CONTINUE
150 CONTINUE
*
160 CONTINUE
*
* Read in data from file to check accuracy of condition estimation.
* Assume input eigenvalues are sorted lexicographically (increasing
* by real part, then decreasing by imaginary part)
*
JTYPE = 0
170 CONTINUE
READ( NIUNIT, FMT = *, END = 220 )N
*
* Read input data until N=0
*
IF( N.EQ.0 )
$ GO TO 220
JTYPE = JTYPE + 1
ISEED( 1 ) = JTYPE
DO 180 I = 1, N
READ( NIUNIT, FMT = * )( A( I, J ), J = 1, N )
180 CONTINUE
DO 190 I = 1, N
READ( NIUNIT, FMT = * )WR1( I ), WI1( I ), RCDEIN( I ),
$ RCDVIN( I )
190 CONTINUE
CALL SGET23( .TRUE., 'N', 22, THRESH, ISEED, NOUNIT, N, A, LDA, H,
$ WR, WI, WR1, WI1, VL, LDVL, VR, LDVR, LRE, LDLRE,
$ RCONDV, RCNDV1, RCDVIN, RCONDE, RCNDE1, RCDEIN,
$ SCALE, SCALE1, RESULT, WORK, 6*N+2*N**2, IWORK,
$ INFO )
*
* Check for RESULT(j) > THRESH
*
NTEST = 0
NFAIL = 0
DO 200 J = 1, 11
IF( RESULT( J ).GE.ZERO )
$ NTEST = NTEST + 1
IF( RESULT( J ).GE.THRESH )
$ NFAIL = NFAIL + 1
200 CONTINUE
*
IF( NFAIL.GT.0 )
$ NTESTF = NTESTF + 1
IF( NTESTF.EQ.1 ) THEN
WRITE( NOUNIT, FMT = 9999 )PATH
WRITE( NOUNIT, FMT = 9998 )
WRITE( NOUNIT, FMT = 9997 )
WRITE( NOUNIT, FMT = 9996 )
WRITE( NOUNIT, FMT = 9995 )THRESH
NTESTF = 2
END IF
*
DO 210 J = 1, 11
IF( RESULT( J ).GE.THRESH ) THEN
WRITE( NOUNIT, FMT = 9993 )N, JTYPE, J, RESULT( J )
END IF
210 CONTINUE
*
NERRS = NERRS + NFAIL
NTESTT = NTESTT + NTEST
GO TO 170
220 CONTINUE
*
* Summary
*
CALL SLASUM( PATH, NOUNIT, NERRS, NTESTT )
*
9999 FORMAT( / 1X, A3, ' -- Real Eigenvalue-Eigenvector Decomposition',
$ ' Expert Driver', /
$ ' Matrix types (see SDRVVX for details): ' )
*
9998 FORMAT( / ' Special Matrices:', / ' 1=Zero matrix. ',
$ ' ', ' 5=Diagonal: geometr. spaced entries.',
$ / ' 2=Identity matrix. ', ' 6=Diagona',
$ 'l: clustered entries.', / ' 3=Transposed Jordan block. ',
$ ' ', ' 7=Diagonal: large, evenly spaced.', / ' ',
$ '4=Diagonal: evenly spaced entries. ', ' 8=Diagonal: s',
$ 'mall, evenly spaced.' )
9997 FORMAT( ' Dense, Non-Symmetric Matrices:', / ' 9=Well-cond., ev',
$ 'enly spaced eigenvals.', ' 14=Ill-cond., geomet. spaced e',
$ 'igenals.', / ' 10=Well-cond., geom. spaced eigenvals. ',
$ ' 15=Ill-conditioned, clustered e.vals.', / ' 11=Well-cond',
$ 'itioned, clustered e.vals. ', ' 16=Ill-cond., random comp',
$ 'lex ', / ' 12=Well-cond., random complex ', ' ',
$ ' 17=Ill-cond., large rand. complx ', / ' 13=Ill-condi',
$ 'tioned, evenly spaced. ', ' 18=Ill-cond., small rand.',
$ ' complx ' )
9996 FORMAT( ' 19=Matrix with random O(1) entries. ', ' 21=Matrix ',
$ 'with small random entries.', / ' 20=Matrix with large ran',
$ 'dom entries. ', ' 22=Matrix read from input file', / )
9995 FORMAT( ' Tests performed with test threshold =', F8.2,
$ / / ' 1 = | A VR - VR W | / ( n |A| ulp ) ',
$ / ' 2 = | transpose(A) VL - VL W | / ( n |A| ulp ) ',
$ / ' 3 = | |VR(i)| - 1 | / ulp ',
$ / ' 4 = | |VL(i)| - 1 | / ulp ',
$ / ' 5 = 0 if W same no matter if VR or VL computed,',
$ ' 1/ulp otherwise', /
$ ' 6 = 0 if VR same no matter what else computed,',
$ ' 1/ulp otherwise', /
$ ' 7 = 0 if VL same no matter what else computed,',
$ ' 1/ulp otherwise', /
$ ' 8 = 0 if RCONDV same no matter what else computed,',
$ ' 1/ulp otherwise', /
$ ' 9 = 0 if SCALE, ILO, IHI, ABNRM same no matter what else',
$ ' computed, 1/ulp otherwise',
$ / ' 10 = | RCONDV - RCONDV(precomputed) | / cond(RCONDV),',
$ / ' 11 = | RCONDE - RCONDE(precomputed) | / cond(RCONDE),' )
9994 FORMAT( ' BALANC=''', A1, ''',N=', I4, ',IWK=', I1, ', seed=',
$ 4( I4, ',' ), ' type ', I2, ', test(', I2, ')=', G10.3 )
9993 FORMAT( ' N=', I5, ', input example =', I3, ', test(', I2, ')=',
$ G10.3 )
9992 FORMAT( ' SDRVVX: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',
$ I6, ', JTYPE=', I6, ', ISEED=(', 3( I5, ',' ), I5, ')' )
*
RETURN
*
* End of SDRVVX
*
END
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?