3 * =========== DOCUMENTATION ===========
5 * Online html documentation available at
6 * http://www.netlib.org/lapack/explore-html/
11 * SUBROUTINE CDRVEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH,
12 * NOUNIT, A, LDA, H, W, W1, VL, LDVL, VR, LDVR,
13 * LRE, LDLRE, RESULT, WORK, NWORK, RWORK, IWORK,
16 * .. Scalar Arguments ..
17 * INTEGER INFO, LDA, LDLRE, LDVL, LDVR, NOUNIT, NSIZES,
21 * .. Array Arguments ..
23 * INTEGER ISEED( 4 ), IWORK( * ), NN( * )
24 * REAL RESULT( 7 ), RWORK( * )
25 * COMPLEX A( LDA, * ), H( LDA, * ), LRE( LDLRE, * ),
26 * $ VL( LDVL, * ), VR( LDVR, * ), W( * ), W1( * ),
36 *> CDRVEV checks the nonsymmetric eigenvalue problem driver CGEEV.
38 *> When CDRVEV is called, a number of matrix "sizes" ("n's") and a
39 *> number of matrix "types" are specified. For each size ("n")
40 *> and each type of matrix, one matrix will be generated and used
41 *> to test the nonsymmetric eigenroutines. For each matrix, 7
42 *> tests will be performed:
44 *> (1) | A * VR - VR * W | / ( n |A| ulp )
46 *> Here VR is the matrix of unit right eigenvectors.
47 *> W is a diagonal matrix with diagonal entries W(j).
49 *> (2) | A**H * VL - VL * W**H | / ( n |A| ulp )
51 *> Here VL is the matrix of unit left eigenvectors, A**H is the
52 *> conjugate-transpose of A, and W is as above.
54 *> (3) | |VR(i)| - 1 | / ulp and whether largest component real
56 *> VR(i) denotes the i-th column of VR.
58 *> (4) | |VL(i)| - 1 | / ulp and whether largest component real
60 *> VL(i) denotes the i-th column of VL.
62 *> (5) W(full) = W(partial)
64 *> W(full) denotes the eigenvalues computed when both VR and VL
65 *> are also computed, and W(partial) denotes the eigenvalues
66 *> computed when only W, only W and VR, or only W and VL are
69 *> (6) VR(full) = VR(partial)
71 *> VR(full) denotes the right eigenvectors computed when both VR
72 *> and VL are computed, and VR(partial) denotes the result
73 *> when only VR is computed.
75 *> (7) VL(full) = VL(partial)
77 *> VL(full) denotes the left eigenvectors computed when both VR
78 *> and VL are also computed, and VL(partial) denotes the result
79 *> when only VL is computed.
81 *> The "sizes" are specified by an array NN(1:NSIZES); the value of
82 *> each element NN(j) specifies one size.
83 *> The "types" are specified by a logical array DOTYPE( 1:NTYPES );
84 *> if DOTYPE(j) is .TRUE., then matrix type "j" will be generated.
85 *> Currently, the list of possible types is:
87 *> (1) The zero matrix.
88 *> (2) The identity matrix.
89 *> (3) A (transposed) Jordan block, with 1's on the diagonal.
91 *> (4) A diagonal matrix with evenly spaced entries
92 *> 1, ..., ULP and random complex angles.
93 *> (ULP = (first number larger than 1) - 1 )
94 *> (5) A diagonal matrix with geometrically spaced entries
95 *> 1, ..., ULP and random complex angles.
96 *> (6) A diagonal matrix with "clustered" entries 1, ULP, ..., ULP
97 *> and random complex angles.
99 *> (7) Same as (4), but multiplied by a constant near
100 *> the overflow threshold
101 *> (8) Same as (4), but multiplied by a constant near
102 *> the underflow threshold
104 *> (9) A matrix of the form U' T U, where U is unitary and
105 *> T has evenly spaced entries 1, ..., ULP with random complex
106 *> angles on the diagonal and random O(1) entries in the upper
109 *> (10) A matrix of the form U' T U, where U is unitary and
110 *> T has geometrically spaced entries 1, ..., ULP with random
111 *> complex angles on the diagonal and random O(1) entries in
112 *> the upper triangle.
114 *> (11) A matrix of the form U' T U, where U is unitary and
115 *> T has "clustered" entries 1, ULP,..., ULP with random
116 *> complex angles on the diagonal and random O(1) entries in
117 *> the upper triangle.
119 *> (12) A matrix of the form U' T U, where U is unitary and
120 *> T has complex eigenvalues randomly chosen from
121 *> ULP < |z| < 1 and random O(1) entries in the upper
124 *> (13) A matrix of the form X' T X, where X has condition
125 *> SQRT( ULP ) and T has evenly spaced entries 1, ..., ULP
126 *> with random complex angles on the diagonal and random O(1)
127 *> entries in the upper triangle.
129 *> (14) A matrix of the form X' T X, where X has condition
130 *> SQRT( ULP ) and T has geometrically spaced entries
131 *> 1, ..., ULP with random complex angles on the diagonal
132 *> and random O(1) entries in the upper triangle.
134 *> (15) A matrix of the form X' T X, where X has condition
135 *> SQRT( ULP ) and T has "clustered" entries 1, ULP,..., ULP
136 *> with random complex angles on the diagonal and random O(1)
137 *> entries in the upper triangle.
139 *> (16) A matrix of the form X' T X, where X has condition
140 *> SQRT( ULP ) and T has complex eigenvalues randomly chosen
141 *> from ULP < |z| < 1 and random O(1) entries in the upper
144 *> (17) Same as (16), but multiplied by a constant
145 *> near the overflow threshold
146 *> (18) Same as (16), but multiplied by a constant
147 *> near the underflow threshold
149 *> (19) Nonsymmetric matrix with random entries chosen from |z| < 1
150 *> If N is at least 4, all entries in first two rows and last
151 *> row, and first column and last two columns are zero.
152 *> (20) Same as (19), but multiplied by a constant
153 *> near the overflow threshold
154 *> (21) Same as (19), but multiplied by a constant
155 *> near the underflow threshold
164 *> The number of sizes of matrices to use. If it is zero,
165 *> CDRVEV does nothing. It must be at least zero.
170 *> NN is INTEGER array, dimension (NSIZES)
171 *> An array containing the sizes to be used for the matrices.
172 *> Zero values will be skipped. The values must be at least
179 *> The number of elements in DOTYPE. If it is zero, CDRVEV
180 *> does nothing. It must be at least zero. If it is MAXTYP+1
181 *> and NSIZES is 1, then an additional type, MAXTYP+1 is
182 *> defined, which is to use whatever matrix is in A. This
183 *> is only useful if DOTYPE(1:MAXTYP) is .FALSE. and
184 *> DOTYPE(MAXTYP+1) is .TRUE. .
189 *> DOTYPE is LOGICAL array, dimension (NTYPES)
190 *> If DOTYPE(j) is .TRUE., then for each size in NN a
191 *> matrix of that size and of type j will be generated.
192 *> If NTYPES is smaller than the maximum number of types
193 *> defined (PARAMETER MAXTYP), then types NTYPES+1 through
194 *> MAXTYP will not be generated. If NTYPES is larger
195 *> than MAXTYP, DOTYPE(MAXTYP+1) through DOTYPE(NTYPES)
199 *> \param[in,out] ISEED
201 *> ISEED is INTEGER array, dimension (4)
202 *> On entry ISEED specifies the seed of the random number
203 *> generator. The array elements should be between 0 and 4095;
204 *> if not they will be reduced mod 4096. Also, ISEED(4) must
205 *> be odd. The random number generator uses a linear
206 *> congruential sequence limited to small integers, and so
207 *> should produce machine independent random numbers. The
208 *> values of ISEED are changed on exit, and can be used in the
209 *> next call to CDRVEV to continue the same random number
216 *> A test will count as "failed" if the "error", computed as
217 *> described above, exceeds THRESH. Note that the error
218 *> is scaled to be O(1), so THRESH should be a reasonably
219 *> small multiple of 1, e.g., 10 or 100. In particular,
220 *> it should not depend on the precision (single vs. double)
221 *> or the size of the matrix. It must be at least zero.
227 *> The FORTRAN unit number for printing out error messages
228 *> (e.g., if a routine returns INFO not equal to 0.)
233 *> A is COMPLEX array, dimension (LDA, max(NN))
234 *> Used to hold the matrix whose eigenvalues are to be
235 *> computed. On exit, A contains the last matrix actually used.
241 *> The leading dimension of A, and H. LDA must be at
242 *> least 1 and at least max(NN).
247 *> H is COMPLEX array, dimension (LDA, max(NN))
248 *> Another copy of the test matrix A, modified by CGEEV.
253 *> W is COMPLEX array, dimension (max(NN))
254 *> The eigenvalues of A. On exit, W are the eigenvalues of
260 *> W1 is COMPLEX array, dimension (max(NN))
261 *> Like W, this array contains the eigenvalues of A,
262 *> but those computed when CGEEV only computes a partial
263 *> eigendecomposition, i.e. not the eigenvalues and left
264 *> and right eigenvectors.
269 *> VL is COMPLEX array, dimension (LDVL, max(NN))
270 *> VL holds the computed left eigenvectors.
276 *> Leading dimension of VL. Must be at least max(1,max(NN)).
281 *> VR is COMPLEX array, dimension (LDVR, max(NN))
282 *> VR holds the computed right eigenvectors.
288 *> Leading dimension of VR. Must be at least max(1,max(NN)).
293 *> LRE is COMPLEX array, dimension (LDLRE, max(NN))
294 *> LRE holds the computed right or left eigenvectors.
300 *> Leading dimension of LRE. Must be at least max(1,max(NN)).
303 *> \param[out] RESULT
305 *> RESULT is REAL array, dimension (7)
306 *> The values computed by the seven tests described above.
307 *> The values are currently limited to 1/ulp, to avoid
313 *> WORK is COMPLEX array, dimension (NWORK)
319 *> The number of entries in WORK. This must be at least
320 *> 5*NN(j)+2*NN(j)**2 for all j.
325 *> RWORK is REAL array, dimension (2*max(NN))
330 *> IWORK is INTEGER array, dimension (max(NN))
336 *> If 0, then everything ran OK.
338 *> -2: Some NN(j) < 0
341 *> -9: LDA < 1 or LDA < NMAX, where NMAX is max( NN(j) ).
342 *> -14: LDVL < 1 or LDVL < NMAX, where NMAX is max( NN(j) ).
343 *> -16: LDVR < 1 or LDVR < NMAX, where NMAX is max( NN(j) ).
344 *> -18: LDLRE < 1 or LDLRE < NMAX, where NMAX is max( NN(j) ).
345 *> -21: NWORK too small.
346 *> If CLATMR, CLATMS, CLATME or CGEEV returns an error code,
347 *> the absolute value of it is returned.
349 *>-----------------------------------------------------------------------
351 *> Some Local Variables and Parameters:
352 *> ---- ----- --------- --- ----------
354 *> ZERO, ONE Real 0 and 1.
355 *> MAXTYP The number of types defined.
356 *> NMAX Largest value in NN.
357 *> NERRS The number of tests which have exceeded THRESH
359 *> IMODE Values to be passed to the matrix generators.
360 *> ANORM Norm of A; passed to matrix generators.
362 *> OVFL, UNFL Overflow and underflow thresholds.
363 *> ULP, ULPINV Finest relative precision and its inverse.
364 *> RTULP, RTULPI Square roots of the previous 4 values.
366 *> The following four arrays decode JTYPE:
367 *> KTYPE(j) The general type (1-10) for type "j".
368 *> KMODE(j) The MODE value to be passed to the matrix
369 *> generator for type "j".
370 *> KMAGN(j) The order of magnitude ( O(1),
371 *> O(overflow^(1/2) ), O(underflow^(1/2) )
372 *> KCONDS(j) Selectw whether CONDS is to be 1 or
373 *> 1/sqrt(ulp). (0 means irrelevant.)
379 *> \author Univ. of Tennessee
380 *> \author Univ. of California Berkeley
381 *> \author Univ. of Colorado Denver
384 *> \date November 2011
386 *> \ingroup complex_eig
388 * =====================================================================
389 SUBROUTINE CDRVEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH,
390 $ NOUNIT, A, LDA, H, W, W1, VL, LDVL, VR, LDVR,
391 $ LRE, LDLRE, RESULT, WORK, NWORK, RWORK, IWORK,
394 * -- LAPACK test routine (version 3.4.0) --
395 * -- LAPACK is a software package provided by Univ. of Tennessee, --
396 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
399 * .. Scalar Arguments ..
400 INTEGER INFO, LDA, LDLRE, LDVL, LDVR, NOUNIT, NSIZES,
404 * .. Array Arguments ..
406 INTEGER ISEED( 4 ), IWORK( * ), NN( * )
407 REAL RESULT( 7 ), RWORK( * )
408 COMPLEX A( LDA, * ), H( LDA, * ), LRE( LDLRE, * ),
409 $ VL( LDVL, * ), VR( LDVR, * ), W( * ), W1( * ),
413 * =====================================================================
417 PARAMETER ( CZERO = ( 0.0E+0, 0.0E+0 ) )
419 PARAMETER ( CONE = ( 1.0E+0, 0.0E+0 ) )
421 PARAMETER ( ZERO = 0.0E+0, ONE = 1.0E+0 )
423 PARAMETER ( TWO = 2.0E+0 )
425 PARAMETER ( MAXTYP = 21 )
427 * .. Local Scalars ..
430 INTEGER IINFO, IMODE, ITYPE, IWK, J, JCOL, JJ, JSIZE,
431 $ JTYPE, MTYPES, N, NERRS, NFAIL, NMAX,
432 $ NNWORK, NTEST, NTESTF, NTESTT
433 REAL ANORM, COND, CONDS, OVFL, RTULP, RTULPI, TNRM,
434 $ ULP, ULPINV, UNFL, VMX, VRMX, VTST
437 INTEGER IDUMMA( 1 ), IOLDSD( 4 ), KCONDS( MAXTYP ),
438 $ KMAGN( MAXTYP ), KMODE( MAXTYP ),
443 * .. External Functions ..
445 EXTERNAL SCNRM2, SLAMCH
447 * .. External Subroutines ..
448 EXTERNAL CGEEV, CGET22, CLACPY, CLATME, CLATMR, CLATMS,
449 $ CLASET, SLABAD, SLASUM, XERBLA
451 * .. Intrinsic Functions ..
452 INTRINSIC ABS, AIMAG, CMPLX, MAX, MIN, REAL, SQRT
454 * .. Data statements ..
455 DATA KTYPE / 1, 2, 3, 5*4, 4*6, 6*6, 3*9 /
456 DATA KMAGN / 3*1, 1, 1, 1, 2, 3, 4*1, 1, 1, 1, 1, 2,
458 DATA KMODE / 3*0, 4, 3, 1, 4, 4, 4, 3, 1, 5, 4, 3,
459 $ 1, 5, 5, 5, 4, 3, 1 /
460 DATA KCONDS / 3*0, 5*0, 4*1, 6*2, 3*0 /
462 * .. Executable Statements ..
464 PATH( 1: 1 ) = 'Complex precision'
473 * Important constants
478 NMAX = MAX( NMAX, NN( J ) )
485 IF( NSIZES.LT.0 ) THEN
487 ELSE IF( BADNN ) THEN
489 ELSE IF( NTYPES.LT.0 ) THEN
491 ELSE IF( THRESH.LT.ZERO ) THEN
493 ELSE IF( NOUNIT.LE.0 ) THEN
495 ELSE IF( LDA.LT.1 .OR. LDA.LT.NMAX ) THEN
497 ELSE IF( LDVL.LT.1 .OR. LDVL.LT.NMAX ) THEN
499 ELSE IF( LDVR.LT.1 .OR. LDVR.LT.NMAX ) THEN
501 ELSE IF( LDLRE.LT.1 .OR. LDLRE.LT.NMAX ) THEN
503 ELSE IF( 5*NMAX+2*NMAX**2.GT.NWORK ) THEN
508 CALL XERBLA( 'CDRVEV', -INFO )
512 * Quick return if nothing to do
514 IF( NSIZES.EQ.0 .OR. NTYPES.EQ.0 )
517 * More Important constants
519 UNFL = SLAMCH( 'Safe minimum' )
521 CALL SLABAD( UNFL, OVFL )
522 ULP = SLAMCH( 'Precision' )
527 * Loop over sizes, types
531 DO 270 JSIZE = 1, NSIZES
533 IF( NSIZES.NE.1 ) THEN
534 MTYPES = MIN( MAXTYP, NTYPES )
536 MTYPES = MIN( MAXTYP+1, NTYPES )
539 DO 260 JTYPE = 1, MTYPES
540 IF( .NOT.DOTYPE( JTYPE ) )
543 * Save ISEED in case of an error.
546 IOLDSD( J ) = ISEED( J )
551 * Control parameters:
553 * KMAGN KCONDS KMODE KTYPE
554 * =1 O(1) 1 clustered 1 zero
555 * =2 large large clustered 2 identity
556 * =3 small exponential Jordan
557 * =4 arithmetic diagonal, (w/ eigenvalues)
558 * =5 random log symmetric, w/ eigenvalues
559 * =6 random general, w/ eigenvalues
561 * =8 random symmetric
563 * =10 random triangular
565 IF( MTYPES.GT.MAXTYP )
568 ITYPE = KTYPE( JTYPE )
569 IMODE = KMODE( JTYPE )
573 GO TO ( 30, 40, 50 )KMAGN( JTYPE )
589 CALL CLASET( 'Full', LDA, N, CZERO, CZERO, A, LDA )
593 * Special Matrices -- Identity & Jordan block
597 IF( ITYPE.EQ.1 ) THEN
600 ELSE IF( ITYPE.EQ.2 ) THEN
605 A( JCOL, JCOL ) = CMPLX( ANORM )
608 ELSE IF( ITYPE.EQ.3 ) THEN
613 A( JCOL, JCOL ) = CMPLX( ANORM )
615 $ A( JCOL, JCOL-1 ) = CONE
618 ELSE IF( ITYPE.EQ.4 ) THEN
620 * Diagonal Matrix, [Eigen]values Specified
622 CALL CLATMS( N, N, 'S', ISEED, 'H', RWORK, IMODE, COND,
623 $ ANORM, 0, 0, 'N', A, LDA, WORK( N+1 ),
626 ELSE IF( ITYPE.EQ.5 ) THEN
628 * Hermitian, eigenvalues specified
630 CALL CLATMS( N, N, 'S', ISEED, 'H', RWORK, IMODE, COND,
631 $ ANORM, N, N, 'N', A, LDA, WORK( N+1 ),
634 ELSE IF( ITYPE.EQ.6 ) THEN
636 * General, eigenvalues specified
638 IF( KCONDS( JTYPE ).EQ.1 ) THEN
640 ELSE IF( KCONDS( JTYPE ).EQ.2 ) THEN
646 CALL CLATME( N, 'D', ISEED, WORK, IMODE, COND, CONE,
647 $ 'T', 'T', 'T', RWORK, 4, CONDS, N, N,
648 $ ANORM, A, LDA, WORK( 2*N+1 ), IINFO )
650 ELSE IF( ITYPE.EQ.7 ) THEN
652 * Diagonal, random eigenvalues
654 CALL CLATMR( N, N, 'D', ISEED, 'N', WORK, 6, ONE, CONE,
655 $ 'T', 'N', WORK( N+1 ), 1, ONE,
656 $ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, 0, 0,
657 $ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
659 ELSE IF( ITYPE.EQ.8 ) THEN
661 * Symmetric, random eigenvalues
663 CALL CLATMR( N, N, 'D', ISEED, 'H', WORK, 6, ONE, CONE,
664 $ 'T', 'N', WORK( N+1 ), 1, ONE,
665 $ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, N, N,
666 $ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
668 ELSE IF( ITYPE.EQ.9 ) THEN
670 * General, random eigenvalues
672 CALL CLATMR( N, N, 'D', ISEED, 'N', WORK, 6, ONE, CONE,
673 $ 'T', 'N', WORK( N+1 ), 1, ONE,
674 $ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, N, N,
675 $ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
677 CALL CLASET( 'Full', 2, N, CZERO, CZERO, A, LDA )
678 CALL CLASET( 'Full', N-3, 1, CZERO, CZERO, A( 3, 1 ),
680 CALL CLASET( 'Full', N-3, 2, CZERO, CZERO,
682 CALL CLASET( 'Full', 1, N, CZERO, CZERO, A( N, 1 ),
686 ELSE IF( ITYPE.EQ.10 ) THEN
688 * Triangular, random eigenvalues
690 CALL CLATMR( N, N, 'D', ISEED, 'N', WORK, 6, ONE, CONE,
691 $ 'T', 'N', WORK( N+1 ), 1, ONE,
692 $ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, N, 0,
693 $ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
700 IF( IINFO.NE.0 ) THEN
701 WRITE( NOUNIT, FMT = 9993 )'Generator', IINFO, N, JTYPE,
709 * Test for minimal and generous workspace
715 NNWORK = 5*N + 2*N**2
717 NNWORK = MAX( NNWORK, 1 )
725 * Compute eigenvalues and eigenvectors, and test them
727 CALL CLACPY( 'F', N, N, A, LDA, H, LDA )
728 CALL CGEEV( 'V', 'V', N, H, LDA, W, VL, LDVL, VR, LDVR,
729 $ WORK, NNWORK, RWORK, IINFO )
730 IF( IINFO.NE.0 ) THEN
732 WRITE( NOUNIT, FMT = 9993 )'CGEEV1', IINFO, N, JTYPE,
740 CALL CGET22( 'N', 'N', 'N', N, A, LDA, VR, LDVR, W, WORK,
742 RESULT( 1 ) = RES( 1 )
746 CALL CGET22( 'C', 'N', 'C', N, A, LDA, VL, LDVL, W, WORK,
748 RESULT( 2 ) = RES( 1 )
753 TNRM = SCNRM2( N, VR( 1, J ), 1 )
754 RESULT( 3 ) = MAX( RESULT( 3 ),
755 $ MIN( ULPINV, ABS( TNRM-ONE ) / ULP ) )
759 VTST = ABS( VR( JJ, J ) )
762 IF( AIMAG( VR( JJ, J ) ).EQ.ZERO .AND.
763 $ ABS( REAL( VR( JJ, J ) ) ).GT.VRMX )
764 $ VRMX = ABS( REAL( VR( JJ, J ) ) )
766 IF( VRMX / VMX.LT.ONE-TWO*ULP )
767 $ RESULT( 3 ) = ULPINV
773 TNRM = SCNRM2( N, VL( 1, J ), 1 )
774 RESULT( 4 ) = MAX( RESULT( 4 ),
775 $ MIN( ULPINV, ABS( TNRM-ONE ) / ULP ) )
779 VTST = ABS( VL( JJ, J ) )
782 IF( AIMAG( VL( JJ, J ) ).EQ.ZERO .AND.
783 $ ABS( REAL( VL( JJ, J ) ) ).GT.VRMX )
784 $ VRMX = ABS( REAL( VL( JJ, J ) ) )
786 IF( VRMX / VMX.LT.ONE-TWO*ULP )
787 $ RESULT( 4 ) = ULPINV
790 * Compute eigenvalues only, and test them
792 CALL CLACPY( 'F', N, N, A, LDA, H, LDA )
793 CALL CGEEV( 'N', 'N', N, H, LDA, W1, DUM, 1, DUM, 1,
794 $ WORK, NNWORK, RWORK, IINFO )
795 IF( IINFO.NE.0 ) THEN
797 WRITE( NOUNIT, FMT = 9993 )'CGEEV2', IINFO, N, JTYPE,
806 IF( W( J ).NE.W1( J ) )
807 $ RESULT( 5 ) = ULPINV
810 * Compute eigenvalues and right eigenvectors, and test them
812 CALL CLACPY( 'F', N, N, A, LDA, H, LDA )
813 CALL CGEEV( 'N', 'V', N, H, LDA, W1, DUM, 1, LRE, LDLRE,
814 $ WORK, NNWORK, RWORK, IINFO )
815 IF( IINFO.NE.0 ) THEN
817 WRITE( NOUNIT, FMT = 9993 )'CGEEV3', IINFO, N, JTYPE,
826 IF( W( J ).NE.W1( J ) )
827 $ RESULT( 5 ) = ULPINV
834 IF( VR( J, JJ ).NE.LRE( J, JJ ) )
835 $ RESULT( 6 ) = ULPINV
839 * Compute eigenvalues and left eigenvectors, and test them
841 CALL CLACPY( 'F', N, N, A, LDA, H, LDA )
842 CALL CGEEV( 'V', 'N', N, H, LDA, W1, LRE, LDLRE, DUM, 1,
843 $ WORK, NNWORK, RWORK, IINFO )
844 IF( IINFO.NE.0 ) THEN
846 WRITE( NOUNIT, FMT = 9993 )'CGEEV4', IINFO, N, JTYPE,
855 IF( W( J ).NE.W1( J ) )
856 $ RESULT( 5 ) = ULPINV
863 IF( VL( J, JJ ).NE.LRE( J, JJ ) )
864 $ RESULT( 7 ) = ULPINV
868 * End of Loop -- Check for RESULT(j) > THRESH
875 IF( RESULT( J ).GE.ZERO )
877 IF( RESULT( J ).GE.THRESH )
882 $ NTESTF = NTESTF + 1
883 IF( NTESTF.EQ.1 ) THEN
884 WRITE( NOUNIT, FMT = 9999 )PATH
885 WRITE( NOUNIT, FMT = 9998 )
886 WRITE( NOUNIT, FMT = 9997 )
887 WRITE( NOUNIT, FMT = 9996 )
888 WRITE( NOUNIT, FMT = 9995 )THRESH
893 IF( RESULT( J ).GE.THRESH ) THEN
894 WRITE( NOUNIT, FMT = 9994 )N, IWK, IOLDSD, JTYPE,
899 NERRS = NERRS + NFAIL
900 NTESTT = NTESTT + NTEST
908 CALL SLASUM( PATH, NOUNIT, NERRS, NTESTT )
910 9999 FORMAT( / 1X, A3, ' -- Complex Eigenvalue-Eigenvector ',
911 $ 'Decomposition Driver', /
912 $ ' Matrix types (see CDRVEV for details): ' )
914 9998 FORMAT( / ' Special Matrices:', / ' 1=Zero matrix. ',
915 $ ' ', ' 5=Diagonal: geometr. spaced entries.',
916 $ / ' 2=Identity matrix. ', ' 6=Diagona',
917 $ 'l: clustered entries.', / ' 3=Transposed Jordan block. ',
918 $ ' ', ' 7=Diagonal: large, evenly spaced.', / ' ',
919 $ '4=Diagonal: evenly spaced entries. ', ' 8=Diagonal: s',
920 $ 'mall, evenly spaced.' )
921 9997 FORMAT( ' Dense, Non-Symmetric Matrices:', / ' 9=Well-cond., ev',
922 $ 'enly spaced eigenvals.', ' 14=Ill-cond., geomet. spaced e',
923 $ 'igenals.', / ' 10=Well-cond., geom. spaced eigenvals. ',
924 $ ' 15=Ill-conditioned, clustered e.vals.', / ' 11=Well-cond',
925 $ 'itioned, clustered e.vals. ', ' 16=Ill-cond., random comp',
926 $ 'lex ', A6, / ' 12=Well-cond., random complex ', A6, ' ',
927 $ ' 17=Ill-cond., large rand. complx ', A4, / ' 13=Ill-condi',
928 $ 'tioned, evenly spaced. ', ' 18=Ill-cond., small rand.',
930 9996 FORMAT( ' 19=Matrix with random O(1) entries. ', ' 21=Matrix ',
931 $ 'with small random entries.', / ' 20=Matrix with large ran',
932 $ 'dom entries. ', / )
933 9995 FORMAT( ' Tests performed with test threshold =', F8.2,
934 $ / / ' 1 = | A VR - VR W | / ( n |A| ulp ) ',
935 $ / ' 2 = | conj-trans(A) VL - VL conj-trans(W) | /',
936 $ ' ( n |A| ulp ) ', / ' 3 = | |VR(i)| - 1 | / ulp ',
937 $ / ' 4 = | |VL(i)| - 1 | / ulp ',
938 $ / ' 5 = 0 if W same no matter if VR or VL computed,',
939 $ ' 1/ulp otherwise', /
940 $ ' 6 = 0 if VR same no matter if VL computed,',
941 $ ' 1/ulp otherwise', /
942 $ ' 7 = 0 if VL same no matter if VR computed,',
943 $ ' 1/ulp otherwise', / )
944 9994 FORMAT( ' N=', I5, ', IWK=', I2, ', seed=', 4( I4, ',' ),
945 $ ' type ', I2, ', test(', I2, ')=', G10.3 )
946 9993 FORMAT( ' CDRVEV: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',
947 $ I6, ', JTYPE=', I6, ', ISEED=(', 3( I5, ',' ), I5, ')' )