PCUNMQL(l)
π NAME π
Okay bestie, meet PCUNMQL π
β she lives in the LAPACK manual (that's the (l), iykyk), and her whole entire job is: overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L', SIDE = 'R', TRANS = 'N' β¨
That's it. That's the name line. She's niche but she eats. π
πΈ SYNOPSIS πΈ
SUBROUTINE PCUNMQL( SIDE, TRANS, M, N, K, A, IA, JA, DESCA, TAU, C, IC,
JC, DESCC, WORK, LWORK, INFO )
CHARACTER SIDE, TRANS
INTEGER IA, IC, INFO, JA, JC, K, LWORK, M, N
INTEGER DESCA( * ), DESCC( * )
COMPLEX A( * ), C( * ), TAU( * ), WORK( * )
Likeβ¦ eighteen arguments. She's that girl. π
π¦ PURPOSE π¦
So PCUNMQL overwrites the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with TRANS = 'C':
Q**H * sub( C )sub( C ) * Q**H
β¦where Q is a complex unitary distributed matrix defined as the product of K elementary reflectors, no cap:
Q = H(k) . . . H(2) H(1)
exactly as returned by PCGEQLF π«Ά. And here's the tea: Q is of order M if SIDE = 'L', and of order N if SIDE = 'R'. Periodt.
π« Notes π«
Every global data object is described by an associated description vector. This vector stores the info you need to map an object element to its process and memory location. Fr fr.
Let A be a generic term for any 2D block cyclicly distributed array. Such a global array has an associated description vector DESCA. In the following comments, the character _ should be read as "of the global array". π
DTYPE_A(global) β stored inDESCA( DTYPE_ )β the descriptor type. In this case,DTYPE_A = 1.CTXT_A(global) β stored inDESCA( CTXT_ )β the BLACS context handle, indicating the BLACS process grid A is distributed over. The context itself is global, but the handle (the integer value) may vary. πM_A(global) β stored inDESCA( M_ )β the number of rows in the global arrayA.N_A(global) β stored inDESCA( N_ )β the number of columns in the global arrayA.MB_A(global) β stored inDESCA( MB_ )β the blocking factor used to distribute the rows of the array.NB_A(global) β stored inDESCA( NB_ )β the blocking factor used to distribute the columns of the array.RSRC_A(global) β stored inDESCA( RSRC_ )β the process row over which the first row of the arrayAis distributed.CSRC_A(global) β stored inDESCA( CSRC_ )β the process column over which the first column of the arrayAis distributed.LLD_A(local) β stored inDESCA( LLD_ )β the leading dimension of the local array.LLD_A >= MAX(1,LOCr(M_A)).
Let K be the number of rows or columns of a distributed matrix, and assume its process grid has dimension p x q. πΈ
LOCr( K )denotes the number of elements ofKthat a process would receive ifKwere distributed over the p processes of its process column.LOCc( K )denotes the number of elements ofKthat a process would receive ifKwere distributed over the q processes of its process row.
The values of LOCr() and LOCc() may be determined via a call to the ScaLAPACK tool function, NUMROC:
LOCr( M ) = NUMROC( M, MB_A, MYROW, RSRC_A, NPROW ),
LOCc( N ) = NUMROC( N, NB_A, MYCOL, CSRC_A, NPCOL ).
An upper bound for these quantities may be computed by:
LOCr( M ) <= ceil( ceil(M/MB_A)/NPROW )*MB_A
LOCc( N ) <= ceil( ceil(N/NB_A)/NPCOL )*NB_A
β¨ ARGUMENTS β¨
SIDEβ (global input)CHARACTER= 'L': applyQorQ**Hfrom the Left;= 'R': applyQorQ**Hfrom the Right.
TRANSβ (global input)CHARACTER= 'N': No transpose, applyQ;= 'C': Conjugate transpose, applyQ**H.
Mβ (global input)INTEGERβ the number of rows to be operated on, i.e. the number of rows of the distributed submatrixsub( C ).M >= 0.Nβ (global input)INTEGERβ the number of columns to be operated on, i.e. the number of columns of the distributed submatrixsub( C ).N >= 0.Kβ (global input)INTEGERβ the number of elementary reflectors whose product defines the matrixQ. IfSIDE = 'L',M >= K >= 0; ifSIDE = 'R',N >= K >= 0. πAβ (local input)COMPLEXpointer into the local memory to an array of dimension(LLD_A,LOCc(JA+K-1)). On entry, the j-th column must contain the vector which defines the elementary reflectorH(j),JA <= j <= JA+K-1, as returned byPCGEQLFin theKcolumns of its distributed matrix argumentA(IA:*,JA:JA+K-1).A(IA:*,JA:JA+K-1)is modified by the routine but restored on exit. IfSIDE = 'L',LLD_A >= MAX( 1, LOCr(IA+M-1) ); ifSIDE = 'R',LLD_A >= MAX( 1, LOCr(IA+N-1) ).IAβ (global input)INTEGERβ the row index in the global arrayAindicating the first row ofsub( A ).JAβ (global input)INTEGERβ the column index in the global arrayAindicating the first column ofsub( A ).DESCAβ (global and local input)INTEGERarray of dimensionDLEN_. The array descriptor for the distributed matrixA.TAUβ (local input)COMPLEX, array, dimensionLOCc(JA+N-1)β this array contains the scalar factorsTAU(j)of the elementary reflectorsH(j)as returned byPCGEQLF.TAUis tied to the distributed matrixA. πCβ (local input/local output)COMPLEXpointer into the local memory to an array of dimension(LLD_C,LOCc(JC+N-1)). On entry, the local pieces of the distributed matrixsub(C). On exit,sub( C )is overwritten byQ*sub( C )orQ'*sub( C )orsub( C )*Q'orsub( C )*Q.ICβ (global input)INTEGERβ the row index in the global arrayCindicating the first row ofsub( C ).JCβ (global input)INTEGERβ the column index in the global arrayCindicating the first column ofsub( C ).DESCCβ (global and local input)INTEGERarray of dimensionDLEN_. The array descriptor for the distributed matrixC.WORKβ (local workspace/local output)COMPLEXarray, dimension(LWORK). On exit,WORK(1)returns the minimal and optimalLWORK. β¨LWORKβ (local or global input)INTEGERβ the dimension of the arrayWORK.LWORKis local input and must be at least:
If SIDE = 'L', LWORK >= MAX( (NB_A*(NB_A-1))/2, (NqC0 + MpC0)*NB_A ) + NB_A * NB_A
else if SIDE = 'R', LWORK >= MAX( (NB_A*(NB_A-1))/2, ( NqC0 + MAX( NpA0 + NUMROC( NUMROC( N+ICOFFC, NB_A, 0, 0, NPCOL ), NB_A, 0, 0, LCMQ ), MpC0 ) )*NB_A ) + NB_A * NB_A
end if
where:
where LCMQ = LCM / NPCOL with LCM = ICLM( NPROW, NPCOL ),
IROFFA = MOD( IA-1, MB_A ), ICOFFA = MOD( JA-1, NB_A ), IAROW = INDXG2P( IA, MB_A, MYROW, RSRC_A, NPROW ),
NpA0 = NUMROC( N+IROFFA, MB_A, MYROW, IAROW, NPROW ),
IROFFC = MOD( IC-1, MB_C ), ICOFFC = MOD( JC-1, NB_C ), ICROW = INDXG2P( IC, MB_C, MYROW, RSRC_C, NPROW ),
ICCOL = INDXG2P( JC, NB_C, MYCOL, CSRC_C, NPCOL ), MpC0 = NUMROC( M+IROFFC, MB_C, MYROW, ICROW, NPROW ),
NqC0 = NUMROC( N+ICOFFC, NB_C, MYCOL, ICCOL, NPCOL ),
ILCM, INDXG2P and NUMROC are ScaLAPACK tool functions; MYROW, MYCOL, NPROW and NPCOL can be determined by calling the subroutine BLACS_GRIDINFO. π§
IfLWORK = -1, thenLWORKis global input and a workspace query is assumed; the routine only calculates the minimum and optimal size for all work arrays. Each of these values is returned in the first entry of the corresponding work array, and no error message is issued byPXERBLA.
INFOβ (global output)INTEGER= 0: successful exit π< 0: If the i-th argument is an array and the j-entry had an illegal value, thenINFO = -(i*100+j); if the i-th argument is a scalar and had an illegal value, thenINFO = -i.
π Alignment requirements π
The distributed submatrices A(IA:*, JA:*) and C(IC:IC+M-1,JC:JC+N-1) must verify some alignment properties, namely the following expressions should be true:
If SIDE = 'L', ( MB_A.EQ.MB_C .AND. IROFFA.EQ.IROFFC .AND. IAROW.EQ.ICROW )
If SIDE = 'R', ( MB_A.EQ.NB_C .AND. IROFFA.EQ.ICOFFC )
Not me checking these before running. Bestie, check them. π
And that's the whole page, no skips, no edits, every last flag and formula intact. π
This beauty ships with LAPACK routine version 1.5, dated 12 May 1997 β vintage, iconic, still slaying. π«Άπ
π¦ where this page comes from
- ubuntu jammy: scalapack-doc 1.5-11
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms