TESTING/EIG/sdrvsg.f(3)
π TESTING/EIG/sdrvsg.f π
Library Functions Manual β part 1, bestie. Every detail stays, the vibe just gets cuter.
NAME β¨
TESTING/EIG/sdrvsg.f β that's the page name, no cap.
SYNOPSIS π
Functions/Subroutines
subroutine sdrvsg (nsizes, nn, ntypes, dotype, iseed, thresh, nounit, a,
lda, b, ldb, d, z, ldz, ab, bb, ap, bp, work, nwork, iwork, liwork,
result, info)
SDRVSG
Function/Subroutine Documentation π¦
subroutine sdrvsg β the long signature, bestie π
subroutine sdrvsg (integer nsizes, integer, dimension( * ) nn, integer
ntypes, logical, dimension( * ) dotype, integer, dimension( 4 ) iseed,
real thresh, integer nounit, real, dimension( lda, * ) a, integer lda,
real, dimension( ldb, * ) b, integer ldb, real, dimension( * ) d, real,
dimension( ldz, * ) z, integer ldz, real, dimension( lda, * ) ab, real,
dimension( ldb, * ) bb, real, dimension( * ) ap, real, dimension( * )
bp, real, dimension( * ) work, integer nwork, integer, dimension( * )
iwork, integer liwork, real, dimension( * ) result, integer info)
SDRVSG
Purpose: πΈ
okay so SDRVSG is out here checking the real symmetric generalized eigenproblem drivers. It is not doing just one little eigendecomposition β it is running the whole squad through a vibe check:
SSYGVcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem.SSYGVDcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem using a divide and conquer algorithm.SSYGVXcomputes selected eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem.SSPGVcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem in packed storage.SSPGVDcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem in packed storage using a divide and conquer algorithm.SSPGVXcomputes selected eigenvalues and, optionally, eigenvectors of a real symmetric-definite generalized eigenproblem in packed storage.SSBGVcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite banded generalized eigenproblem.SSBGVDcomputes all eigenvalues and, optionally, eigenvectors of a real symmetric-definite banded generalized eigenproblem using a divide and conquer algorithm.SSBGVXcomputes selected eigenvalues and, optionally, eigenvectors of a real symmetric-definite banded generalized eigenproblem.
When SDRVSG is called, a number of matrix <italic>[blank in the source]</italic> () and a number of matrix <italic>[blank in the source]</italic> are specified. For each size <italic>[blank in the source]</italic> () 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.
For each pair (A,B), the following tests are performed:
- (1)
SSYGVwithITYPE = 1andUPLO ='U':| A Z - B Z D | / ( |A| |Z| n ulp ) - (2) as (1) but calling
SSPGV - (3) as (1) but calling
SSBGV - (4) as (1) but with
UPLO = 'L' - (5) as (4) but calling
SSPGV - (6) as (4) but calling
SSBGV - (7)
SSYGVwithITYPE = 2andUPLO ='U':| A B Z - Z D | / ( |A| |Z| n ulp ) - (8) as (7) but calling
SSPGV - (9) as (7) but with
UPLO = 'L' - (10) as (9) but calling
SSPGV - (11)
SSYGVwithITYPE = 3andUPLO ='U':| B A Z - Z D | / ( |A| |Z| n ulp ) - (12) as (11) but calling
SSPGV - (13) as (11) but with
UPLO = 'L' - (14) as (13) but calling
SSPGV
SSYGVD, SSPGVD and SSBGVD performed the same 14 tests.
SSYGVX, SSPGVX and SSBGVX performed the above 14 tests with the parameter RANGE = 'A', 'N' and 'I', respectively.
The <italic>[blank in the source]</italic> are specified by an array NN(1:NSIZES); the value of each element NN(j) specifies one size. The <italic>[blank in the source]</italic> are specified by a logical array DOTYPE( 1:NTYPES ); if DOTYPE(j) is .TRUE., then matrix type <italic>[blank in the source]</italic> 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). Currently, the list of possible types for A is:
- (1) The zero matrix.
- (2) The identity matrix.
- (3) A diagonal matrix with evenly spaced entries
1, ..., ULPand random signs. (ULP = (first number larger than 1) - 1 ) - (4) A diagonal matrix with geometrically spaced entries
1, ..., ULPand random signs. - (5) A diagonal matrix with
<italic>[blank in the source]</italic>entries1, ULP, ..., ULPand 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, whereUis orthogonal andDhas evenly spaced entries1, ..., ULPwith random signs on the diagonal. - (9) A matrix of the form
U* D U, whereUis orthogonal andDhas geometrically spaced entries1, ..., ULPwith random signs on the diagonal. - (10) A matrix of the form
U* D U, whereUis orthogonal andDhas<italic>[blank in the source]</italic>entries1, ULP,..., ULPwith 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 = 1andKB = 1 - (17) Same as (8), but with
KA = 2andKB = 1 - (18) Same as (8), but with
KA = 2andKB = 2 - (19) Same as (8), but with
KA = 3andKB = 1 - (20) Same as (8), but with
KA = 3andKB = 2 - (21) Same as (8), but with
KA = 3andKB = 3 NSIZES(INTEGER) β the number of matrix sizes weβre testing. If itβs zero,SDRVSGliterally does nothing. It must be at least zero. Not modified, bestie.NN(INTEGER array, dimension (NSIZES)) β the actual sizes to use for the matrices. Zero values get skipped. Every value must be at least zero. Not modified.NTYPES(INTEGER) β how many elements are inDOTYPE. If itβs zero,SDRVSGdoes nothing. It must be at least zero. If it isMAXTYP+1andNSIZESis 1, then an extra type,MAXTYP+1, is defined, which means βuse whatever matrix is already 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 typejgets generated. IfNTYPESis smaller than the maximum number of types defined (PARAMETER MAXTYP), then typesNTYPES+1throughMAXTYPwill not be generated. IfNTYPESis larger thanMAXTYP, thenDOTYPE(MAXTYP+1)throughDOTYPE(NTYPES)get ignored. Not modified.ISEED(INTEGER array, dimension (4)) β on entry, this is the seed for the random number generator. The array elements should be between 0 and 4095; if they arenβt, they get reduced mod 4096. Also,ISEED(4)must be odd. The random number generator uses a linear congruential sequence limited to small integers, so it should produce machine independent random numbers. The values ofISEEDare changed on exit, and you can use them in the next call toSDRVSGto continue the same random number sequence. Modified.THRESH(REAL) β a test will count as [the thing] if the [value], computed as described above, exceedsTHRESH. Note that the error is scaled to beO(1), soTHRESHshould be a reasonably small multiple of 1, 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) β the FORTRAN unit number for printing out error messages (e.g., if a routine returnsIINFOnot equal to 0). Not modified.A(REAL array, 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 least 1 and at leastmax( NN ). Not modified.B(REAL array, 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 least 1 and at leastmax( NN ). Not modified.D(REAL array, dimension (max(NN))) β the eigenvalues ofA. On exit, the eigenvalues inDcorrespond with the matrix inA. Modified.Z(REAL array, dimension (LDZ, max(NN))) β the matrix of eigenvectors. Modified.LDZ(INTEGER) β the leading dimension ofZ. It must be at least 1 and at leastmax( NN ). Not modified.AB(REAL array, dimension (LDA, max(NN))) β workspace. Modified.BB(REAL array, dimension (LDB, max(NN))) β workspace. Modified.AP(REAL array, dimension (max(NN)**2)) β workspace. Modified.BP(REAL array, dimension (max(NN)**2)) β workspace. Modified.WORK(REAL array, 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(REAL array, dimension (70)) β the values computed by the 70 tests 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 < 1orLDA < NMAX, whereNMAXismax( NN(j) ).-16:LDZ < 1orLDZ < NMAX.-21:NWORKtoo small.-23:LIWORKtoo small.
If SLATMR, SLATMS, SSYGV, SSPGV, SSBGV, SSYGVD, SSPGVD, SSBGVD, SSYGVX, SSPGVX or SSBGVX returns an error code, the absolute value of it is returned. Modified.
π§ Some Local Variables and Parameters
ZERO,ONEβ Real 0 and 1.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 bySLAFTS).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:
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 sdrvsg.f.
π Author
Generated automatically by Doxygen for LAPACK from the source code.
Okay thatβs the whole vibe π β source/version: LAPACK Version 3.12.0; file: TESTING/EIG/sdrvsg.f(3); date: none shown in the footer. Mwah π
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms