TESTING/EIG/dchkbd.f(3)
π
TESTING/EIG/dchkbd.f β the dchkbd files (part 1)
okay so you found the man page for TESTING/EIG/dchkbd.f and honestly? she's a whole testing legend. let's get into it π¦
β¨ NAME β¨
TESTING/EIG/dchkbd.f β bestie, that's the file. that's the whole name. short, sweet, iconic π
π SYNOPSIS π
Functions/Subroutines
subroutine dchkbdβ the main character herself:
subroutine dchkbd (nsizes, mval, nval, ntypes, dotype, nrhs, iseed,
thresh, a, lda, bd, be, s1, s2, x, ldx, y, z, q, ldq, pt, ldpt, u,
vt, work, lwork, iwork, nout, info)
DCHKBD
πΈ Function/Subroutine Documentation πΈ
π subroutine dchkbd
here's the full signature, every single argument, no cap, not one of them dropped:
subroutine dchkbd (integer nsizes, integer, dimension( * ) mval, integer,
dimension( * ) nval, integer ntypes, logical, dimension( * ) dotype,
integer nrhs, integer, dimension( 4 ) iseed, double precision thresh,
double precision, dimension( lda, * ) a, integer lda, double precision,
dimension( * ) bd, double precision, dimension( * ) be, double
precision, dimension( * ) s1, double precision, dimension( * ) s2,
double precision, dimension( ldx, * ) x, integer ldx, double precision,
dimension( ldx, * ) y, double precision, dimension( ldx, * ) z, double
precision, dimension( ldq, * ) q, integer ldq, double precision,
dimension( ldpt, * ) pt, integer ldpt, double precision, dimension(
ldpt, * ) u, double precision, dimension( ldpt, * ) vt, double
precision, dimension( * ) work, integer lwork, integer, dimension( * )
iwork, integer nout, integer info)
DCHKBD
π₯ Purpose π₯
so. what does DCHKBD actually do? she checks the singular value decomposition (SVD) routines. that's the whole vibe check π
DGEBRD reduces a real general m by n matrix A to upper or lower bidiagonal form B by an orthogonal transformation: Q' * A * P = B (or A = Q * B * P'). and the tea is: B is upper bidiagonal if m >= n and lower bidiagonal if m < n. periodt.
DORGBR generates the orthogonal matrices Q and P' from DGEBRD. slight plot twist though β note that Q and P are not necessarily square π«Ά
DBDSQR computes the singular value decomposition of the bidiagonal matrix B as B = U S V'. it gets called three times to compute:
B = U S1 V', whereS1is the diagonal matrix of singular values and the columns of the matricesUandVare the left and right singular vectors, respectively, ofB.- Same as 1), but the singular values are stored in
S2and the singular vectors are not computed. A = (UQ) S (P'V'), the SVD of the original matrixA.
in addition, DBDSQR has an option to apply the left orthogonal matrix U to a matrix X, useful in least squares applications. very "i contain multitudes" of it π
DBDSDC computes the singular value decomposition of the bidiagonal matrix B as B = U S V' using divide-and-conquer. it gets called twice to compute:
B = U S1 V', whereS1is the diagonal matrix of singular values and the columns of the matricesUandVare the left and right singular vectors, respectively, ofB.- Same as 1), but the singular values are stored in
S2and the singular vectors are not computed.
DBDSVDX computes the singular value decomposition of the bidiagonal matrix B as B = U S V' using bisection and inverse iteration. it gets called six times to compute:
B = U S1 V',RANGE='A', whereS1is the diagonal matrix of singular values and the columns of the matricesUandVare the left and right singular vectors, respectively, ofB.- Same as 1), but the singular values are stored in
S2and the singular vectors are not computed. B = U S1 V',RANGE='I', with whereS1is the diagonal matrix of singular values and the columns of the matricesUandVare the left and right singular vectors, respectively, ofB- Same as 3), but the singular values are stored in
S2and the singular vectors are not computed. B = U S1 V',RANGE='V', with whereS1is the diagonal matrix of singular values and the columns of the matricesUandVare the left and right singular vectors, respectively, ofB- Same as 5), but the singular values are stored in
S2and the singular vectors are not computed.
π the setup β dimensions, bestie π
for each pair of matrix dimensions (M,N) and each selected matrix type, an M by N matrix A and an M by NRHS matrix X are generated. the problem dimensions are as follows:
A: M x N
Q: M x min(M,N) (but M x M if NRHS > 0)
P: min(M,N) x N
B: min(M,N) x min(M,N)
U, V: min(M,N) x min(M,N)
S1, S2 diagonal, order min(M,N)
X: M x NRHS
β the 14 tests β
for each generated matrix, 14 tests are performed (yes she says 14, and yes there are more below β she contains multitudes, don't come for her π).
Test DGEBRD and DORGBR
(1) | A - Q B PT | / ( |A| max(M,N) ulp ), PT = P'
(2) | I - Q' Q | / ( M ulp )
(3) | I - PT PT' | / ( N ulp )
Test DBDSQR on bidiagonal matrix B
(4) | B - U S1 VT | / ( |B| min(M,N) ulp ), VT = V'
(5) | Y - U Z | / ( |Y| max(min(M,N),k) ulp ), where Y = Q' X
and Z = U' Y.
(6) | I - U' U | / ( min(M,N) ulp )
(7) | I - VT VT' | / ( min(M,N) ulp )
(8) S1 contains min(M,N) nonnegative values in decreasing order.
(Return 0 if true, 1/ULP if false.)
(9) | S1 - S2 | / ( |S1| ulp ), where S2 is computed without
computing U and V.
(10) 0 if the true singular values of B are within THRESH of
those in S1. 2*THRESH if they are not. (Tested using
DSVDCH)
Test DBDSQR on matrix A
(11) | A - (QU) S (VT PT) | / ( |A| max(M,N) ulp )
(12) | X - (QU) Z | / ( |X| max(M,k) ulp )
(13) | I - (QU)'(QU) | / ( M ulp )
(14) | I - (VT PT) (PT'VT') | / ( N ulp )
Test DBDSDC on bidiagonal matrix B
(15) | B - U S1 VT | / ( |B| min(M,N) ulp ), VT = V'
(16) | I - U' U | / ( min(M,N) ulp )
(17) | I - VT VT' | / ( min(M,N) ulp )
(18) S1 contains min(M,N) nonnegative values in decreasing order.
(Return 0 if true, 1/ULP if false.)
(19) | S1 - S2 | / ( |S1| ulp ), where S2 is computed without
computing U and V.
Test DBDSVDX on bidiagonal matrix B
(20) | B - U S1 VT | / ( |B| min(M,N) ulp ), VT = V'
(21) | I - U' U | / ( min(M,N) ulp )
(22) | I - VT VT' | / ( min(M,N) ulp )
(23) S1 contains min(M,N) nonnegative values in decreasing order.
(Return 0 if true, 1/ULP if false.)
(24) | S1 - S2 | / ( |S1| ulp ), where S2 is computed without
computing U and V.
(25) | S1 - U' B VT' | / ( |S| n ulp ) DBDSVDX('V', 'I')
(26) | I - U' U | / ( min(M,N) ulp )
(27) | I - VT VT' | / ( min(M,N) ulp )
(28) S1 contains min(M,N) nonnegative values in decreasing order.
(Return 0 if true, 1/ULP if false.)
(29) | S1 - S2 | / ( |S1| ulp ), where S2 is computed without
computing U and V.
(30) | S1 - U' B VT' | / ( |S1| n ulp ) DBDSVDX('V', 'V')
(31) | I - U' U | / ( min(M,N) ulp )
(32) | I - VT VT' | / ( min(M,N) ulp )
(33) S1 contains min(M,N) nonnegative values in decreasing order.
(Return 0 if true, 1/ULP if false.)
(34) | S1 - S2 | / ( |S1| ulp ), where S2 is computed without
computing U and V.
π§ the matrix types β all sixteen of them π§
the possible matrix types are:
(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 (3), but multiplied by SQRT( overflow threshold )
(7) Same as (3), but multiplied by SQRT( underflow threshold )
(8) A matrix of the form U D V, where U and V are orthogonal and
D has evenly spaced entries 1, ..., ULP with random signs
on the diagonal.
(9) A matrix of the form U D V, where U and V are orthogonal and
D has geometrically spaced entries 1, ..., ULP with random
signs on the diagonal.
(10) A matrix of the form U D V, where U and V are orthogonal 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) Rectangular 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 )
and then there's the special case, she's got her own rules π:
(16) A bidiagonal matrix with random entries chosen from a
logarithmic distribution on [ulp^2,ulp^(-2)] (I.e., each
entry is e^x, where x is chosen uniformly on
[ 2 log(ulp), -2 log(ulp) ] .) For *this* type:
(a) DGEBRD is not called to reduce it to bidiagonal form.
(b) the bidiagonal is min(M,N) x min(M,N); if M<N, the
matrix will be lower bidiagonal, otherwise upper.
(c) only tests 5--8 and 14 are performed.
π«Ά heads up: a subset of the full set of matrix types may be selected through the logical array DOTYPE. you don't have to run all of them, bestie, you get to pick.
π Parameters π
NSIZES
NSIZES is INTEGER The number of values of M and N contained in the vectors MVAL and NVAL. The matrix sizes are used in pairs (M,N).
MVAL
MVAL is INTEGER array, dimension (NM) The values of the matrix row dimension M.
NVAL
NVALβINTEGER array, dimension (NM). It's the values of the matrix column dimensionN. π«NTYPESβINTEGER. The number of elements inDOTYPE. If it's zero,DCHKBDliterally does nothing (slay, a no-op queen). It must be at least zero. If it'sMAXTYP+1andNSIZESis 1, then an extra typeMAXTYP+1gets defined β that one means "just use whatever matrices are already sitting inAandB". Ngl that's only useful whenDOTYPE(1:MAXTYP)is.FALSE.andDOTYPE(MAXTYP+1)is.TRUE.. πDOTYPEβLOGICAL array, dimension (NTYPES). IfDOTYPE(j)is.TRUE., then for each size(m,n)a matrix of typejgets generated. IfNTYPESis smaller than the max number of types defined (PARAMETER MAXTYP), then typesNTYPES+1throughMAXTYPdon't get generated at all. And ifNTYPESis larger thanMAXTYP, thenDOTYPE(MAXTYP+1)throughDOTYPE(NTYPES)get straight-up ignored. π«₯NRHSβINTEGER. The number of columns in the matricesX,Y, andZ, used in testingDBDSQR. IfNRHS = 0, then the operations on the right-hand side don't get tested.NRHSmust be at least 0.ISEEDβINTEGER array, dimension (4). On entry,ISEEDspecifies 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. AlsoISEED(4)must be odd, no cap. The values ofISEEDare changed on exit and can be used in the next call toDCHKBDto continue the same random number sequence. π²β¨THRESHβDOUBLE PRECISION. The threshold value for the test ratios. A result gets included in the output file ifRESULT >= THRESH. Want every single test ratio printed? UseTHRESH = 0. Note that the expected value of the test ratios isO(1), soTHRESHshould be a reasonably small multiple of 1, like 10 or 100.AβDOUBLE PRECISION array, dimension (LDA,NMAX)whereNMAXis the maximum value ofNinNVAL.LDAβINTEGER. The leading dimension of the arrayA.LDA >= max(1,MMAX), whereMMAXis the maximum value ofMinMVAL.BDβDOUBLE PRECISION array, dimension
(max(min(MVAL(j),NVAL(j))))
BEβDOUBLE PRECISION array, dimension
(max(min(MVAL(j),NVAL(j))))
S1βDOUBLE PRECISION array, dimension
(max(min(MVAL(j),NVAL(j))))
S2βDOUBLE PRECISION array, dimension
(max(min(MVAL(j),NVAL(j))))
XβDOUBLE PRECISION array, dimension (LDX,NRHS).LDXβINTEGER. The leading dimension of the arraysX,Y, andZ.LDX >= max(1,MMAX). π¦YβDOUBLE PRECISION array, dimension (LDX,NRHS).ZβDOUBLE PRECISION array, dimension (LDX,NRHS).QβDOUBLE PRECISION array, dimension (LDQ,MMAX).LDQβINTEGER. The leading dimension of the arrayQ.LDQ >= max(1,MMAX).PTβDOUBLE PRECISION array, dimension (LDPT,NMAX).LDPTβINTEGER. The leading dimension of the arraysPT,U, andV.LDPT >= max(1, max(min(MVAL(j),NVAL(j)))).UβDOUBLE PRECISION array, dimension
(LDPT,max(min(MVAL(j),NVAL(j))))
VTβDOUBLE PRECISION array, dimension
(LDPT,max(min(MVAL(j),NVAL(j))))
WORKβDOUBLE PRECISION array, dimension (LWORK).LWORKβINTEGER. The number of entries inWORK. This must be at least3(M+N)andM(M + max(M,N,k) + 1) + N*min(M,N)for all pairs(M,N)=(MM(j),NN(j)). πIWORKβINTEGER array, dimension at least 8*min(M,N).NOUTβINTEGER. The FORTRAN unit number for printing out error messages β like, if a routine returnsIINFOnot equal to 0, bestie, that's where it goes.INFOβINTEGER. If 0, then everything ran OK. π Otherwise:-1:NSIZES < 0-2: SomeMM(j) < 0-3: SomeNN(j) < 0-4:NTYPES < 0-6:NRHS < 0-8:THRESH < 0-11:LDA < 1orLDA < MMAX, whereMMAXismax( MM(j) )-17:LDB < 1orLDB < MMAX-21:LDQ < 1orLDQ < MMAX-23:LDPT< 1orLDPT< MNMAX-27:LWORKtoo small
And if DLATMR, SLATMS, DGEBRD, DORGBR, or DBDSQR returns an error code, the absolute value of it is what comes back. π
π§ Some Local Variables and Parameters π§
Like, the internal lore, iykyk:
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.MMAXβ Largest value inNN.NMAXβ Largest value inNN.MNMINβmin(MM(j), NN(j))(the dimension of the bidiagonal matrix).MNMAXβ The maximum value ofMNMINforj=1,...,NSIZES.NFAILβ The number of tests which have exceededTHRESH.COND,IMODEβ Values to be passed to the matrix generators.ANORMβ Norm ofA; passed to matrix generators.OVFL,UNFLβ Overflow and underflow thresholds.RTOVFL,RTUNFLβ Square roots of the previous 2 values.ULP,ULPINVβ Finest relative precision and its inverse.
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 489 of file dchkbd.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code. Not a human, just vibes and a build script. π
ok that's the whole page bestie, go forth and test those bidiagonal routines π
mwah π this was LAPACK Version 3.12.0, page TESTING/EIG/dchkbd.f(3) β catch you in the next manpage, periodt. πβ¨
π¦ 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