ZCHKST(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

🌸 zchkst.f(3) β€” Library Functions Manual 🌸

okay bestie, this page is literally zchkst.f(3) from the Library Functions Manual, and it's giving major LAPACK testing energy. no cap, we're looking at the whole ZCHKST situation β€” keep up, iykyk πŸ’…

🌸 NAME 🌸

This whole page is about this exact file path, periodt:

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/EIG/zchkst.f

✨ SYNOPSIS ✨

πŸ’– Functions/Subroutines πŸ’–

Here's the subroutine lineup, bestie β€” literally one icon:

subroutine ZCHKST (nsizes, nn, ntypes, dotype, iseed, thresh, nounit, a,
     lda, ap, sd, se, d1, d2, d3, d4, d5, wa1, wa2, wa3, wr, u, ldu, v,
     vp, tau, z, work, lwork, rwork, lrwork, iwork, liwork, result, info)
     ZCHKST

πŸ’… FUNCTION/SUBROUTINE DOCUMENTATION πŸ’…

okay so this is the full signature, and it's lowkey a lot β€” but we do not skip a single argument in this house 🫢:

subroutine ZCHKST (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, complex*16, dimension( * ) ap, double precision,
     dimension( * ) sd, double precision, dimension( * ) se, double
     precision, dimension( * ) d1, double precision, dimension( * ) d2,
     double precision, dimension( * ) d3, double precision, dimension( * )
     d4, double precision, dimension( * ) d5, double precision, dimension( *
     ) wa1, double precision, dimension( * ) wa2, double precision,
     dimension( * ) wa3, double precision, dimension( * ) wr, complex*16,
     dimension( ldu, * ) u, integer ldu, complex*16, dimension( ldu, * ) v,
     complex*16, dimension( * ) vp, 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)
     ZCHKST

and yes, it says ZCHKST again at the end β€” main character energy, honestly πŸ‘‘

πŸŽ€ Purpose πŸŽ€

Okay so picture the whole Hermitian eigenvalue pipeline as a group chat, and ZCHKST is the friend who screenshots everything and checks it against the receipts. Here's who she's checking on πŸ‘‘

ZHETRD factors A as U S U*, where * means conjugate transpose, S is real symmetric tridiagonal, and U is unitary. ZHETRD can use either just the lower or just the upper triangle of A β€” ZCHKST checks both cases, no skipping πŸ™…β€β™€οΈ. U is represented as a product of Householder transformations, whose vectors are stored in the first n-1 columns of V, and whose scale factors are in TAU.

ZHPTRD does the same as ZHETRD, except that A and V are stored in format. (yep, the source really does leave that word blank, iykyk 🫢)

ZUNGTR constructs the matrix U from the contents of V and TAU.

ZUPGTR constructs the matrix U from the contents of VP and TAU.

ZSTEQR factors S as Z D1 Z*, where Z is the unitary matrix of eigenvectors and D1 is a diagonal matrix with the eigenvalues on the diagonal. D2 is the matrix of eigenvalues computed when Z is not computed.

DSTERF computes D3, the matrix of eigenvalues, by the PWK method, which does not yield eigenvectors.

ZPTEQR factors S as Z4 D4 Z4*, for a Hermitian positive definite tridiagonal matrix. D5 is the matrix of eigenvalues computed when Z is not computed.

DSTEBZ computes selected eigenvalues. WA1, WA2, and WA3 will denote eigenvalues computed to high absolute accuracy, with different range options. WR will denote eigenvalues computed to high relative accuracy.

ZSTEIN computes Y, the eigenvectors of S, given the eigenvalues.

ZSTEDC factors S as Z D1 Z*, where Z is the unitary matrix of eigenvectors and D1 is a diagonal matrix with the eigenvalues on the diagonal (the 'I' option). It may also update an input unitary matrix, usually the output from ZHETRD/ZUNGTR or ZHPTRD/ZUPGTR (the 'V' option). It may also just compute eigenvalues (the 'N' option).

ZSTEMR factors S as Z D1 Z*, where Z is the unitary matrix of eigenvectors and D1 is a diagonal matrix with the eigenvalues on the diagonal (the 'I' option). ZSTEMR uses the Relatively Robust Representation whenever possible. iconic behavior honestly ✨


When ZCHKST 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 Hermitian eigenroutines. For each matrix, a number of tests will be performed β€” and bestie, the test roster is LONG, we love a thorough queen πŸ’…

  • (1) β€” | A - V S V* | / ( |A| n ulp ) ZHETRD( UPLO='U', ... )
  • (2) β€” | I - UV* | / ( n ulp ) ZUNGTR( UPLO='U', ... )
  • (3) β€” | A - V S V* | / ( |A| n ulp ) ZHETRD( UPLO='L', ... )
  • (4) β€” | I - UV* | / ( n ulp ) ZUNGTR( UPLO='L', ... )
  • (5-8) β€” Same as 1-4, but for ZHPTRD and ZUPGTR.
  • (9) β€” | S - Z D Z* | / ( |S| n ulp ) ZSTEQR('V',...)
  • (10) β€” | I - ZZ* | / ( n ulp ) ZSTEQR('V',...)
  • (11) β€” | D1 - D2 | / ( |D1| ulp ) ZSTEQR('N',...)
  • (12) β€” | D1 - D3 | / ( |D1| ulp ) DSTERF
  • (13) β€” 0 if the true eigenvalues (computed by sturm count) of S are within THRESH of those in D1. 2*THRESH if they are not. (Tested using DSTECH)

For S positive definite:

  • (14) β€” | S - Z4 D4 Z4* | / ( |S| n ulp ) ZPTEQR('V',...)
  • (15) β€” | I - Z4 Z4* | / ( n ulp ) ZPTEQR('V',...)
  • (16) β€” | D4 - D5 | / ( 100 |D4| ulp ) ZPTEQR('N',...)

When S is also diagonally dominant by the factor gamma < 1:

  • (17) β€” the accuracy check against WR, done with DSTEBZ( 'A', 'E', ...):
max | D4(i) - WR(i) | / ( |D4(i)| omega ) ,
 i
omega = 2 (2n-1) ULP (1 + 8 gamma**2) / (1 - gamma)**4
  • (18) β€” | WA1 - D3 | / ( |D3| ulp ) DSTEBZ( 'A', 'E', ...)
  • (19) β€” the two-way min/max match-up, done with DSTEBZ( 'I', 'E', ...):
( max { min | WA2(i)-WA3(j) | } +
   i     j
  max { min | WA3(i)-WA2(j) | } ) / ( |D3| ulp )
   i     j
  • (20) β€” | S - Y WA1 Y* | / ( |S| n ulp ) DSTEBZ, ZSTEIN
  • (21) β€” | I - Y Y* | / ( n ulp ) DSTEBZ, ZSTEIN
  • (22) β€” | S - Z D Z* | / ( |S| n ulp ) ZSTEDC('I')
  • (23) β€” | I - ZZ* | / ( n ulp ) ZSTEDC('I')
  • (24) β€” | S - Z D Z* | / ( |S| n ulp ) ZSTEDC('V')
  • (25) β€” | I - ZZ* | / ( n ulp ) ZSTEDC('V')
  • (26) β€” | D1 - D2 | / ( |D1| ulp ) ZSTEDC('V') and ZSTEDC('N')
Test 27 is disabled at the moment because ZSTEMR does not guarantee high relatvie accuracy. 😭 (that's the source's spelling, not mine, we respect the typo)
  • (27) β€” the WR accuracy check with ZSTEMR('V', 'A'):
max | D6(i) - WR(i) | / ( |D6(i)| omega ) ,
 i
omega = 2 (2n-1) ULP (1 + 8 gamma**2) / (1 - gamma)**4
  • (28) β€” the WR accuracy check with ZSTEMR('V', 'I'):
max | D6(i) - WR(i) | / ( |D6(i)| omega ) ,
 i
omega = 2 (2n-1) ULP (1 + 8 gamma**2) / (1 - gamma)**4
Tests 29 through 34 are disable at present because ZSTEMR does not handle partial spectrum requests. πŸ’€ (again: source's wording, we stan accuracy)
  • (29) β€” | S - Z D Z* | / ( |S| n ulp ) ZSTEMR('V', 'I')
  • (30) β€” | I - ZZ* | / ( n ulp ) ZSTEMR('V', 'I')
  • (31) β€” the min/max match-up, ZSTEMR('N', 'I') vs. CSTEMR('V', 'I'):
( max { min | WA2(i)-WA3(j) | } +
   i     j
  max { min | WA3(i)-WA2(j) | } ) / ( |D3| ulp )
   i     j
  • (32) β€” | S - Z D Z* | / ( |S| n ulp ) ZSTEMR('V', 'V')
  • (33) β€” | I - ZZ* | / ( n ulp ) ZSTEMR('V', 'V')
  • (34) β€” the min/max match-up, ZSTEMR('N', 'V') vs. CSTEMR('V', 'V'):
( max { min | WA2(i)-WA3(j) | } +
   i     j
  max { min | WA3(i)-WA2(j) | } ) / ( |D3| ulp )
   i     j
  • (35) β€” | S - Z D Z* | / ( |S| n ulp ) ZSTEMR('V', 'A')
  • (36) β€” | I - ZZ* | / ( n ulp ) ZSTEMR('V', 'A')
  • (37) β€” the min/max match-up, ZSTEMR('N', 'A') vs. CSTEMR('V', 'A'):
( max { min | WA2(i)-WA3(j) | } +
   i     j
  max { min | WA3(i)-WA2(j) | } ) / ( |D3| ulp )
   i     j

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 β€” buckle up, there's 21 of them πŸŽ€:

  • (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 unitary 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 unitary 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 unitary 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) β€” Hermitian 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 diagonal elements are all positive.
  • (17) β€” Same as (9), but diagonal elements are all positive.
  • (18) β€” Same as (10), but diagonal elements are all positive.
  • (19) β€” Same as (16), but multiplied by SQRT( overflow threshold )
  • (20) β€” Same as (16), but multiplied by SQRT( underflow threshold )
  • (21) β€” A diagonally dominant tridiagonal matrix with geometrically spaced diagonal entries 1, ..., ULP.

✨ Parameters ✨

  • NSIZES β€” NSIZES is INTEGER. It's the number of sizes of matrices to use. If it is zero, ZCHKST does nothing. It must be at least zero.
  • NN β€” NN is 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.
  • NTYPES β€” NTYPES is INTEGER. The number of elements in DOTYPE. If it is zero, ZCHKST does nothing. It must be at least zero. If it is MAXTYP+1 and NSIZES is 1, then an additional type, MAXTYP+1 is defined, which is to use whatever matrix is in A. This is only useful if DOTYPE(1:MAXTYP) is .FALSE. and DOTYPE(MAXTYP+1) is .TRUE. .
  • DOTYPE β€” and yes bestie, DOTYPE gets her own whole moment, the description picks right back up on the next line of the source 🫢
  • DOTYPE β€” LOGICAL array, dimension (NTYPES). Bestie, this is your ✨to-do list✨ of matrix types: if DOTYPE(j) is .TRUE., then for every size in NN a matrix of that size and of type j gets generated. If NTYPES is smaller than the maximum number of types defined (PARAMETER MAXTYP), then types NTYPES+1 through MAXTYP will not be generated πŸ’€. And if NTYPES is larger than MAXTYP, then DOTYPE(MAXTYP+1) through DOTYPE(NTYPES) just gets ignored. No cap, they simply don't matter.

  • ISEED β€” INTEGER array, dimension (4). On entry, ISEED specifies the seed of the random number generator 🌱. The array elements should be between 0 and 4095; if they're not, they get reduced mod 4096. Also β€” important, don't skip β€” 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 of ISEED are changed on exit, and you can use them in the next call to ZCHKST to continue the exact same random number sequence. Continuity icon behavior, honestly.

  • THRESH β€” DOUBLE PRECISION. The vibe check threshold 🚨. Fair warning, the source text here has a couple of blank spots in it, so here's the line as it literally reads:
A test will count as  if the , computed as described above, exceeds THRESH.

What's not missing: the error is scaled to be O(1), so THRESH should be a reasonably small multiple of 1, e.g., 10 or 100 ✨. In particular, it should not depend on the precision (single vs. double) or the size of the matrix. And it must be at least zero, periodt.


  • NOUNIT β€” INTEGER. The FORTRAN unit number for printing out error messages πŸ“  β€” like, for example, if a routine returns IINFO not equal to 0. That's where the drama gets reported.

  • A β€” COMPLEX*16 array of dimension ( LDA , max(NN) ). Used to hold the matrix whose eigenvalues are to be computed πŸ‘‘. On exit, A contains the last matrix actually used β€” so she's not a memory, she's the moment.

  • LDA β€” INTEGER. The leading dimension of A. It must be at least 1 and at least max( NN ) 🫢.

  • AP β€” COMPLEX*16 array of dimension( max(NN)*max(NN+1)/2 ). The matrix A stored in packed format. Compact queen πŸ’….

  • SD β€” DOUBLE PRECISION array of dimension( max(NN) ). The diagonal of the tridiagonal matrix computed by ZHETRD. On exit, SD and SE contain the tridiagonal form of the matrix in A ✨.

  • SE β€” DOUBLE PRECISION array of dimension( max(NN) ). The off-diagonal of the tridiagonal matrix computed by ZHETRD. On exit, SD and SE contain the tridiagonal form of the matrix in A β€” yes, same sentence energy, they're a matched set πŸ’–.

  • D1 β€” DOUBLE PRECISION array of dimension( max(NN) ). The eigenvalues of A, as computed by ZSTEQR simultaneously with Z πŸ”₯. On exit, the eigenvalues in D1 correspond with the matrix in A.

  • D2 β€” DOUBLE PRECISION array of dimension( max(NN) ). The eigenvalues of A, as computed by ZSTEQR if Z is not computed. On exit, the eigenvalues in D2 correspond with the matrix in A. Same energy, different route 🌸.

  • D3 β€” DOUBLE PRECISION array of dimension( max(NN) ). The eigenvalues of A, as computed by DSTERF. On exit, the eigenvalues in D3 correspond with the matrix in A πŸ¦‹.

  • D4 β€” DOUBLE PRECISION array of dimension( max(NN) ). The eigenvalues of A, as computed by ZPTEQR(V). ZPTEQR factors S as Z4 D4 Z4* ⭐. On exit, the eigenvalues in D4 correspond with the matrix in A.

  • D5 β€” DOUBLE PRECISION array of dimension( max(NN) ). The eigenvalues of A, as computed by ZPTEQR(N) when Z is not computed. On exit, the eigenvalues in D4 correspond with the matrix in A β€” and yes, the original really says D4 right there in the D5 entry πŸ™ˆ. We're preserving it, not fixing it, that's the rule.

  • WA1 β€” DOUBLE PRECISION array of dimension( max(NN) ). All eigenvalues of A, computed to high absolute accuracy, with different range options, as computed by DSTEBZ πŸ‘‘.

  • WA2 β€” DOUBLE PRECISION array of dimension( max(NN) ). Selected eigenvalues of A, computed to high absolute accuracy, with different range options, as computed by DSTEBZ πŸŽ€. Specifically: choose random values for IL and IU, and ask for the IL-th through IU-th eigenvalues.

  • WA3 β€” DOUBLE PRECISION array of dimension( max(NN) ). Selected eigenvalues of A, computed to high absolute accuracy, with different range options, as computed by DSTEBZ πŸ’œ. Specifically: determine the values VL and VU of the IL-th and IU-th eigenvalues and ask for all eigenvalues in this range.

  • WR β€” DOUBLE PRECISION array of dimension( max(NN) ). All eigenvalues of A, computed to high absolute accuracy, with different options, as computed by DSTEBZ 🌈.

  • U β€” COMPLEX*16 array of dimension( LDU, max(NN) ). The unitary matrix computed by ZHETRD + ZUNGTR πŸ’….

  • LDU β€” INTEGER. The leading dimension of U, Z, and V β€” all three, one number, iconic efficiency 🫢. It must be at least 1 and at least max( NN ).

  • V β€” COMPLEX*16 array of dimension( LDU, max(NN) ). The Householder vectors computed by ZHETRD in reducing A to tridiagonal form 🧚. The vectors computed with UPLO='U' are in the upper triangle, and the vectors computed with UPLO='L' are in the lower triangle. And here's the little lore drop, exactly as described in ZHETRD: the sub- and superdiagonal are not set to 1, even though the true Householder vector has a 1 in that position. The routines that use V, such as ZUNGTR, set those entries to 1 before using them, and then restore them later. Respectful, honestly 😭.

  • VP β€” COMPLEX*16 array of dimension( max(NN)*max(NN+1)/2 ). The matrix V stored in packed format πŸ“.

  • TAU β€” COMPLEX*16 array of dimension( max(NN) ). The Householder factors computed by ZHETRD in reducing A to tridiagonal form ✨.

  • Z β€” COMPLEX*16 array of dimension( LDU, max(NN) ). The unitary matrix of eigenvectors computed by ZSTEQR, ZPTEQR, and ZSTEIN πŸ”₯.

  • WORK β€” COMPLEX*16 array of dimension( LWORK ). Workspace, bestie. It works so you don't have to πŸ’€.

  • LWORK β€” INTEGER. The number of entries in WORK. This must be at least:
1 + 4 * Nmax + 2 * Nmax * lg Nmax + 3 * Nmax**2

where Nmax = max( NN(j), 2 ) and lg = log base 2 πŸ‘‘. Do the math, don't guess it.


  • IWORK β€” INTEGER array. Workspace 🌸.

  • LIWORK β€” INTEGER. The number of entries in IWORK. This must be at least:
6 + 6*Nmax + 5 * Nmax * lg Nmax

where Nmax = max( NN(j), 2 ) and lg = log base 2 ⭐.


  • RWORK β€” DOUBLE PRECISION array. That's it, that's the whole description πŸŽ€.

  • LRWORK β€” INTEGER. The number of entries in LRWORK (the original says dimension( ??? ) and honestly, same πŸ™ˆ β€” that question mark trio is verbatim, we keep it).

  • RESULT β€” DOUBLE PRECISION array, dimension (26). The values computed by the tests described above πŸ’–. These values are currently limited to 1/ulp, to avoid overflow β€” safety first, always.

  • INFO β€” πŸ’€ the source cuts off right here mid-entry, so this one's a cliffhanger.

INFO is INTEGER, bestie, and it’s literally the vibe report for the whole run:

  • If 0, then everything ran OK. πŸ’–
  • -1: NSIZES < 0
  • -2: Some NN(j) < 0
  • -3: NTYPES < 0
  • -5: THRESH < 0
  • -9: LDA < 1 or LDA < NMAX, where NMAX is max( NN(j) ).
  • -23: LDU < 1 or LDU < NMAX.
  • -29: LWORK too small.

If ZLATMR, CLATMS, ZHETRD, ZUNGTR, ZSTEQR, DSTERF, or ZUNMC2 returns an error code, the absolute value of it is returned. That’s the rule, no cap. 🫢


🧚 Some Local Variables and Parameters 🧚

  • ZERO, ONE β€” Real 0 and 1.
  • 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.
  • NBLOCK β€” Blocksize as returned by ENVIR.
  • NMAX β€” Largest value in NN.
  • NMATS β€” The number of matrices generated so far.
  • NERRS β€” The number of tests which have exceeded THRESH so far.
  • COND, IMODE β€” Values to be passed to the matrix generators.
  • ANORM β€” Norm of A; 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) β€” The MODE value 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 599 of file zchkst.f.

🫢 Author

Generated automatically by Doxygen for LAPACK from the source code.


Final footer moment, because we’re cute like that: LAPACK Version 3.12.0 plus the original footer’s date/path stamp are waving goodbye from the bottom of the page β€” consider them mentioned, not copied, because we have aesthetic boundaries. πŸ’…βœ¨πŸŽ€

πŸ“¦ where this page comes from