TESTING/EIG/zdrvst.f(3)
okay bestie, welcome to TESTING/EIG/zdrvst.f(3) from the Library Functions Manual β this is the whole vibe-check page for the Hermitian eigenvalue drivers π
πΈ NAME πΈ
TESTING/EIG/zdrvst.f β yes bestie, that's literally the page name, no cap β¨
π SYNOPSIS π
π Functions/Subroutines π
subroutine zdrvst (nsizes, nn, ntypes, dotype, iseed, thresh, nounit, a,
lda, d1, d2, d3, wa1, wa2, wa3, u, ldu, v, tau, z, work, lwork,
rwork, lrwork, iwork, liwork, result, info)
ZDRVST
π¦ Function/Subroutine Documentation π¦
subroutine zdrvst (integer nsizes, integer, dimension( * ) nn, integer
ntypes, logical, dimension( * ) dotype, integer, dimension( 4 ) iseed,
double precision thresh, integer nounit, complex*16, dimension( lda, * )
a, integer lda, double precision, dimension( * ) d1, double precision,
dimension( * ) d2, double precision, dimension( * ) d3, double
precision, dimension( * ) wa1, double precision, dimension( * ) wa2,
double precision, dimension( * ) wa3, complex*16, dimension( ldu, * ) u,
integer ldu, complex*16, dimension( ldu, * ) v, complex*16, dimension( *
) tau, complex*16, dimension( ldu, * ) z, complex*16, dimension( * )
work, integer lwork, double precision, dimension( * ) rwork, integer
lrwork, integer, dimension( * ) iwork, integer liwork, double precision,
dimension( * ) result, integer info)
ZDRVST
ZDRVST β main character routine, periodt π
π₯ Purpose π₯
okay so ZDRVST checks the Hermitian eigenvalue problem drivers. It's giving official tester energy, fr fr. The driver girlies it checks are:
ZHEEVDβ computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix, using a divide-and-conquer algorithm.ZHEEVXβ computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix.ZHEEVRβ computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix using the Relatively Robust Representation where it can.ZHPEVDβ computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage, using a divide-and-conquer algorithm.ZHPEVXβ computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage.ZHBEVDβ computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix, using a divide-and-conquer algorithm.ZHBEVXβ computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix.ZHEEVβ computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix.ZHPEVβ computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage.ZHBEVβ computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix.
When ZDRVST is called, a number of matrix sizes and a number of matrix types are specified. For each size and each type of matrix, one matrix will be generated and used to test the appropriate drivers. For each matrix and each driver routine called, the following tests will be performed:
(1) | A - Z D Z' | / ( |A| n ulp )
(2) | I - Z Z' | / ( n ulp )
(3) | D1 - D2 | / ( |D1| ulp )
where Z is the matrix of eigenvectors returned when the eigenvector option is given and D1 and D2 are the eigenvalues returned with and without the eigenvector option.
The sizes are specified by an array NN(1:NSIZES); the value of each element NN(j) specifies one size.
The types are specified by a logical array DOTYPE( 1:NTYPES ); if DOTYPE(j) is .TRUE., then matrix type j will be generated.
Currently, the list of possible types is:
(1)The zero matrix.(2)The identity matrix.(3)A diagonal matrix with evenly spaced entries1, ..., ULPand random signs. (ULP = (first number larger than 1) - 1)(4)A diagonal matrix with geometrically spaced entries1, ..., ULPand random signs.(5)A diagonal matrix with entries1, ULP, ..., ULPand random signs.(6)Same as (4), but multiplied bySQRT( overflow threshold )(7)Same as (4), but multiplied bySQRT( underflow threshold )(8)A matrix of the formU* D U, whereUis unitary andDhas evenly spaced entries1, ..., ULPwith random signs on the diagonal.(9)A matrix of the formU* D U, whereUis unitary andDhas geometrically spaced entries1, ..., ULPwith random signs on the diagonal.(10)A matrix of the formU* D U, whereUis unitary andDhas entries1, ULP,..., ULPwith random signs on the diagonal.(11)Same as (8), but multiplied bySQRT( overflow threshold )(12)Same as (8), but multiplied bySQRT( underflow threshold )(13)Symmetric matrix with random entries chosen from(-1,1).(14)Same as (13), but multiplied bySQRT( overflow threshold )(15)Same as (13), but multiplied bySQRT( underflow threshold )(16)A band matrix with half bandwidth randomly chosen between0andN-1, with evenly spaced eigenvalues1, ..., ULPwith random signs.(17)Same as (16), but multiplied bySQRT( overflow threshold )(18)Same as (16), but multiplied bySQRT( underflow threshold )NSIZES(INTEGER) β the number of sizes of matrices to use. If it's zero,ZDRVSTdoes nothing. It must be at least zero. Not modified.NN(INTEGER array, dimension (NSIZES)) β an array holding the sizes used for the matrices. Zero values get skipped. The values must be at least zero. Not modified.NTYPES(INTEGER) β the number of elements inDOTYPE. If it's zero,ZDRVSTdoes nothing. It must be at least zero. If it isMAXTYP+1andNSIZESis1, then an extra type,MAXTYP+1, is defined, and that one uses 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 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 entry,ISEEDspecifies the seed of the random number generator. The array elements should be between0and4095; if not they will be reducedmod 4096. 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 toZDRVSTto continue the same random number sequence. Modified.THRESH(DOUBLE PRECISION) β here's the tea: a test will count as if the , computed as described above, exceedsTHRESH. (Yes, the original has those blanks β I'm not 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(COMPLEX*16 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 ofA. It must be at least1and at leastmax( NN ). Not modified.D1(DOUBLE PRECISION array, dimension (max(NN))) β the eigenvalues ofA, as computed byZSTEQRsimultaneously withZ. On exit, the eigenvalues inD1correspond with the matrix inA. Modified.D2(DOUBLE PRECISION array, dimension (max(NN))) β the eigenvalues ofA, as computed byZSTEQRifZis not computed. On exit, the eigenvalues inD2correspond with the matrix inA. Modified.D3(DOUBLE PRECISION array, dimension (max(NN))) β the eigenvalues ofA, as computed byDSTERF. On exit, the eigenvalues inD3correspond with the matrix inA. Modified.WA1βDOUBLE PRECISION array, dimension(and yes, the dimension is literally blank in the original, bestie π).WA2βDOUBLE PRECISION array, dimension(same blank-dimension situation, no cap).WA3βDOUBLE PRECISION array, dimension(still blank, still iconic).U(COMPLEX*16 array, dimension (LDU, max(NN))) β the unitary matrix computed byZHETRD + ZUNGC3. Modified.LDU(INTEGER) β the leading dimension ofU,Z, andV. It must be at least1and at leastmax( NN ). Not modified.V(COMPLEX*16 array, dimension (LDU, max(NN))) β theHousholdervectors computed byZHETRDin reducingAto tridiagonal form. Modified.TAU(COMPLEX*16 array, dimension (max(NN))) β the Householder factors computed byZHETRDin reducingAto tridiagonal form. Modified.Z(COMPLEX*16 array, dimension (LDU, max(NN))) β the unitary matrix of eigenvectors computed byZHEEVD,ZHEEVX,ZHPEVD,CHPEVX,ZHBEVD, andCHBEVX. Modified.WORKβCOMPLEX*16 array of dimension ( LWORK ). Workspace. Modified.LWORK(INTEGER) β the number of entries inWORK. This must be at least2*max( NN(j), 2 )**2. Not modified.RWORK(DOUBLE PRECISION array, dimension (3*max(NN))) β workspace. Modified.LRWORK(INTEGER) β the number of entries inRWORK.IWORK(INTEGER array, dimension (6*max(NN))) β workspace. Modified.LIWORK(INTEGER) β the number of entries inIWORK.RESULT(DOUBLE PRECISION array, dimension (??)) β the values computed by the tests described above. The values are currently limited to1/ulp, to avoid overflow. 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:LDU < 1orLDU < NMAX.-21:LWORKtoo small. IfDLATMR,SLATMS,ZHETRD,DORGC3,ZSTEQR,DSTERF, orDORMC2returns 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 performed, or which can be performed so far, for the current matrix.NTESTTβ the total number of tests performed so far.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: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 334 of file zdrvst.f.
π§ Author
Generated automatically by Doxygen for LAPACK from the source code.
Okay bestie, that's the whole page: source TESTING/EIG/zdrvst.f(3), LAPACK Version 3.12.0, and the footer didn't print a date (not me forgetting, it's just literally not there π
). Stay slay, and may your tests never exceed THRESH πβ¨
π¦ 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