PCUNMRZ(l)
PCUNMRZ π
okay bestie, welcome to the manual page for PCUNMRZ β LAPACK routine, version 1.5 energy, distributed complex matrix realness. it's giving main character linear algebra. let's get into it, no cap. β¨
πΈ NAME πΈ
PCUNMRZ β 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'.
π¦ SYNOPSIS π¦
here's the call signature, bestie. copy-paste carefully, fr fr:
SUBROUTINE PCUNMRZ( SIDE, TRANS, M, N, K, L, A, IA, JA, DESCA, TAU, C,
IC, JC, DESCC, WORK, LWORK, INFO )
CHARACTER SIDE, TRANS
INTEGER IA, IC, INFO, JA, JC, K, L, LWORK, M, N
INTEGER DESCA( * ), DESCC( * )
COMPLEX A( * ), C( * ), TAU( * ), WORK( * )
π― PURPOSE π―
PCUNMRZ 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
Q = H(1)' H(2)' . . . H(k)'
as returned by PCTZRZF. Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'.
π Notes π
Each global data object is described by an associated description vector. This vector stores the information required to establish the mapping between an object element and its corresponding process and memory location.
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".
π§Ύ NOTATION STORED IN EXPLANATION
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 that its process grid has dimension p x q. LOCr( K ) denotes the number of elements of K that a process would receive if K were distributed over the p processes of its process column. Similarly, LOCc( K ) denotes the number of elements of K that a process would receive if K were 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.L(global input) INTEGER The columns of the distributed submatrixsub( A )containing the meaningful part of the Householder reflectors. IfSIDE = 'L',M >= L >= 0, ifSIDE = 'R',N >= L >= 0.A(local input) COMPLEX pointer into the local memory to an array of dimension(LLD_A,LOCc(JA+M-1))ifSIDE='L', and(LLD_A,LOCc(JA+N-1))ifSIDE='R', whereLLD_A >= MAX(1,LOCr(IA+K-1)); On entry, thei-th row must contain the vector which defines the elementary reflectorH(i),IA <= i <= IA+K-1, as returned byPCTZRZFin theKrows of its distributed matrix argumentA(IA:IA+K-1,JA:*).A(IA:IA+K-1,JA:*)is modified by the routine but restored on exit.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) INTEGER array of dimensionDLEN_. The array descriptor for the distributed matrixA.TAU(local input) COMPLEX, array, dimensionLOCc(IA+K-1). This array contains the scalar factorsTAU(i)of the elementary reflectorsH(i)as returned byPCTZRZF.TAUis tied to the distributed matrixA.C(local input/local output) COMPLEX pointer 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) INTEGER array of dimensionDLEN_. The array descriptor for the distributed matrixC.WORK(local workspace/local output) COMPLEX array, 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 ifSIDE = 'L':
LWORK >= MAX( (MB_A*(MB_A-1))/2, (
MpC0 + MAX( MqA0 + NUMROC( NUMROC( M+IROFFC, MB_A, 0, 0, NPROW
), MB_A, 0, 0, LCMP ), NqC0 ) )*MB_A ) + MB_A * MB_A
else if SIDE = 'R':
LWORK >= MAX( (MB_A*(MB_A-1))/2, (MpC0 + NqC0)*MB_A
) + MB_A * MB_A
end if
where LCMP = LCM / NPROW with LCM = ICLM( NPROW, NPCOL ),
IROFFA = MOD( IA-1, MB_A ), ICOFFA = MOD( JA-1, NB_A ), IACOL =
INDXG2P( JA, NB_A, MYCOL, CSRC_A, NPCOL ), MqA0 = NUMROC(
M+ICOFFA, NB_A, MYCOL, IACOL, NPCOL ),
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.
If LWORK = -1, then LWORK is 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 by PXERBLA.
INFO(global output) INTEGER= 0: successful exit< 0: If thei-th argument is an array and thej-entry had an illegal value, thenINFO = -(i*100+j), if thei-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', ( NB_A.EQ.MB_C .AND. ICOFFA.EQ.IROFFC ) If SIDE = 'R', ( NB_A.EQ.NB_C .AND. ICOFFA.EQ.ICOFFC .AND. IACOL.EQ.ICCOL )
okay that's the whole tea, bestie. this page is from LAPACK version 1.5, dated 12 May 1997. PCUNMRZ(l) out. slay, hydrate, and may your distributed matrices always align. π
β¨π¦
π¦ 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