DDRVSG(3)
๐ NAME ๐
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/EIG/ddrvsg.f
ok so that's literally the whole NAME section โ it's just the file path, bestie. it's DDRVSG, it lives at that path, and the rest of this page is the โจloreโจ.
โจ SYNOPSIS โจ
๐ฆ Functions/Subroutines ๐ฆ
DDRVSGโ the one and only subroutine this whole page is about.
subroutine DDRVSG (nsizes, nn, ntypes, dotype, iseed, thresh, nounit, a,
lda, b, ldb, d, z, ldz, ab, bb, ap, bp, work, nwork, iwork, liwork,
result, info)
DDRVSG
๐ Function/Subroutine Documentation ๐
ok so here's the FULL signature with every single type declaration, no cap, i'm not skipping a single one because that would be disrespectful to the compiler:
subroutine DDRVSG (integer nsizes, integer, dimension( * ) nn, integer
ntypes, logical, dimension( * ) dotype, integer, dimension( 4 ) iseed,
double precision thresh, integer nounit, double precision, dimension(
lda, * ) a, integer lda, double precision, dimension( ldb, * ) b,
integer ldb, double precision, dimension( * ) d, double precision,
dimension( ldz, * ) z, integer ldz, double precision, dimension( lda, *
) ab, double precision, dimension( ldb, * ) bb, double precision,
dimension( * ) ap, double precision, dimension( * ) bp, double
precision, dimension( * ) work, integer nwork, integer, dimension( * )
iwork, integer liwork, double precision, dimension( * ) result, integer
info)
DDRVSG
๐ธ Purpose ๐ธ
okay so picture this: DDRVSG is basically the quality-control bestie for the real symmetric generalized eigenproblem drivers. it doesn't do the math for you โ it checks the drivers that do the math. she's the vibe check. she's the group chat admin verifying everyone's homework. ๐ต๏ธโโ๏ธโจ
here's the cast of drivers she's checking on, and what each one does, in her own words:
DSYGVcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem.DSYGVDcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem using a divide and conquer algorithm.DSYGVXcomputes selected eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem.DSPGVcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem in packed storage.DSPGVDcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem in packed storage using a divide and conquer algorithm.DSPGVXcomputes selected eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem in packed storage.DSBGVcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite banded generalized eigenproblem.DSBGVDcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite banded generalized eigenproblem using a divide and conquer algorithm.DSBGVXcomputes selected eigenvalues and, optionally, eigenvectors of a real symmetric-definite banded generalized eigenproblem.
likeโฆ the range. the versatility. the way they all just exist. ๐
so when DDRVSG gets called, a number of matrix () and a number of matrix are specified. for each size () and each type of matrix, one matrix A of the given type will be generated; a random well-conditioned matrix B is also generated and the pair (A,B) is used to test the drivers.
like, one matrix A, one nice well-behaved B, and then the drivers get put through their paces together. it's giving collab era. ๐ซถ
๐ฅ the tests ๐ฅ
for each pair (A,B), the following tests are performed โ and yes, i'm listing all of them, we don't do "etc." in this house:
(1) DSYGV with ITYPE = 1 and UPLO ='U':
| A Z - B Z D | / ( |A| |Z| n ulp )
(2) as (1) but calling DSPGV
(3) as (1) but calling DSBGV
(4) as (1) but with UPLO = 'L'
(5) as (4) but calling DSPGV
(6) as (4) but calling DSBGV
(7) DSYGV with ITYPE = 2 and UPLO ='U':
| A B Z - Z D | / ( |A| |Z| n ulp )
(8) as (7) but calling DSPGV
(9) as (7) but with UPLO = 'L'
(10) as (9) but calling DSPGV
(11) DSYGV with ITYPE = 3 and UPLO ='U':
| B A Z - Z D | / ( |A| |Z| n ulp )
(12) as (11) but calling DSPGV
(13) as (11) but with UPLO = 'L'
(14) as (13) but calling DSPGV
notice the pattern?ITYPE1, 2, 3, andUPLO'U' then 'L', and the packed and banded friends tagging along. it's a whole routine. literally a whole routine. ๐ญ
DSYGVD, DSPGVD and DSBGVD performed the same 14 tests. same energy, different algorithm. ๐ซ
DSYGVX, DSPGVX and DSBGVX performed the above 14 tests with the parameter RANGE = 'A', 'N' and 'I', respectively. so that's 14 tests ร 3 range values for the X-suffixed girlies. she's thorough. she's that girl. ๐
๐ the matrices ๐
the are specified by an array NN(1:NSIZES); the value of each element NN(j) specifies one size.
the are specified by a logical array DOTYPE( 1:NTYPES ); if DOTYPE(j) is .TRUE., then matrix type will be generated. this type is used for the matrix A which has half-bandwidth KA. B is generated as a well-conditioned positive definite matrix with half-bandwidth KB (<= KA).
ok so KA is the main character half-bandwidth and KB is the well-behaved sidekick, and KB is always <= KA because she's polite. ๐
currently, the list of possible types for A is โ brace yourself, there's 21 of them and i'm giving you all 21:
(1) The zero matrix.
(2) The identity matrix.
(3) A diagonal matrix with evenly spaced entries 1, ..., ULP and random signs. (ULP = (first number larger than 1) - 1)
(4) A diagonal matrix with geometrically spaced entries 1, ..., ULP and random signs.
(5) A diagonal matrix with entries 1, ULP, ..., ULP and random signs.
(6) Same as (4), but multiplied by SQRT( overflow threshold )
(7) Same as (4), but multiplied by SQRT( underflow threshold )
(8) A matrix of the form U* D U, where U is orthogonal and D has evenly spaced entries 1, ..., ULP with random signs on the diagonal.
(9) A matrix of the form U* D U, where U is orthogonal and D has geometrically spaced entries 1, ..., ULP with random signs on the diagonal.
(10) A matrix of the form U* D U, where U is orthogonal and D has entries 1, ULP,..., ULP with random signs on the diagonal.
(11) Same as (8), but multiplied by SQRT( overflow threshold )
(12) Same as (8), but multiplied by SQRT( underflow threshold )
(13) symmetric matrix with random entries chosen from (-1,1).
(14) Same as (13), but multiplied by SQRT( overflow threshold )
(15) Same as (13), but multiplied by SQRT( underflow threshold)
(16) Same as (8), but with KA = 1 and KB = 1
(17) Same as (8), but with KA = 2 and KB = 1
(18) Same as (8), but with KA = 2 and KB = 2
(19) Same as (8), but with KA = 3 and KB = 1
(20) Same as (8), but with KA = 3 and KB = 2
(21) Same as (8), but with KA = 3 and KB = 3
quick vibe check on (6), (7), (11), (12), (14) and (15) โ those are the ones multiplied bySQRT( overflow threshold )andSQRT( underflow threshold ), so they're deliberately hanging out at the extreme edges of what floating point can handle. that's the whole point of them, bestie, don't be alarmed. ๐
and that's the matrix menu โ 21 flavours, evenly and geometrically spaced, orthogonal-sandwiched, banded, and threshold-pushed. a full buffet, no notes. ๐๐ง
NSIZES(INTEGER) โ The number of sizes of matrices to use. If it is zero,DDRVSGdoes nothing. It must be at least zero. Not modified.NN(INTEGER array, dimension (NSIZES)) โ An array containing the sizes to be used for the matrices. Zero values will be skipped. The values must be at least zero. Not modified.NTYPES(INTEGER) โ The number of elements inDOTYPE. If it is zero,DDRVSGdoes nothing. It must be at least zero. If it isMAXTYP+1andNSIZESis1, then an additional type,MAXTYP+1, is defined, which is to use whatever matrix is inA. This is only useful ifDOTYPE(1:MAXTYP)is.FALSE.andDOTYPE(MAXTYP+1)is.TRUE.. Not modified.DOTYPE(LOGICAL array, dimension (NTYPES)) โ IfDOTYPE(j)is.TRUE., then for each size inNNa matrix of that size and of typejwill be generated. IfNTYPESis smaller than the maximum number of types defined (PARAMETER MAXTYP), then typesNTYPES+1throughMAXTYPwill not be generated. IfNTYPESis larger thanMAXTYP,DOTYPE(MAXTYP+1)throughDOTYPE(NTYPES)will be ignored. Not modified.ISEED(INTEGER array, dimension (4)) โ On entryISEEDspecifies the seed of the random number generator. The array elements should be between0and4095; if not they will be reduced mod4096. Also,ISEED(4)must be odd. The random number generator uses a linear congruential sequence limited to small integers, and so should produce machine independent random numbers. The values ofISEEDare changed on exit, and can be used in the next call toDDRVSGto continue the same random number sequence. Modified.THRESH(DOUBLE PRECISION) โ A test will count as โฆ if the โฆ, computed as described above, exceedsTHRESH. (Yep, the source literally has blanks there โ I'm not out here inventing words, bestie.) Note that the error is scaled to beO(1), soTHRESHshould be a reasonably small multiple of1, e.g.,10or100. In particular, it should not depend on the precision (single vs. double) or the size of the matrix. It must be at least zero. Not modified.NOUNIT(INTEGER) โ TheFORTRANunit number for printing out error messages (e.g., if a routine returnsIINFOnot equal to0.) Not modified.AโDOUBLE PRECISIONarray, dimension(LDA , max(NN)). Used to hold the matrix whose eigenvalues are to be computed. On exit,Acontains the last matrix actually used. Modified.LDA(INTEGER) โ The leading dimension ofAandAB. It must be at least1and at leastmax( NN ). Not modified.BโDOUBLE PRECISIONarray, dimension(LDB , max(NN)). Used to hold the symmetric positive definite matrix for the generalized problem. On exit,Bcontains the last matrix actually used. Modified.LDB(INTEGER) โ The leading dimension ofBandBB. It must be at least1and at leastmax( NN ). Not modified.DโDOUBLE PRECISIONarray, dimension(max(NN)). The eigenvalues ofA. On exit, the eigenvalues inDcorrespond with the matrix inA. Modified.ZโDOUBLE PRECISIONarray, dimension(LDZ, max(NN)). The matrix of eigenvectors. Modified.LDZ(INTEGER) โ The leading dimension ofZ. It must be at least1and at leastmax( NN ). Not modified.ABโDOUBLE PRECISIONarray, dimension(LDA, max(NN)). Workspace. Modified.BBโDOUBLE PRECISIONarray, dimension(LDB, max(NN)). Workspace. Modified.APโDOUBLE PRECISIONarray, dimension(max(NN)**2). Workspace. Modified.BPโDOUBLE PRECISIONarray, dimension(max(NN)**2). Workspace. Modified.WORKโDOUBLE PRECISIONarray, dimension(NWORK). Workspace. Modified.NWORK(INTEGER) โ The number of entries inWORK. This must be at least1+5*N+2*N*lg(N)+3*N**2whereN = max( NN(j) )andlg( N ) = smallest integer k such that 2**k >= N. Not modified.IWORKโINTEGER array, dimension (LIWORK). Workspace. Modified.LIWORK(INTEGER) โ The number of entries inWORK. This must be at least6*N. Not modified.RESULTโDOUBLE PRECISIONarray, dimension(70). The values computed by the70tests described above. Modified.INFO(INTEGER) โ If0, then everything ran OK.-1:NSIZES < 0-2: SomeNN(j) < 0-3:NTYPES < 0-5:THRESH < 0-9:LDA < 1 or LDA < NMAX, whereNMAXismax( NN(j) ).-16:LDZ < 1 or LDZ < NMAX.-21:NWORKtoo small.-23:LIWORKtoo small.
If DLATMR, SLATMS, DSYGV, DSPGV, DSBGV, SSYGVD, SSPGVD, DSBGVD, DSYGVX, DSPGVX or SSBGVX returns an error code, the absolute value of it is returned. Modified.
๐งฎ Some Local Variables and Parameters ๐งฎ
---- ----- --------- --- ----------
ZERO, ONEโ Real0and1.MAXTYPโ The number of types defined.NTESTโ The number of tests that have been run on this matrix.NTESTTโ The total number of tests for this call.NMAXโ Largest value inNN.NMATSโ The number of matrices generated so far.NERRSโ The number of tests which have exceededTHRESHso far (computed byDLAFTS).COND, IMODEโ Values to be passed to the matrix generators.ANORMโ Norm ofA; passed to matrix generators.OVFL, UNFLโ Overflow and underflow thresholds.ULP, ULPINVโ Finest relative precision and its inverse.RTOVFL, RTUNFLโ Square roots of the previous 2 values.
The following four arrays decode JTYPE (yes, it says four โ I'm just the messenger ๐ซถ):
KTYPE(j)โ The general type(1-10)for type .KMODE(j)โ TheMODEvalue to be passed to the matrix generator for type .KMAGN(j)โ The order of magnitude (O(1),O(overflow^(1/2) ),O(underflow^(1/2) ))
๐ Author ๐
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 352 of file ddrvsg.f.
๐ Author ๐
Generated automatically by Doxygen for LAPACK from the source code.
Catch you later, bestie! ๐ This page's footer is giving LAPACK, Version 3.12.0, and source path /home/abui...IG/ddrvsg.f(3). No date is shown in the footer โ that's not me being shady, that's just what the footer says. ๐
โจ
๐ฆ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 ยท BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 ยท BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 ยท BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 ยท BSD-3-Clause
- ๐ girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms