TESTING/EIG/zdrvbd.f(3)
okay so bestie, this is the TESTING/EIG/zdrvbd.f(3) page from the Library Functions Manual π
β¨ β buckle up, we're doing Fortran SVD driver checks.
π NAME
TESTING/EIG/zdrvbd.f
π§Ύ SYNOPSIS
Functions/Subroutines
subroutine zdrvbd (nsizes, mm, nn, ntypes, dotype, iseed, thresh, a,
lda, u, ldu, vt, ldvt, asav, usav, vtsav, s, ssav, e, work, lwork,
rwork, iwork, nounit, info)
ZDRVBD
π οΈ Function/Subroutine Documentation
subroutine zdrvbd (integer nsizes, integer, dimension( * ) mm, integer,
dimension( * ) nn, integer ntypes, logical, dimension( * ) dotype,
integer, dimension( 4 ) iseed, double precision thresh, complex*16,
dimension( lda, * ) a, integer lda, complex*16, dimension( ldu, * ) u,
integer ldu, complex*16, dimension( ldvt, * ) vt, integer ldvt,
complex*16, dimension( lda, * ) asav, complex*16, dimension( ldu, * )
usav, complex*16, dimension( ldvt, * ) vtsav, double precision,
dimension( * ) s, double precision, dimension( * ) ssav, double
precision, dimension( * ) e, complex*16, dimension( * ) work, integer
lwork, double precision, dimension( * ) rwork, integer, dimension( * )
iwork, integer nounit, integer info)
ZDRVBD
β¨ Purpose β¨
okay so ZDRVBD is literally the vibe-checker for the singular value decomposition (SVD) drivers ZGESVD, ZGESDD, ZGESVJ, ZGEJSV, ZGESVDX, and ZGESVDQ. π
ZGESVD and ZGESDD factor A = U diag(S) VT, where U and VT are unitary and diag(S) is diagonal with the entries of the array S on its diagonal. The entries of S are the singular values, nonnegative and stored in decreasing order. U and VT can be optionally not computed, overwritten on A, or computed partially.
A is M by N. Let MNMIN = min( M, N ). S has dimension MNMIN. U can be M by M or M by MNMIN. VT can be N by N or MNMIN by N.
When ZDRVBD is called, a number of matrix sizes (M's and N's) and a number of matrix types are specified. For each size (M,N) and each type of matrix, and for the minimal workspace as well as workspace adequate to permit blocking, an M x N matrix will be generated and used to test the SVD routines. For each matrix, A will be factored as A = U diag(S) VT and the following 12 tests computed:
π Test for ZGESVD
(1)| A - U diag(S) VT | / ( |A| max(M,N) ulp )(2)| I - U'U | / ( M ulp )(3)| I - VT VT' | / ( N ulp )(4)ScontainsMNMINnonnegative values in decreasing order. (Return0if true,1/ULPif false.)(5)| U - Upartial | / ( M ulp )whereUpartialis a partially computedU.(6)| VT - VTpartial | / ( N ulp )whereVTpartialis a partially computedVT.(7)| S - Spartial | / ( MNMIN ulp |S| )whereSpartialis the vector of singular values from the partial SVD.
π Test for ZGESDD
(8)| A - U diag(S) VT | / ( |A| max(M,N) ulp )(9)| I - U'U | / ( M ulp )(10)| I - VT VT' | / ( N ulp )(11)ScontainsMNMINnonnegative values in decreasing order. (Return0if true,1/ULPif false.)(12)| U - Upartial | / ( M ulp )whereUpartialis a partially computedU.(13)| VT - VTpartial | / ( N ulp )whereVTpartialis a partially computedVT.(14)| S - Spartial | / ( MNMIN ulp |S| )whereSpartialis the vector of singular values from the partial SVD.
π Test for ZGESVDQ
(36)| A - U diag(S) VT | / ( |A| max(M,N) ulp )(37)| I - U'U | / ( M ulp )(38)| I - VT VT' | / ( N ulp )(39)ScontainsMNMINnonnegative values in decreasing order. (Return0if true,1/ULPif false.)
π Test for ZGESVJ
(15)| A - U diag(S) VT | / ( |A| max(M,N) ulp )(16)| I - U'U | / ( M ulp )(17)| I - VT VT' | / ( N ulp )(18)ScontainsMNMINnonnegative values in decreasing order. (Return0if true,1/ULPif false.)
π Test for ZGEJSV
(19)| A - U diag(S) VT | / ( |A| max(M,N) ulp )(20)| I - U'U | / ( M ulp )(21)| I - VT VT' | / ( N ulp )(22)ScontainsMNMINnonnegative values in decreasing order. (Return0if true,1/ULPif false.)
π Test for ZGESVDX( 'V', 'V', 'A' )/ZGESVDX( 'N', 'N', 'A' )
(23)| A - U diag(S) VT | / ( |A| max(M,N) ulp )(24)| I - U'U | / ( M ulp )(25)| I - VT VT' | / ( N ulp )(26)ScontainsMNMINnonnegative values in decreasing order. (Return0if true,1/ULPif false.)(27)| U - Upartial | / ( M ulp )whereUpartialis a partially computedU.(28)| VT - VTpartial | / ( N ulp )whereVTpartialis a partially computedVT.(29)| S - Spartial | / ( MNMIN ulp |S| )whereSpartialis the vector of singular values from the partial SVD.
π Test for ZGESVDX( 'V', 'V', 'I' )
(30)| U' A VT''' - diag(S) | / ( |A| max(M,N) ulp )(31)| I - U'U | / ( M ulp )(32)| I - VT VT' | / ( N ulp )
π Test for ZGESVDX( 'V', 'V', 'V' )
(33)| U' A VT''' - diag(S) | / ( |A| max(M,N) ulp )(34)| I - U'U | / ( M ulp )(35)| I - VT VT' | / ( N ulp )
The sizes are specified by the arrays MM(1:NSIZES) and NN(1:NSIZES); the value of each element pair (MM(j),NN(j)) specifies one size. The types 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 matrix of the formU D V, whereUandVare unitary andDhas evenly spaced entries1, ..., ULPwith random signs on the diagonal.(4)Same as(3), but multiplied by the underflow-threshold /ULP.(5)Same as(3), but multiplied by the overflow-threshold *ULP.
π«Ά Parameters π«Ά
π
NSIZES
NSIZES is INTEGER. The number of sizes of matrices to use. If it is zero, ZDRVBD does nothing. It must be at least zero.
π
MM
MM is INTEGER array, dimension (NSIZES). An array containing the matrix size to be used. For each j=1,...,NSIZES, if MM(j) is zero, then MM(j) and NN(j) will be ignored. The MM(j) values must be at least zero.
π
NN
NN is INTEGER array, dimension (NSIZES). An array containing the matrix size to be used. For each j=1,...,NSIZES, if NN(j) is zero, then MM(j) and NN(j) will be ignored. The NN(j) values must be at least zero.
π
NTYPES
NTYPES is INTEGER. The number of elements in DOTYPE. If it is zero, ZDRVBD 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 matrices are in A and B. This is only useful if DOTYPE(1:MAXTYP) is .FALSE. and DOTYPE(MAXTYP+1) is .TRUE. .
π
DOTYPE
DOTYPE is LOGICAL array, dimension (NTYPES). If DOTYPE(j) is .TRUE., then for each size (m,n), a matrix of type j will be generated. If NTYPES is smaller than the maximum number of types defined (PARAMETER MAXTYP), then types NTYPES+1 through MAXTYP will not be generated. If NTYPES is larger than MAXTYP, DOTYPE(MAXTYP+1) through DOTYPE(NTYPES) will be ignored.
π
ISEED
ISEED is 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 not they will be reduced mod 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 of ISEED are changed on exit, and can be used in the next call to ZDRVBD to continue the same random number sequence.
π
THRESH
THRESH is DOUBLE PRECISION. A test will count as failed if the error, computed as described above, exceeds THRESH. Note that 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. It must be at least zero.
π
A
A is COMPLEX*16 array, dimension (LDA,max(NN)). Used to hold the matrix whose singular values are to be computed. On exit, A contains the last matrix actually used.
π
LDA
LDA is INTEGER. The leading dimension of A. It must be at least 1 and at least max( MM ).
π
U
U is COMPLEX*16 array, dimension (LDU,max(MM)). Used to hold the computed matrix of right singular vectors. On exit, U contains the last such vectors actually computed.
π
LDU
LDU is INTEGER. The leading dimension of U. It must be at least 1 and at least max( MM ).
π
VT
VT is COMPLEX*16 array, dimension (LDVT,max(NN)). Used to hold the computed matrix of left singular vectors. On exit, VT contains the last such vectors actually computed.
π
LDVT
LDVTβINTEGER. Itβs the leading dimension ofVT. It must be at least1and at leastmax( NN )π.ASAVβCOMPLEX*16array, dimension(LDA,max(NN)). Itβs used to hold a different copy of the matrix whose singular values are to be computed. On exit,Acontains the last matrix actually used β¨.USAVβCOMPLEX*16array, dimension(LDU,max(MM)). Itβs used to hold a different copy of the computed matrix of right singular vectors. On exit,USAVcontains the last such vectors actually computed π«Ά.VTSAVβCOMPLEX*16array, dimension(LDVT,max(NN)). Itβs used to hold a different copy of the computed matrix of left singular vectors. On exit,VTSAVcontains the last such vectors actually computed π¦.SβDOUBLE PRECISIONarray, dimension(max(min(MM,NN))). Contains the computed singular values β.SSAVβDOUBLE PRECISIONarray, dimension(max(min(MM,NN))). Contains another copy of the computed singular values π«.EβDOUBLE PRECISIONarray, dimension(max(min(MM,NN))). Workspace forZGESVDπ οΈ.WORKβCOMPLEX*16array, dimension(LWORK)π.LWORKβINTEGER. The number of entries inWORK. This must be at leastMAX(3*MIN(M,N)+MAX(M,N)**2,5*MIN(M,N),3*MAX(M,N))for all pairs(M,N)=(MM(j),NN(j))π.RWORKβDOUBLE PRECISIONarray, dimension( 5*max(max(MM,NN)) )πΈ.IWORKβINTEGERarray, dimension at least8*min(M,N)π.NOUNITβINTEGER. TheFORTRANunit number for printing out error messages (e.g., if a routine returnsIINFOnot equal to0.) π.INFOβINTEGER. If0, then everything ran OK π.-1:NSIZES < 0-2: SomeMM(j) < 0-3: SomeNN(j) < 0-4:NTYPES < 0-7:THRESH < 0-10:LDA < 1orLDA < MMAX, whereMMAXismax( MM(j) ).-12:LDU < 1orLDU < MMAX.-14:LDVT < 1orLDVT < NMAX, whereNMAXismax( NN(j) ).-21:LWORKtoo small.- If
ZLATMS, orZGESVDreturns an error code, the absolute value of it is returned π.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 397 of file zdrvbd.f. π
Author β¨ (Doxygenβs cameo)
Generated automatically by Doxygen for LAPACK from the source code π§.
Thatβs the whole page, bestie! Footer tea: source/version is LAPACK Version 3.12.0, page is TESTING/EIG/zdrvbd.f(3) β and thereβs no date in this footer, so Iβm not inventing one π
β¨
π¦ 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