3 * =========== DOCUMENTATION ===========
5 * Online html documentation available at
6 * http://www.netlib.org/lapack/explore-html/
11 * SUBROUTINE SDRVSG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH,
12 * NOUNIT, A, LDA, B, LDB, D, Z, LDZ, AB, BB, AP,
13 * BP, WORK, NWORK, IWORK, LIWORK, RESULT, INFO )
15 * .. Scalar Arguments ..
16 * INTEGER INFO, LDA, LDB, LDZ, LIWORK, NOUNIT, NSIZES,
20 * .. Array Arguments ..
22 * INTEGER ISEED( 4 ), IWORK( * ), NN( * )
23 * REAL A( LDA, * ), AB( LDA, * ), AP( * ),
24 * $ B( LDB, * ), BB( LDB, * ), BP( * ), D( * ),
25 * $ RESULT( * ), WORK( * ), Z( LDZ, * )
34 *> SDRVSG checks the real symmetric generalized eigenproblem
37 *> SSYGV computes all eigenvalues and, optionally,
38 *> eigenvectors of a real symmetric-definite generalized
41 *> SSYGVD computes all eigenvalues and, optionally,
42 *> eigenvectors of a real symmetric-definite generalized
43 *> eigenproblem using a divide and conquer algorithm.
45 *> SSYGVX computes selected eigenvalues and, optionally,
46 *> eigenvectors of a real symmetric-definite generalized
49 *> SSPGV computes all eigenvalues and, optionally,
50 *> eigenvectors of a real symmetric-definite generalized
51 *> eigenproblem in packed storage.
53 *> SSPGVD computes all eigenvalues and, optionally,
54 *> eigenvectors of a real symmetric-definite generalized
55 *> eigenproblem in packed storage using a divide and
58 *> SSPGVX computes selected eigenvalues and, optionally,
59 *> eigenvectors of a real symmetric-definite generalized
60 *> eigenproblem in packed storage.
62 *> SSBGV computes all eigenvalues and, optionally,
63 *> eigenvectors of a real symmetric-definite banded
64 *> generalized eigenproblem.
66 *> SSBGVD computes all eigenvalues and, optionally,
67 *> eigenvectors of a real symmetric-definite banded
68 *> generalized eigenproblem using a divide and conquer
71 *> SSBGVX computes selected eigenvalues and, optionally,
72 *> eigenvectors of a real symmetric-definite banded
73 *> generalized eigenproblem.
75 *> When SDRVSG is called, a number of matrix "sizes" ("n's") and a
76 *> number of matrix "types" are specified. For each size ("n")
77 *> and each type of matrix, one matrix A of the given type will be
78 *> generated; a random well-conditioned matrix B is also generated
79 *> and the pair (A,B) is used to test the drivers.
81 *> For each pair (A,B), the following tests are performed:
83 *> (1) SSYGV with ITYPE = 1 and UPLO ='U':
85 *> | A Z - B Z D | / ( |A| |Z| n ulp )
87 *> (2) as (1) but calling SSPGV
88 *> (3) as (1) but calling SSBGV
89 *> (4) as (1) but with UPLO = 'L'
90 *> (5) as (4) but calling SSPGV
91 *> (6) as (4) but calling SSBGV
93 *> (7) SSYGV with ITYPE = 2 and UPLO ='U':
95 *> | A B Z - Z D | / ( |A| |Z| n ulp )
97 *> (8) as (7) but calling SSPGV
98 *> (9) as (7) but with UPLO = 'L'
99 *> (10) as (9) but calling SSPGV
101 *> (11) SSYGV with ITYPE = 3 and UPLO ='U':
103 *> | B A Z - Z D | / ( |A| |Z| n ulp )
105 *> (12) as (11) but calling SSPGV
106 *> (13) as (11) but with UPLO = 'L'
107 *> (14) as (13) but calling SSPGV
109 *> SSYGVD, SSPGVD and SSBGVD performed the same 14 tests.
111 *> SSYGVX, SSPGVX and SSBGVX performed the above 14 tests with
112 *> the parameter RANGE = 'A', 'N' and 'I', respectively.
114 *> The "sizes" are specified by an array NN(1:NSIZES); the value
115 *> of each element NN(j) specifies one size.
116 *> The "types" are specified by a logical array DOTYPE( 1:NTYPES );
117 *> if DOTYPE(j) is .TRUE., then matrix type "j" will be generated.
118 *> This type is used for the matrix A which has half-bandwidth KA.
119 *> B is generated as a well-conditioned positive definite matrix
120 *> with half-bandwidth KB (<= KA).
121 *> Currently, the list of possible types for A is:
123 *> (1) The zero matrix.
124 *> (2) The identity matrix.
126 *> (3) A diagonal matrix with evenly spaced entries
127 *> 1, ..., ULP and random signs.
128 *> (ULP = (first number larger than 1) - 1 )
129 *> (4) A diagonal matrix with geometrically spaced entries
130 *> 1, ..., ULP and random signs.
131 *> (5) A diagonal matrix with "clustered" entries
132 *> 1, ULP, ..., ULP and random signs.
134 *> (6) Same as (4), but multiplied by SQRT( overflow threshold )
135 *> (7) Same as (4), but multiplied by SQRT( underflow threshold )
137 *> (8) A matrix of the form U* D U, where U is orthogonal and
138 *> D has evenly spaced entries 1, ..., ULP with random signs
141 *> (9) A matrix of the form U* D U, where U is orthogonal and
142 *> D has geometrically spaced entries 1, ..., ULP with random
143 *> signs on the diagonal.
145 *> (10) A matrix of the form U* D U, where U is orthogonal and
146 *> D has "clustered" entries 1, ULP,..., ULP with random
147 *> signs on the diagonal.
149 *> (11) Same as (8), but multiplied by SQRT( overflow threshold )
150 *> (12) Same as (8), but multiplied by SQRT( underflow threshold )
152 *> (13) symmetric matrix with random entries chosen from (-1,1).
153 *> (14) Same as (13), but multiplied by SQRT( overflow threshold )
154 *> (15) Same as (13), but multiplied by SQRT( underflow threshold)
156 *> (16) Same as (8), but with KA = 1 and KB = 1
157 *> (17) Same as (8), but with KA = 2 and KB = 1
158 *> (18) Same as (8), but with KA = 2 and KB = 2
159 *> (19) Same as (8), but with KA = 3 and KB = 1
160 *> (20) Same as (8), but with KA = 3 and KB = 2
161 *> (21) Same as (8), but with KA = 3 and KB = 3
169 *> The number of sizes of matrices to use. If it is zero,
170 *> SDRVSG does nothing. It must be at least zero.
173 *> NN INTEGER array, dimension (NSIZES)
174 *> An array containing the sizes to be used for the matrices.
175 *> Zero values will be skipped. The values must be at least
180 *> The number of elements in DOTYPE. If it is zero, SDRVSG
181 *> does nothing. It must be at least zero. If it is MAXTYP+1
182 *> and NSIZES is 1, then an additional type, MAXTYP+1 is
183 *> defined, which is to use whatever matrix is in A. This
184 *> is only useful if DOTYPE(1:MAXTYP) is .FALSE. and
185 *> DOTYPE(MAXTYP+1) is .TRUE. .
188 *> DOTYPE LOGICAL array, dimension (NTYPES)
189 *> If DOTYPE(j) is .TRUE., then for each size in NN a
190 *> matrix of that size and of type j will be generated.
191 *> If NTYPES is smaller than the maximum number of types
192 *> defined (PARAMETER MAXTYP), then types NTYPES+1 through
193 *> MAXTYP will not be generated. If NTYPES is larger
194 *> than MAXTYP, DOTYPE(MAXTYP+1) through DOTYPE(NTYPES)
198 *> ISEED INTEGER array, dimension (4)
199 *> On entry ISEED specifies the seed of the random number
200 *> generator. The array elements should be between 0 and 4095;
201 *> if not they will be reduced mod 4096. Also, ISEED(4) must
202 *> be odd. The random number generator uses a linear
203 *> congruential sequence limited to small integers, and so
204 *> should produce machine independent random numbers. The
205 *> values of ISEED are changed on exit, and can be used in the
206 *> next call to SDRVSG to continue the same random number
211 *> A test will count as "failed" if the "error", computed as
212 *> described above, exceeds THRESH. Note that the error
213 *> is scaled to be O(1), so THRESH should be a reasonably
214 *> small multiple of 1, e.g., 10 or 100. In particular,
215 *> it should not depend on the precision (single vs. double)
216 *> or the size of the matrix. It must be at least zero.
220 *> The FORTRAN unit number for printing out error messages
221 *> (e.g., if a routine returns IINFO not equal to 0.)
224 *> A REAL array, dimension (LDA , max(NN))
225 *> Used to hold the matrix whose eigenvalues are to be
226 *> computed. On exit, A contains the last matrix actually
231 *> The leading dimension of A and AB. It must be at
232 *> least 1 and at least max( NN ).
235 *> B REAL array, dimension (LDB , max(NN))
236 *> Used to hold the symmetric positive definite matrix for
237 *> the generailzed problem.
238 *> On exit, B contains the last matrix actually
243 *> The leading dimension of B and BB. It must be at
244 *> least 1 and at least max( NN ).
247 *> D REAL array, dimension (max(NN))
248 *> The eigenvalues of A. On exit, the eigenvalues in D
249 *> correspond with the matrix in A.
252 *> Z REAL array, dimension (LDZ, max(NN))
253 *> The matrix of eigenvectors.
257 *> The leading dimension of Z. It must be at least 1 and
258 *> at least max( NN ).
261 *> AB REAL array, dimension (LDA, max(NN))
265 *> BB REAL array, dimension (LDB, max(NN))
269 *> AP REAL array, dimension (max(NN)**2)
273 *> BP REAL array, dimension (max(NN)**2)
277 *> WORK REAL array, dimension (NWORK)
282 *> The number of entries in WORK. This must be at least
283 *> 1+5*N+2*N*lg(N)+3*N**2 where N = max( NN(j) ) and
284 *> lg( N ) = smallest integer k such that 2**k >= N.
287 *> IWORK INTEGER array, dimension (LIWORK)
292 *> The number of entries in WORK. This must be at least 6*N.
295 *> RESULT REAL array, dimension (70)
296 *> The values computed by the 70 tests described above.
300 *> If 0, then everything ran OK.
302 *> -2: Some NN(j) < 0
305 *> -9: LDA < 1 or LDA < NMAX, where NMAX is max( NN(j) ).
306 *> -16: LDZ < 1 or LDZ < NMAX.
307 *> -21: NWORK too small.
308 *> -23: LIWORK too small.
309 *> If SLATMR, SLATMS, SSYGV, SSPGV, SSBGV, SSYGVD, SSPGVD,
310 *> SSBGVD, SSYGVX, SSPGVX or SSBGVX returns an error code,
311 *> the absolute value of it is returned.
314 *> ----------------------------------------------------------------------
316 *> Some Local Variables and Parameters:
317 *> ---- ----- --------- --- ----------
318 *> ZERO, ONE Real 0 and 1.
319 *> MAXTYP The number of types defined.
320 *> NTEST The number of tests that have been run
322 *> NTESTT The total number of tests for this call.
323 *> NMAX Largest value in NN.
324 *> NMATS The number of matrices generated so far.
325 *> NERRS The number of tests which have exceeded THRESH
326 *> so far (computed by SLAFTS).
327 *> COND, IMODE Values to be passed to the matrix generators.
328 *> ANORM Norm of A; passed to matrix generators.
330 *> OVFL, UNFL Overflow and underflow thresholds.
331 *> ULP, ULPINV Finest relative precision and its inverse.
332 *> RTOVFL, RTUNFL Square roots of the previous 2 values.
333 *> The following four arrays decode JTYPE:
334 *> KTYPE(j) The general type (1-10) for type "j".
335 *> KMODE(j) The MODE value to be passed to the matrix
336 *> generator for type "j".
337 *> KMAGN(j) The order of magnitude ( O(1),
338 *> O(overflow^(1/2) ), O(underflow^(1/2) )
344 *> \author Univ. of Tennessee
345 *> \author Univ. of California Berkeley
346 *> \author Univ. of Colorado Denver
349 *> \date November 2011
351 *> \ingroup single_eig
353 * =====================================================================
354 SUBROUTINE SDRVSG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH,
355 $ NOUNIT, A, LDA, B, LDB, D, Z, LDZ, AB, BB, AP,
356 $ BP, WORK, NWORK, IWORK, LIWORK, RESULT, INFO )
358 * -- LAPACK test routine (version 3.4.0) --
359 * -- LAPACK is a software package provided by Univ. of Tennessee, --
360 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
363 * .. Scalar Arguments ..
364 INTEGER INFO, LDA, LDB, LDZ, LIWORK, NOUNIT, NSIZES,
368 * .. Array Arguments ..
370 INTEGER ISEED( 4 ), IWORK( * ), NN( * )
371 REAL A( LDA, * ), AB( LDA, * ), AP( * ),
372 $ B( LDB, * ), BB( LDB, * ), BP( * ), D( * ),
373 $ RESULT( * ), WORK( * ), Z( LDZ, * )
376 * =====================================================================
380 PARAMETER ( ZERO = 0.0E0, ONE = 1.0E0, TEN = 10.0E0 )
382 PARAMETER ( MAXTYP = 21 )
384 * .. Local Scalars ..
387 INTEGER I, IBTYPE, IBUPLO, IINFO, IJ, IL, IMODE, ITEMP,
388 $ ITYPE, IU, J, JCOL, JSIZE, JTYPE, KA, KA9, KB,
389 $ KB9, M, MTYPES, N, NERRS, NMATS, NMAX, NTEST,
391 REAL ABSTOL, ANINV, ANORM, COND, OVFL, RTOVFL,
392 $ RTUNFL, ULP, ULPINV, UNFL, VL, VU
395 INTEGER IDUMMA( 1 ), IOLDSD( 4 ), ISEED2( 4 ),
396 $ KMAGN( MAXTYP ), KMODE( MAXTYP ),
399 * .. External Functions ..
402 EXTERNAL LSAME, SLAMCH, SLARND
404 * .. External Subroutines ..
405 EXTERNAL SLABAD, SLACPY, SLAFTS, SLASET, SLASUM, SLATMR,
406 $ SLATMS, SSBGV, SSBGVD, SSBGVX, SSGT01, SSPGV,
407 $ SSPGVD, SSPGVX, SSYGV, SSYGVD, SSYGVX, XERBLA
409 * .. Intrinsic Functions ..
410 INTRINSIC ABS, MAX, MIN, REAL, SQRT
412 * .. Data statements ..
413 DATA KTYPE / 1, 2, 5*4, 5*5, 3*8, 6*9 /
414 DATA KMAGN / 2*1, 1, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1,
416 DATA KMODE / 2*0, 4, 3, 1, 4, 4, 4, 3, 1, 4, 4, 0,
419 * .. Executable Statements ..
421 * 1) Check for errors
429 NMAX = MAX( NMAX, NN( J ) )
436 IF( NSIZES.LT.0 ) THEN
438 ELSE IF( BADNN ) THEN
440 ELSE IF( NTYPES.LT.0 ) THEN
442 ELSE IF( LDA.LE.1 .OR. LDA.LT.NMAX ) THEN
444 ELSE IF( LDZ.LE.1 .OR. LDZ.LT.NMAX ) THEN
446 ELSE IF( 2*MAX( NMAX, 3 )**2.GT.NWORK ) THEN
448 ELSE IF( 2*MAX( NMAX, 3 )**2.GT.LIWORK ) THEN
453 CALL XERBLA( 'SDRVSG', -INFO )
457 * Quick return if possible
459 IF( NSIZES.EQ.0 .OR. NTYPES.EQ.0 )
462 * More Important constants
464 UNFL = SLAMCH( 'Safe minimum' )
465 OVFL = SLAMCH( 'Overflow' )
466 CALL SLABAD( UNFL, OVFL )
467 ULP = SLAMCH( 'Epsilon' )*SLAMCH( 'Base' )
469 RTUNFL = SQRT( UNFL )
470 RTOVFL = SQRT( OVFL )
473 ISEED2( I ) = ISEED( I )
476 * Loop over sizes, types
481 DO 650 JSIZE = 1, NSIZES
483 ANINV = ONE / REAL( MAX( 1, N ) )
485 IF( NSIZES.NE.1 ) THEN
486 MTYPES = MIN( MAXTYP, NTYPES )
488 MTYPES = MIN( MAXTYP+1, NTYPES )
493 DO 640 JTYPE = 1, MTYPES
494 IF( .NOT.DOTYPE( JTYPE ) )
500 IOLDSD( J ) = ISEED( J )
505 * Control parameters:
508 * =1 O(1) clustered 1 zero
509 * =2 large clustered 2 identity
510 * =3 small exponential (none)
511 * =4 arithmetic diagonal, w/ eigenvalues
512 * =5 random log hermitian, w/ eigenvalues
515 * =8 random hermitian
516 * =9 banded, w/ eigenvalues
518 IF( MTYPES.GT.MAXTYP )
521 ITYPE = KTYPE( JTYPE )
522 IMODE = KMODE( JTYPE )
526 GO TO ( 40, 50, 60 )KMAGN( JTYPE )
533 ANORM = ( RTOVFL*ULP )*ANINV
537 ANORM = RTUNFL*N*ULPINV
545 * Special Matrices -- Identity & Jordan block
547 IF( ITYPE.EQ.1 ) THEN
553 CALL SLASET( 'Full', LDA, N, ZERO, ZERO, A, LDA )
555 ELSE IF( ITYPE.EQ.2 ) THEN
561 CALL SLASET( 'Full', LDA, N, ZERO, ZERO, A, LDA )
563 A( JCOL, JCOL ) = ANORM
566 ELSE IF( ITYPE.EQ.4 ) THEN
568 * Diagonal Matrix, [Eigen]values Specified
572 CALL SLATMS( N, N, 'S', ISEED, 'S', WORK, IMODE, COND,
573 $ ANORM, 0, 0, 'N', A, LDA, WORK( N+1 ),
576 ELSE IF( ITYPE.EQ.5 ) THEN
578 * symmetric, eigenvalues specified
582 CALL SLATMS( N, N, 'S', ISEED, 'S', WORK, IMODE, COND,
583 $ ANORM, N, N, 'N', A, LDA, WORK( N+1 ),
586 ELSE IF( ITYPE.EQ.7 ) THEN
588 * Diagonal, random eigenvalues
592 CALL SLATMR( N, N, 'S', ISEED, 'S', WORK, 6, ONE, ONE,
593 $ 'T', 'N', WORK( N+1 ), 1, ONE,
594 $ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, 0, 0,
595 $ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
597 ELSE IF( ITYPE.EQ.8 ) THEN
599 * symmetric, random eigenvalues
603 CALL SLATMR( N, N, 'S', ISEED, 'H', WORK, 6, ONE, ONE,
604 $ 'T', 'N', WORK( N+1 ), 1, ONE,
605 $ WORK( 2*N+1 ), 1, ONE, 'N', IDUMMA, N, N,
606 $ ZERO, ANORM, 'NO', A, LDA, IWORK, IINFO )
608 ELSE IF( ITYPE.EQ.9 ) THEN
610 * symmetric banded, eigenvalues specified
612 * The following values are used for the half-bandwidths:
622 IF( KB9.GT.KA9 ) THEN
626 KA = MAX( 0, MIN( N-1, KA9 ) )
627 KB = MAX( 0, MIN( N-1, KB9 ) )
628 CALL SLATMS( N, N, 'S', ISEED, 'S', WORK, IMODE, COND,
629 $ ANORM, KA, KA, 'N', A, LDA, WORK( N+1 ),
637 IF( IINFO.NE.0 ) THEN
638 WRITE( NOUNIT, FMT = 9999 )'Generator', IINFO, N, JTYPE,
651 IL = 1 + ( N-1 )*SLARND( 1, ISEED2 )
652 IU = 1 + ( N-1 )*SLARND( 1, ISEED2 )
660 * 3) Call SSYGV, SSPGV, SSBGV, SSYGVD, SSPGVD, SSBGVD,
661 * SSYGVX, SSPGVX, and SSBGVX, do tests.
663 * loop over the three generalized problems
664 * IBTYPE = 1: A*x = (lambda)*B*x
665 * IBTYPE = 2: A*B*x = (lambda)*x
666 * IBTYPE = 3: B*A*x = (lambda)*x
670 * loop over the setting UPLO
678 * Generate random well-conditioned positive definite
679 * matrix B, of bandwidth not greater than that of A.
681 CALL SLATMS( N, N, 'U', ISEED, 'P', WORK, 5, TEN, ONE,
682 $ KB, KB, UPLO, B, LDB, WORK( N+1 ),
689 CALL SLACPY( ' ', N, N, A, LDA, Z, LDZ )
690 CALL SLACPY( UPLO, N, N, B, LDB, BB, LDB )
692 CALL SSYGV( IBTYPE, 'V', UPLO, N, Z, LDZ, BB, LDB, D,
693 $ WORK, NWORK, IINFO )
694 IF( IINFO.NE.0 ) THEN
695 WRITE( NOUNIT, FMT = 9999 )'SSYGV(V,' // UPLO //
696 $ ')', IINFO, N, JTYPE, IOLDSD
698 IF( IINFO.LT.0 ) THEN
701 RESULT( NTEST ) = ULPINV
708 CALL SSGT01( IBTYPE, UPLO, N, N, A, LDA, B, LDB, Z,
709 $ LDZ, D, WORK, RESULT( NTEST ) )
715 CALL SLACPY( ' ', N, N, A, LDA, Z, LDZ )
716 CALL SLACPY( UPLO, N, N, B, LDB, BB, LDB )
718 CALL SSYGVD( IBTYPE, 'V', UPLO, N, Z, LDZ, BB, LDB, D,
719 $ WORK, NWORK, IWORK, LIWORK, IINFO )
720 IF( IINFO.NE.0 ) THEN
721 WRITE( NOUNIT, FMT = 9999 )'SSYGVD(V,' // UPLO //
722 $ ')', IINFO, N, JTYPE, IOLDSD
724 IF( IINFO.LT.0 ) THEN
727 RESULT( NTEST ) = ULPINV
734 CALL SSGT01( IBTYPE, UPLO, N, N, A, LDA, B, LDB, Z,
735 $ LDZ, D, WORK, RESULT( NTEST ) )
741 CALL SLACPY( ' ', N, N, A, LDA, AB, LDA )
742 CALL SLACPY( UPLO, N, N, B, LDB, BB, LDB )
744 CALL SSYGVX( IBTYPE, 'V', 'A', UPLO, N, AB, LDA, BB,
745 $ LDB, VL, VU, IL, IU, ABSTOL, M, D, Z,
746 $ LDZ, WORK, NWORK, IWORK( N+1 ), IWORK,
748 IF( IINFO.NE.0 ) THEN
749 WRITE( NOUNIT, FMT = 9999 )'SSYGVX(V,A' // UPLO //
750 $ ')', IINFO, N, JTYPE, IOLDSD
752 IF( IINFO.LT.0 ) THEN
755 RESULT( NTEST ) = ULPINV
762 CALL SSGT01( IBTYPE, UPLO, N, N, A, LDA, B, LDB, Z,
763 $ LDZ, D, WORK, RESULT( NTEST ) )
767 CALL SLACPY( ' ', N, N, A, LDA, AB, LDA )
768 CALL SLACPY( UPLO, N, N, B, LDB, BB, LDB )
770 * since we do not know the exact eigenvalues of this
771 * eigenpair, we just set VL and VU as constants.
772 * It is quite possible that there are no eigenvalues
777 CALL SSYGVX( IBTYPE, 'V', 'V', UPLO, N, AB, LDA, BB,
778 $ LDB, VL, VU, IL, IU, ABSTOL, M, D, Z,
779 $ LDZ, WORK, NWORK, IWORK( N+1 ), IWORK,
781 IF( IINFO.NE.0 ) THEN
782 WRITE( NOUNIT, FMT = 9999 )'SSYGVX(V,V,' //
783 $ UPLO // ')', IINFO, N, JTYPE, IOLDSD
785 IF( IINFO.LT.0 ) THEN
788 RESULT( NTEST ) = ULPINV
795 CALL SSGT01( IBTYPE, UPLO, N, M, A, LDA, B, LDB, Z,
796 $ LDZ, D, WORK, RESULT( NTEST ) )
800 CALL SLACPY( ' ', N, N, A, LDA, AB, LDA )
801 CALL SLACPY( UPLO, N, N, B, LDB, BB, LDB )
803 CALL SSYGVX( IBTYPE, 'V', 'I', UPLO, N, AB, LDA, BB,
804 $ LDB, VL, VU, IL, IU, ABSTOL, M, D, Z,
805 $ LDZ, WORK, NWORK, IWORK( N+1 ), IWORK,
807 IF( IINFO.NE.0 ) THEN
808 WRITE( NOUNIT, FMT = 9999 )'SSYGVX(V,I,' //
809 $ UPLO // ')', IINFO, N, JTYPE, IOLDSD
811 IF( IINFO.LT.0 ) THEN
814 RESULT( NTEST ) = ULPINV
821 CALL SSGT01( IBTYPE, UPLO, N, M, A, LDA, B, LDB, Z,
822 $ LDZ, D, WORK, RESULT( NTEST ) )
830 * Copy the matrices into packed storage.
832 IF( LSAME( UPLO, 'U' ) ) THEN
852 CALL SSPGV( IBTYPE, 'V', UPLO, N, AP, BP, D, Z, LDZ,
854 IF( IINFO.NE.0 ) THEN
855 WRITE( NOUNIT, FMT = 9999 )'SSPGV(V,' // UPLO //
856 $ ')', IINFO, N, JTYPE, IOLDSD
858 IF( IINFO.LT.0 ) THEN
861 RESULT( NTEST ) = ULPINV
868 CALL SSGT01( IBTYPE, UPLO, N, N, A, LDA, B, LDB, Z,
869 $ LDZ, D, WORK, RESULT( NTEST ) )
875 * Copy the matrices into packed storage.
877 IF( LSAME( UPLO, 'U' ) ) THEN
897 CALL SSPGVD( IBTYPE, 'V', UPLO, N, AP, BP, D, Z, LDZ,
898 $ WORK, NWORK, IWORK, LIWORK, IINFO )
899 IF( IINFO.NE.0 ) THEN
900 WRITE( NOUNIT, FMT = 9999 )'SSPGVD(V,' // UPLO //
901 $ ')', IINFO, N, JTYPE, IOLDSD
903 IF( IINFO.LT.0 ) THEN
906 RESULT( NTEST ) = ULPINV
913 CALL SSGT01( IBTYPE, UPLO, N, N, A, LDA, B, LDB, Z,
914 $ LDZ, D, WORK, RESULT( NTEST ) )
920 * Copy the matrices into packed storage.
922 IF( LSAME( UPLO, 'U' ) ) THEN
942 CALL SSPGVX( IBTYPE, 'V', 'A', UPLO, N, AP, BP, VL,
943 $ VU, IL, IU, ABSTOL, M, D, Z, LDZ, WORK,
944 $ IWORK( N+1 ), IWORK, INFO )
945 IF( IINFO.NE.0 ) THEN
946 WRITE( NOUNIT, FMT = 9999 )'SSPGVX(V,A' // UPLO //
947 $ ')', IINFO, N, JTYPE, IOLDSD
949 IF( IINFO.LT.0 ) THEN
952 RESULT( NTEST ) = ULPINV
959 CALL SSGT01( IBTYPE, UPLO, N, M, A, LDA, B, LDB, Z,
960 $ LDZ, D, WORK, RESULT( NTEST ) )
964 * Copy the matrices into packed storage.
966 IF( LSAME( UPLO, 'U' ) ) THEN
988 CALL SSPGVX( IBTYPE, 'V', 'V', UPLO, N, AP, BP, VL,
989 $ VU, IL, IU, ABSTOL, M, D, Z, LDZ, WORK,
990 $ IWORK( N+1 ), IWORK, INFO )
991 IF( IINFO.NE.0 ) THEN
992 WRITE( NOUNIT, FMT = 9999 )'SSPGVX(V,V' // UPLO //
993 $ ')', IINFO, N, JTYPE, IOLDSD
995 IF( IINFO.LT.0 ) THEN
998 RESULT( NTEST ) = ULPINV
1005 CALL SSGT01( IBTYPE, UPLO, N, M, A, LDA, B, LDB, Z,
1006 $ LDZ, D, WORK, RESULT( NTEST ) )
1010 * Copy the matrices into packed storage.
1012 IF( LSAME( UPLO, 'U' ) ) THEN
1016 AP( IJ ) = A( I, J )
1017 BP( IJ ) = B( I, J )
1025 AP( IJ ) = A( I, J )
1026 BP( IJ ) = B( I, J )
1032 CALL SSPGVX( IBTYPE, 'V', 'I', UPLO, N, AP, BP, VL,
1033 $ VU, IL, IU, ABSTOL, M, D, Z, LDZ, WORK,
1034 $ IWORK( N+1 ), IWORK, INFO )
1035 IF( IINFO.NE.0 ) THEN
1036 WRITE( NOUNIT, FMT = 9999 )'SSPGVX(V,I' // UPLO //
1037 $ ')', IINFO, N, JTYPE, IOLDSD
1039 IF( IINFO.LT.0 ) THEN
1042 RESULT( NTEST ) = ULPINV
1049 CALL SSGT01( IBTYPE, UPLO, N, M, A, LDA, B, LDB, Z,
1050 $ LDZ, D, WORK, RESULT( NTEST ) )
1054 IF( IBTYPE.EQ.1 ) THEN
1060 * Copy the matrices into band storage.
1062 IF( LSAME( UPLO, 'U' ) ) THEN
1064 DO 320 I = MAX( 1, J-KA ), J
1065 AB( KA+1+I-J, J ) = A( I, J )
1067 DO 330 I = MAX( 1, J-KB ), J
1068 BB( KB+1+I-J, J ) = B( I, J )
1073 DO 350 I = J, MIN( N, J+KA )
1074 AB( 1+I-J, J ) = A( I, J )
1076 DO 360 I = J, MIN( N, J+KB )
1077 BB( 1+I-J, J ) = B( I, J )
1082 CALL SSBGV( 'V', UPLO, N, KA, KB, AB, LDA, BB, LDB,
1083 $ D, Z, LDZ, WORK, IINFO )
1084 IF( IINFO.NE.0 ) THEN
1085 WRITE( NOUNIT, FMT = 9999 )'SSBGV(V,' //
1086 $ UPLO // ')', IINFO, N, JTYPE, IOLDSD
1088 IF( IINFO.LT.0 ) THEN
1091 RESULT( NTEST ) = ULPINV
1098 CALL SSGT01( IBTYPE, UPLO, N, N, A, LDA, B, LDB, Z,
1099 $ LDZ, D, WORK, RESULT( NTEST ) )
1105 * Copy the matrices into band storage.
1107 IF( LSAME( UPLO, 'U' ) ) THEN
1109 DO 380 I = MAX( 1, J-KA ), J
1110 AB( KA+1+I-J, J ) = A( I, J )
1112 DO 390 I = MAX( 1, J-KB ), J
1113 BB( KB+1+I-J, J ) = B( I, J )
1118 DO 410 I = J, MIN( N, J+KA )
1119 AB( 1+I-J, J ) = A( I, J )
1121 DO 420 I = J, MIN( N, J+KB )
1122 BB( 1+I-J, J ) = B( I, J )
1127 CALL SSBGVD( 'V', UPLO, N, KA, KB, AB, LDA, BB,
1128 $ LDB, D, Z, LDZ, WORK, NWORK, IWORK,
1130 IF( IINFO.NE.0 ) THEN
1131 WRITE( NOUNIT, FMT = 9999 )'SSBGVD(V,' //
1132 $ UPLO // ')', IINFO, N, JTYPE, IOLDSD
1134 IF( IINFO.LT.0 ) THEN
1137 RESULT( NTEST ) = ULPINV
1144 CALL SSGT01( IBTYPE, UPLO, N, N, A, LDA, B, LDB, Z,
1145 $ LDZ, D, WORK, RESULT( NTEST ) )
1151 * Copy the matrices into band storage.
1153 IF( LSAME( UPLO, 'U' ) ) THEN
1155 DO 440 I = MAX( 1, J-KA ), J
1156 AB( KA+1+I-J, J ) = A( I, J )
1158 DO 450 I = MAX( 1, J-KB ), J
1159 BB( KB+1+I-J, J ) = B( I, J )
1164 DO 470 I = J, MIN( N, J+KA )
1165 AB( 1+I-J, J ) = A( I, J )
1167 DO 480 I = J, MIN( N, J+KB )
1168 BB( 1+I-J, J ) = B( I, J )
1173 CALL SSBGVX( 'V', 'A', UPLO, N, KA, KB, AB, LDA,
1174 $ BB, LDB, BP, MAX( 1, N ), VL, VU, IL,
1175 $ IU, ABSTOL, M, D, Z, LDZ, WORK,
1176 $ IWORK( N+1 ), IWORK, IINFO )
1177 IF( IINFO.NE.0 ) THEN
1178 WRITE( NOUNIT, FMT = 9999 )'SSBGVX(V,A' //
1179 $ UPLO // ')', IINFO, N, JTYPE, IOLDSD
1181 IF( IINFO.LT.0 ) THEN
1184 RESULT( NTEST ) = ULPINV
1191 CALL SSGT01( IBTYPE, UPLO, N, M, A, LDA, B, LDB, Z,
1192 $ LDZ, D, WORK, RESULT( NTEST ) )
1197 * Copy the matrices into band storage.
1199 IF( LSAME( UPLO, 'U' ) ) THEN
1201 DO 500 I = MAX( 1, J-KA ), J
1202 AB( KA+1+I-J, J ) = A( I, J )
1204 DO 510 I = MAX( 1, J-KB ), J
1205 BB( KB+1+I-J, J ) = B( I, J )
1210 DO 530 I = J, MIN( N, J+KA )
1211 AB( 1+I-J, J ) = A( I, J )
1213 DO 540 I = J, MIN( N, J+KB )
1214 BB( 1+I-J, J ) = B( I, J )
1221 CALL SSBGVX( 'V', 'V', UPLO, N, KA, KB, AB, LDA,
1222 $ BB, LDB, BP, MAX( 1, N ), VL, VU, IL,
1223 $ IU, ABSTOL, M, D, Z, LDZ, WORK,
1224 $ IWORK( N+1 ), IWORK, IINFO )
1225 IF( IINFO.NE.0 ) THEN
1226 WRITE( NOUNIT, FMT = 9999 )'SSBGVX(V,V' //
1227 $ UPLO // ')', IINFO, N, JTYPE, IOLDSD
1229 IF( IINFO.LT.0 ) THEN
1232 RESULT( NTEST ) = ULPINV
1239 CALL SSGT01( IBTYPE, UPLO, N, M, A, LDA, B, LDB, Z,
1240 $ LDZ, D, WORK, RESULT( NTEST ) )
1244 * Copy the matrices into band storage.
1246 IF( LSAME( UPLO, 'U' ) ) THEN
1248 DO 560 I = MAX( 1, J-KA ), J
1249 AB( KA+1+I-J, J ) = A( I, J )
1251 DO 570 I = MAX( 1, J-KB ), J
1252 BB( KB+1+I-J, J ) = B( I, J )
1257 DO 590 I = J, MIN( N, J+KA )
1258 AB( 1+I-J, J ) = A( I, J )
1260 DO 600 I = J, MIN( N, J+KB )
1261 BB( 1+I-J, J ) = B( I, J )
1266 CALL SSBGVX( 'V', 'I', UPLO, N, KA, KB, AB, LDA,
1267 $ BB, LDB, BP, MAX( 1, N ), VL, VU, IL,
1268 $ IU, ABSTOL, M, D, Z, LDZ, WORK,
1269 $ IWORK( N+1 ), IWORK, IINFO )
1270 IF( IINFO.NE.0 ) THEN
1271 WRITE( NOUNIT, FMT = 9999 )'SSBGVX(V,I' //
1272 $ UPLO // ')', IINFO, N, JTYPE, IOLDSD
1274 IF( IINFO.LT.0 ) THEN
1277 RESULT( NTEST ) = ULPINV
1284 CALL SSGT01( IBTYPE, UPLO, N, M, A, LDA, B, LDB, Z,
1285 $ LDZ, D, WORK, RESULT( NTEST ) )
1292 * End of Loop -- Check for RESULT(j) > THRESH
1294 NTESTT = NTESTT + NTEST
1295 CALL SLAFTS( 'SSG', N, N, JTYPE, NTEST, RESULT, IOLDSD,
1296 $ THRESH, NOUNIT, NERRS )
1302 CALL SLASUM( 'SSG', NOUNIT, NERRS, NTESTT )
1308 9999 FORMAT( ' SDRVSG: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',
1309 $ I6, ', JTYPE=', I6, ', ISEED=(', 3( I5, ',' ), I5, ')' )