PZUNMTR(l)
π PZUNMTR π
okay bestie, welcome to PZUNMTR, a LAPACK routine (that's LAPACK version 1.5, vintage but iconic) and it's here to do one very specific, very sparkly thing to your distributed complex matrices. pull up a chair. π«Ά
β¨ NAME β¨
PZUNMTR β 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 the whole job, she's a specialist π
πΈ SYNOPSIS πΈ
SUBROUTINE PZUNMTR( SIDE, UPLO, TRANS, M, N, A, IA, JA, DESCA, TAU, C,
IC, JC, DESCC, WORK, LWORK, INFO )
CHARACTER SIDE, TRANS, UPLO
INTEGER IA, IC, INFO, JA, JC, LWORK, M, N
INTEGER DESCA( * ), DESCC( * )
COMPLEX*16 A( * ), C( * ), TAU( * ), WORK( * )
π PURPOSE π
PZUNMTR 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 of order nq, with nq = m if SIDE = 'L' and nq = n if SIDE = 'R'. Q is defined as the product of nq-1 elementary reflectors, as returned by PZHETRD:
- if
UPLO = 'U',Q = H(nq-1) . . . H(2) H(1); - if
UPLO = 'L',Q = H(1) H(2) . . . H(nq-1).
π Notes π
every global data object is described by an associated description vector. this vector stores the info you need to establish the mapping between an object element and its corresponding process and memory location. yes bestie, it's the β¨mapβ¨.
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".
here's the whole notation situation, laid out all cute:
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 array A.N_A(global) β stored inDESCA( N_ )β the number of columns in the global array A.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 array A is distributed.CSRC_A(global) β stored inDESCA( CSRC_ )β the process column over which the first column of the array A is 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': apply Q or Q**H from the Left;= 'R': apply Q or Q**H from the Right.
UPLOβ (global input)CHARACTER= 'U': Upper triangle ofA(IA:*,JA:*)contains elementary reflectors fromPZHETRD;= 'L': Lower triangle ofA(IA:*,JA:*)contains elementary reflectors fromPZHETRD.
TRANSβ (global input)CHARACTER= 'N': No transpose, apply Q;= 'C': Conjugate transpose, apply Q**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.Aβ (local input)COMPLEX*16pointer into the local memory to an array of dimension(LLD_A,LOCc(JA+M-1))ifSIDE='L', or(LLD_A,LOCc(JA+N-1))ifSIDE = 'R'. the vectors which define the elementary reflectors, as returned byPZHETRD. 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 array A indicating the first row ofsub( A ).JAβ (global input)INTEGERβ the column index in the global array A indicating the first column ofsub( A ).DESCAβ (global and local input)INTEGERarray of dimensionDLEN_. the array descriptor for the distributed matrix A.TAUβ (local input)COMPLEX*16array, dimensionLTAU, where ifSIDE = 'L'andUPLO = 'U',LTAU = LOCc(M_A), ifSIDE = 'L'andUPLO = 'L',LTAU = LOCc(JA+M-2), ifSIDE = 'R'andUPLO = 'U',LTAU = LOCc(N_A), ifSIDE = 'R'andUPLO = 'L',LTAU = LOCc(JA+N-2).TAU(i)must contain the scalar factor of the elementary reflectorH(i), as returned byPZHETRD. TAU is tied to the distributed matrix A. π¦Cβ (local input/local output)COMPLEX*16pointer 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 array C indicating the first row ofsub( C ).JCβ (global input)INTEGERβ the column index in the global array C indicating the first column ofsub( C ).DESCCβ (global and local input)INTEGERarray of dimensionDLEN_. the array descriptor for the distributed matrix C.WORKβ (local workspace/local output)COMPLEX*16array, 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 UPLO = 'U', IAA = IA, JAA = JA+1, ICC = IC, JCC = JC; else
UPLO = 'L', IAA = IA+1, JAA = JA; if SIDE = 'L', ICC = IC+1; JCC
= JC; else ICC = IC; JCC = JC+1; end if end if
If SIDE = 'L', MI = M-1; NI = N; LWORK >= MAX(
(NB_A*(NB_A-1))/2, (NqC0 + MpC0)*NB_A ) + NB_A * NB_A else if
SIDE = 'R', MI = M; MI = N-1; LWORK >= MAX( (NB_A*(NB_A-1))/2, (
NqC0 + MAX( NpA0 + NUMROC( NUMROC( NI+ICOFFC, NB_A, 0, 0, NPCOL
), NB_A, 0, 0, LCMQ ), MpC0 ) )*NB_A ) + NB_A * NB_A end if
where LCMQ = LCM / NPCOL with LCM = ICLM( NPROW, NPCOL ),
IROFFA = MOD( IAA-1, MB_A ), ICOFFA = MOD( JAA-1, NB_A ), IAROW
= INDXG2P( IAA, MB_A, MYROW, RSRC_A, NPROW ), NpA0 = NUMROC(
NI+IROFFA, MB_A, MYROW, IAROW, NPROW ),
IROFFC = MOD( ICC-1, MB_C ), ICOFFC = MOD( JCC-1, NB_C ), ICROW
= INDXG2P( ICC, MB_C, MYROW, RSRC_C, NPROW ), ICCOL = INDXG2P(
JCC, NB_C, MYCOL, CSRC_C, NPCOL ), MpC0 = NUMROC( MI+IROFFC,
MB_C, MYROW, ICROW, NPROW ), NqC0 = NUMROC( NI+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. so if you were waiting for a lil scream fromPXERBLA, bestie, it's not coming. π
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 )
and that's the whole page, babe. this was PZUNMTR(l) from the LAPACK routine pile β LAPACK version 1.5, dated 12 May 1997 β so go forth, align your descriptors, and slay π
πππ
π¦ 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