CDRVBD(3)
π CDRVBD(3) β Library Functions Manual π
okay so bestie, this is the whole manual page energy for CDRVBD, and we are keeping every single detail β every test number, every formula, every parameter, no cap. β¨
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/EIG/cdrvbd.f
literally the source file path, bestie β thatβs the whole NAME section π
π¦ SYNOPSIS π¦
π Functions/Subroutines π
subroutine CDRVBD (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)
CDRVBD
π Function/Subroutine Documentation π
π subroutine CDRVBD π
subroutine CDRVBD (integer nsizes, integer, dimension( * ) mm, integer,
dimension( * ) nn, integer ntypes, logical, dimension( * ) dotype,
integer, dimension( 4 ) iseed, real thresh, complex, dimension( lda, * )
a, integer lda, complex, dimension( ldu, * ) u, integer ldu, complex,
dimension( ldvt, * ) vt, integer ldvt, complex, dimension( lda, * )
asav, complex, dimension( ldu, * ) usav, complex, dimension( ldvt, * )
vtsav, real, dimension( * ) s, real, dimension( * ) ssav, real,
dimension( * ) e, complex, dimension( * ) work, integer lwork, real,
dimension( * ) rwork, integer, dimension( * ) iwork, integer nounit,
integer info)
CDRVBD
πΈ Purpose πΈ
okay so what is CDRVBD actually doing? It checks the singular value decomposition (SVD) driver CGESVD, CGESDD, CGESVJ, CGEJSV, CGESVDX, and CGESVDQ. π
CGESVD and CGESDD 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 CDRVBD is called, a number of matrix (M's and N's) and a number of matrix 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 CGESVD:
- (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 CGESDD:
- (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 CGESVDQ:
- (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 CGESVJ:
- (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 CGEJSV:
- (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 CGESVDX( 'V', 'V', 'A' )/CGESVDX( '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 CGESVDX( '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 CGESVDX( '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 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 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 form
U 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βNSIZESisINTEGER. The number of sizes of matrices to use. If it is zero,CDRVBDdoes nothing. It must be at least zero.MMβMMisINTEGERarray, dimension(NSIZES). An array containing the matrix to be used. For eachj=1,...,NSIZES, ifMM(j)is zero, thenMM(j)andNN(j)will be ignored. TheMM(j)values must be at least zero.NNβNNisINTEGERarray, dimension(NSIZES). An array containing the matrix to be used. For eachj=1,...,NSIZES, ifNN(j)is zero, thenMM(j)andNN(j)will be ignored. TheNN(j)values must be at least zero.NTYPESβNTYPESisINTEGER. The number of elements inDOTYPE. If it is zero,CDRVBDdoes nothing. It must be at least zero. If it isMAXTYP+1andNSIZESis1, then an additional type,MAXTYP+1is defined, which is to use whatever matrices are inAandB. This is only useful ifDOTYPE(1:MAXTYP)is.FALSE.andDOTYPE(MAXTYP+1)is.TRUE..DOTYPEβDOTYPEisLOGICALarray, dimension(NTYPES). IfDOTYPE(j)is.TRUE., then for each size(m,n), a matrix 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βISEEDisINTEGERarray, 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 toCDRVBDto continue the same random number sequence.THRESHβTHRESHisREAL. A test will count as if the , 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.AβAisCOMPLEXarray, dimension(LDA,max(NN)). Used to hold the matrix whose singular values are to be computed. On exit,Acontains the last matrix actually used.LDAβLDAisINTEGER. The leading dimension ofA. It must be at least1and at leastmax( MM ).UβUisCOMPLEXarray, dimension(LDU,max(MM)). Used to hold the computed matrix of right singular vectors. On exit,Ucontains the last such vectors actually computed.LDUβLDUisINTEGER. The leading dimension ofU. It must be at least1and at leastmax( MM ).VTβVTisCOMPLEXarray, dimension(LDVT,max(NN)). Used to hold the computed matrix of left singular vectors. On exit,VTcontains the last such vectors actually computed.LDVTLDVTβLDVT is INTEGER. Itβs the leading dimension ofVT, bestie. It must be at least1and at leastmax( NN ). πASAVβASAV is COMPLEX array, dimension (LDA,max(NN)). 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βUSAV is COMPLEX array, dimension (LDU,max(MM)). Used to hold a different copy of the computed matrix of right singular vectors. On exit,USAVcontains the last such vectors actually computed. πVTSAVβVTSAV is COMPLEX array, dimension (LDVT,max(NN)). Used to hold a different copy of the computed matrix of left singular vectors. On exit,VTSAVcontains the last such vectors actually computed. π¦SβS is REAL array, dimension (max(min(MM,NN))). Contains the computed singular values. slay. πΈSSAVβSSAV is REAL array, dimension (max(min(MM,NN))). Contains another copy of the computed singular values. πEβE is REAL array, dimension (max(min(MM,NN))). Workspace forCGESVD. π₯WORKβWORK is COMPLEX array, dimension (LWORK). π«ΆLWORKβLWORK is 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)). no cap, itβs giving βrespect the workspace mathβ energy. πRWORKβRWORK is REAL array, dimension ( 5*max(max(MM,NN)) ). πIWORKβIWORK is INTEGER array, dimension at least 8*min(M,N). πNOUNITβNOUNIT is INTEGER. TheFORTRANunit number for printing out error messages (e.g., if a routine returnsIINFOnot equal to0.). very much βtell me what went wrongβ vibes. βINFOβINFO is INTEGER. If0, then everything ran OK. Hereβs the whole status-check lineup, bestie:-1: NSIZES < 0-2: Some MM(j) < 0-3: Some NN(j) < 0-4: NTYPES < 0-7: THRESH < 0-10: LDA < 1 or LDA < MMAX, where MMAX is max( MM(j) ).-12: LDU < 1 or LDU < MMAX.-14: LDVT < 1 or LDVT < NMAX, where NMAX is max( NN(j) ).-29: LWORK too small.
If CLATMS, or CGESVD returns 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 cdrvbd.f. π
πΈ Author πΈ
Generated automatically by Doxygen for LAPACK from the source code. π§
and thatβs the whole page, bestie π this read was brought to you by LAPACK Version 3.12.0, living at /home/abui...IG/cdrvbd.f(3) β Doxygen auto-generated it for LAPACK from the source code. byeee, go slay your linear algebra π«Άβ¨π
π¦ 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