DDRVEV(3)
DDRVEV(3) π Library Functions Manual π
okay bestie, this is part 1 and weβre going until the page literally cuts off at H. No sign-off, no goodbye β just full manual-page energy. π
πΈ NAME πΈ
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/EIG/ddrvev.f
Thatβs the file behind this whole DDRVEV(3) moment. Iconic path, honestly. π
β¨ SYNOPSIS β¨
π Functions/Subroutines π
subroutine DDRVEV (nsizes, nn, ntypes, dotype, iseed, thresh, nounit, a, lda, h, wr, wi, wr1, wi1, vl, ldvl, vr, ldvr, lre, ldlre, result, work, nwork, iwork, info)βDDRVEV
subroutine DDRVEV (nsizes, nn, ntypes, dotype, iseed, thresh, nounit, a,
lda, h, wr, wi, wr1, wi1, vl, ldvl, vr, ldvr, lre, ldlre, result,
work, nwork, iwork, info)
DDRVEV
π¦ Function/Subroutine Documentation π¦
π subroutine DDRVEV π
subroutine DDRVEV (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( lda, * ) h, double
precision, dimension( * ) wr, double precision, dimension( * ) wi,
double precision, dimension( * ) wr1, double precision, dimension( * )
wi1, double precision, dimension( ldvl, * ) vl, integer ldvl, double
precision, dimension( ldvr, * ) vr, integer ldvr, double precision,
dimension( ldlre, * ) lre, integer ldlre, double precision, dimension( 7
) result, double precision, dimension( * ) work, integer nwork, integer,
dimension( * ) iwork, integer info)
DDRVEV
π― Purpose π―
quick vibe check: a few words are literally blank in the original text, so Iβm marking those spots [blank] instead of guessing. no cap, we keep the facts exactly as they are. π
DDRVEV checks the nonsymmetric eigenvalue problem driver DGEEV.
When DDRVEV is called, a number of matrix [blank] () and a number of matrix [blank] are specified. For each size [blank] () and each type of matrix, one matrix will be generated and used to test the nonsymmetric eigenroutines. For each matrix, 7 tests will be performed:
| A * VR - VR * W | / ( n |A| ulp )
Here VR is the matrix of unit right eigenvectors. W is a block diagonal matrix, with a 1x1 block for each real eigenvalue and a 2x2 block for each complex conjugate pair. If eigenvalues j and j+1 are a complex conjugate pair, so WR(j) = WR(j+1) = wr and WI(j) = - WI(j+1) = wi, then the 2 x 2 block corresponding to the pair will be:
( wr wi )
( -wi wr )
Such a block multiplying an n x 2 matrix ( ur ui ) on the right will be the same as multiplying ur + i*ui by wr + i*wi.
| A**H * VL - VL * W**H | / ( n |A| ulp )
Here VL is the matrix of unit left eigenvectors, A**H is the conjugate transpose of A, and W is as above.
| |VR(i)| - 1 | / ulp and whether largest component real
VR(i) denotes the i-th column of VR.
| |VL(i)| - 1 | / ulp and whether largest component real
VL(i) denotes the i-th column of VL.
W(full) = W(partial)
W(full) denotes the eigenvalues computed when both VR and VL are also computed, and W(partial) denotes the eigenvalues computed when only W, only W and VR, or only W and VL are computed.
VR(full) = VR(partial)
VR(full) denotes the right eigenvectors computed when both VR and VL are computed, and VR(partial) denotes the result when only VR is computed.
VL(full) = VL(partial)
VL(full) denotes the left eigenvectors computed when both VR and VL are also computed, and VL(partial) denotes the result when only VL is computed.
The [blank] are specified by an array NN(1:NSIZES); the value of each element NN(j) specifies one size. The [blank] are specified by a logical array DOTYPE( 1:NTYPES ); if DOTYPE(j) is .TRUE., then matrix type [blank] will be generated.
Currently, the list of possible types is:
- (1) The zero matrix.
- (2) The identity matrix.
- (3) A (transposed) Jordan block, with
1's on the diagonal. - (4) A diagonal matrix with evenly spaced entries
1, ..., ULPand random signs.(ULP = (first number larger than 1) - 1 ) - (5) A diagonal matrix with geometrically spaced entries
1, ..., ULPand random signs. - (6) A diagonal matrix with
[blank]entries1, ULP, ..., ULPand random signs. - (7) Same as
(4), but multiplied by a constant near the overflow threshold. - (8) Same as
(4), but multiplied by a constant near the underflow threshold. - (9) A matrix of the form
U' T U, whereUis orthogonal andThas evenly spaced entries1, ..., ULPwith random signs on the diagonal and randomO(1)entries in the upper triangle. - (10) A matrix of the form
U' T U, whereUis orthogonal andThas geometrically spaced entries1, ..., ULPwith random signs on the diagonal and randomO(1)entries in the upper triangle. - (11) A matrix of the form
U' T U, whereUis orthogonal andThas[blank]entries1, ULP,..., ULPwith random signs on the diagonal and randomO(1)entries in the upper triangle. - (12) A matrix of the form
U' T U, whereUis orthogonal andThas real or complex conjugate paired eigenvalues randomly chosen from( ULP, 1 )and randomO(1)entries in the upper triangle. - (13) A matrix of the form
X' T X, whereXhas conditionSQRT( ULP )andThas evenly spaced entries1, ..., ULPwith random signs on the diagonal and randomO(1)entries in the upper triangle. - (14) A matrix of the form
X' T X, whereXhas conditionSQRT( ULP )andThas geometrically spaced entries1, ..., ULPwith random signs on the diagonal and randomO(1)entries in the upper triangle. - (15) A matrix of the form
X' T X, whereXhas conditionSQRT( ULP )andThas[blank]entries1, ULP,..., ULPwith random signs on the diagonal and randomO(1)entries in the upper triangle. - (16) A matrix of the form
X' T X, whereXhas conditionSQRT( ULP )andThas real or complex conjugate paired eigenvalues randomly chosen from( ULP, 1 )and randomO(1)entries in the upper triangle. - (17) Same as
(16), but multiplied by a constant near the overflow threshold. - (18) Same as
(16), but multiplied by a constant near the underflow threshold. - (19) Nonsymmetric matrix with random entries chosen from
(-1,1). IfNis at least4, all entries in first two rows and last row, and first column and last two columns are zero. - (20) Same as
(19), but multiplied by a constant near the overflow threshold. - (21) Same as
(19), but multiplied by a constant near the underflow threshold.
π§Έ Parameters π§Έ
NSIZESβNSIZESisINTEGER. The number of sizes of matrices to use. If it is zero,DDRVEVdoes nothing. It must be at least zero.NNβNNisINTEGER 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.NTYPESβNTYPESisINTEGER. The number of elements inDOTYPE. If it is zero,DDRVEVdoes 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..DOTYPEβDOTYPEisLOGICAL 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.ISEEDβISEEDisINTEGER 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 toDDRVEVto continue the same random number sequence.THRESHβTHRESHisDOUBLE PRECISION. A test will count as[blank]if the[blank], computed as described above, exceedsTHRESH. 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.NOUNITβNOUNITisINTEGER. TheFORTRANunit number for printing out error messages (e.g., if a routine returnsINFOnot equal to0.)AβAisDOUBLE PRECISION array, dimension (LDA, max(NN)). Used to hold the matrix whose eigenvalues are to be computed. On exit,Acontains the last matrix actually used.LDAβLDAisINTEGER. The leading dimension ofA, andH.LDAmust be at least1and at leastmax(NN).Hβ the original snippet stops right here atH, so the rest of this parameterβs description is coming in part 2. Weβre not ending the page β just continuing the lore. πHβDOUBLE PRECISIONarray, dimension(LDA, max(NN)). Itβs another copy of the test matrixA, modified byDGEEV. πWRβDOUBLE PRECISIONarray, dimension(max(NN)).WIβDOUBLE PRECISIONarray, dimension(max(NN)).
The real and imaginary parts of the eigenvalues of A. On exit, WR + WI*i are the eigenvalues of the matrix in A.
WR1βDOUBLE PRECISIONarray, dimension(max(NN)).WI1βDOUBLE PRECISIONarray, dimension(max(NN)).
Like WR, WI, these arrays contain the eigenvalues of A, but those computed when DGEEV only computes a partial eigendecomposition, i.e. not the eigenvalues and left and right eigenvectors.
VLβDOUBLE PRECISIONarray, dimension(LDVL, max(NN)).VLholds the computed left eigenvectors. π¦LDVLβINTEGER. Leading dimension ofVL. Must be at leastmax(1,max(NN)).VRβDOUBLE PRECISIONarray, dimension(LDVR, max(NN)).VRholds the computed right eigenvectors. β¨LDVRβINTEGER. Leading dimension ofVR. Must be at leastmax(1,max(NN)).LREβDOUBLE PRECISIONarray, dimension(LDLRE,max(NN)).LREholds the computed right or left eigenvectors.LDLREβINTEGER. Leading dimension ofLRE. Must be at leastmax(1,max(NN)).RESULTβDOUBLE PRECISIONarray, dimension(7). The values computed by the seven tests described above. The values are currently limited to1/ulp, to avoid overflow. π₯WORKβDOUBLE PRECISIONarray, dimension(NWORK).NWORKβINTEGER. The number of entries inWORK. This must be at least5*NN(j)+2*NN(j)**2for allj.IWORKβINTEGERarray, dimension(max(NN)).INFOβINTEGER. If0, then everything ran OK.-1:NSIZES < 0-2: SomeNN(j) < 0-3:NTYPES < 0-6:THRESH < 0-9:LDA < 1orLDA < NMAX, whereNMAXismax( NN(j) ).-16:LDVL < 1orLDVL < NMAX, whereNMAXismax( NN(j) ).-18:LDVR < 1orLDVR < NMAX, whereNMAXismax( NN(j) ).-20:LDLRE < 1orLDLRE < NMAX, whereNMAXismax( NN(j) ).-23:NWORKtoo small.- If
DLATMR,SLATMS,SLATMEorDGEEVreturns an error code, the absolute value of it is returned.
π§Έ Some Local Variables and Parameters:
ZERO,ONEβ real0and1.MAXTYPβ the number of types defined.NMAXβ largest value inNN.NERRSβ the number of tests which have exceededTHRESH.COND,CONDS,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.RTULP,RTULPIβ square roots of the previous 4 values.
The following four arrays decode JTYPE:
KTYPE(j)β the general type (1-10) for typej.KMODE(j)β theMODEvalue to be passed to the matrix generator for typej.KMAGN(j)β the order of magnitude (O(1),O(overflow^(1/2) ),O(underflow^(1/2) )).KCONDS(j)β selects whetherCONDSis to be1or1/sqrt(ulp). (0means irrelevant.)
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 402 of file ddrvev.f.
πΈ Author
Generated automatically by Doxygen for LAPACK from the source code.
π Thatβs the end of the file, bestie. Footer credit goes to source /home/abui...IG/ddrvev.f(3) and version LAPACK Version 3.12.0 β plus the date lane in the footer. Go take a sip of water, you ate. π
π¦ 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