CDRVST2STG(3)
π CDRVST2STG(3) π
okay bestie, this is CDRVST2STG(3) from the Library Functions Manual, and she is literally the test-driver main character of this LAPACK page π«Άβ¨
πΈ NAME πΈ
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/EIG/cdrvst2stg.f
thatβs the whole name line, no cap π
β¨ SYNOPSIS β¨
π Functions/Subroutines π
subroutine CDRVST2STG (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)
CDRVST2STG
π Function/Subroutine Documentation π
π«Ά subroutine CDRVST2STG π«Ά
subroutine CDRVST2STG (integer nsizes, integer, dimension( * ) nn, integer
ntypes, logical, dimension( * ) dotype, integer, dimension( 4 ) iseed,
real thresh, integer nounit, complex, dimension( lda, * ) a, integer
lda, real, dimension( * ) d1, real, dimension( * ) d2, real, dimension(
* ) d3, real, dimension( * ) wa1, real, dimension( * ) wa2, real,
dimension( * ) wa3, complex, dimension( ldu, * ) u, integer ldu,
complex, dimension( ldu, * ) v, complex, dimension( * ) tau, complex,
dimension( ldu, * ) z, complex, dimension( * ) work, integer lwork,
real, dimension( * ) rwork, integer lrwork, integer, dimension( * )
iwork, integer liwork, real, dimension( * ) result, integer info)
CDRVST2STG
π Purpose π
okay so CDRVST2STG checks the Hermitian eigenvalue problem drivers. sheβs doing a whole vibe check on the driver squad, and the lineup is:
CHEEVDcomputes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix, using a divide-and-conquer algorithm.CHEEVXcomputes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix.CHEEVRcomputes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix using the Relatively Robust Representation where it can.CHPEVDcomputes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage, using a divide-and-conquer algorithm.CHPEVXcomputes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage.CHBEVDcomputes all eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix, using a divide-and-conquer algorithm.CHBEVXcomputes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix.CHEEVcomputes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix.CHPEVcomputes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage.CHBEVcomputes all eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix.
When CDRVST2STG is called, a number of matrix () and a number of matrix 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 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. 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,CDRVST2STGliterally does nothing (empty-test-run energy). 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,CDRVST2STGdoes nothing. It must be at least zero. If it isMAXTYP+1andNSIZESis1, then an additional type,MAXTYP+1is 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 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 toCDRVST2STGto continue the same random number sequence. Modified. π₯THRESHβREALβ a test will count as if the , computed as described above, exceedsTHRESH. (Yes, the source has blank spots there β keeping the exact tea, 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 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βREAL array, dimension (max(NN))β the eigenvalues ofA, as computed byCSTEQRsimultaneously withZ. On exit, the eigenvalues inD1correspond with the matrix inA. Modified. βD2βREAL array, dimension (max(NN))β the eigenvalues ofA, as computed byCSTEQRifZis not computed. On exit, the eigenvalues inD2correspond with the matrix inA. Modified. πD3βREAL array, dimension (max(NN))β the eigenvalues ofA, as computed bySSTERF. On exit, the eigenvalues inD3correspond with the matrix inA. Modified. π§WA1βREAL array, dimensionβ the source stops right there, no number, and I am not inventing one. π«ΆWA2βREAL array, dimensionβ same situation, bestie: no dimension value printed. πWA3βREAL array, dimensionβ again, the dimension value is literally blank in the source. πUβCOMPLEX array, dimension (LDU, max(NN))β the unitary matrix computed byCHETRD+CUNGC3. Modified. π¦LDUβINTEGERβ the leading dimension ofU,Z, andV. It must be at least1and at leastmax( NN ). Not modified. πΈVβCOMPLEX array, dimension (LDU, max(NN))β theHousholdervectors computed byCHETRDin reducingAto tridiagonal form. Modified. π₯TAUβCOMPLEX array, dimension (max(NN))β the Householder factors computed byCHETRDin reducingAto tridiagonal form. Modified. βZβCOMPLEX array, dimension (LDU, max(NN))β the unitary matrix of eigenvectors computed byCHEEVD,CHEEVX,CHPEVD,CHPEVX,CHBEVD, andCHBEVX. Modified. πWORKβCOMPLEX 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βREAL 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βREAL 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.
If SLATMR, SLATMS, CHETRD, SORGC3, CSTEQR, SSTERF, or SORMC2 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 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 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: (the source says four, but lists these three β not my typo, bestie π)
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 cdrvst2stg.f.
πͺ Author
Generated automatically by Doxygen for LAPACK from the source code.
footer tea: LAPACK Version 3.12.0, file /home/abui...drvst2stg.f(3) β the footer didnβt print a date, so weβre not inventing one, bestie. Periodt. π
β¨
π¦ 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