PZUNMQR(l)
π PZUNMQR π
okay so bestie, welcome to PZUNMQR β a LAPACK routine, version 1.5, and she is that girl. she's the QR-flavored cousin of the unmQR family (iykyk) and she's here to apply a unitary matrix to your distributed matrix without even asking permission first. rude? maybe. iconic? absolutely. π
πΈ NAME πΈ
PZUNMQR β 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 β¨
SUBROUTINE PZUNMQR( 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*16 A( * ), C( * ), TAU( * ), WORK( * )
π¦ PURPOSE π¦
PZUNMQR 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 PZGEQRF. Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'.
π Notes π
okay so every global data object has a little buddy called a description vector, and that vector is holding all the info you need to map an element of the object to its process and memory location. it's giving personal assistant energy. π«Ά
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 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.
TRANSβ (global input)CHARACTER= 'N': No transpose, apply Q;= 'C': Conjugate transpose, apply Q**H.
Mβ (global input)INTEGERthe number of rows to be operated on i.e the number of rows of the distributed submatrixsub( C ).M >= 0.Nβ (global input)INTEGERthe number of columns to be operated on i.e the number of columns of the distributed submatrixsub( C ).N >= 0.Kβ (global input)INTEGERthe number of elementary reflectors whose product defines the matrix Q. ifSIDE = 'L',M >= K >= 0, ifSIDE = 'R',N >= K >= 0.Aβ (local input)COMPLEX*16pointer 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 byPZGEQRFin the K columns 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)INTEGERthe row index in the global array A indicating the first row ofsub( A ).JAβ (global input)INTEGERthe 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*16, array, dimensionLOCc(JA+K-1). this array contains the scalar factorsTAU(j)of the elementary reflectorsH(j)as returned byPZGEQRF. TAU is tied to the distributed matrix A. they're bonded, fr fr. π«Ά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. she's not coming back the same, bestie. πICβ (global input)INTEGERthe row index in the global array C indicating the first row ofsub( C ).JCβ (global input)INTEGERthe 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 optimal LWORK.LWORKβ (local or global input)INTEGERthe dimension of the arrayWORK. LWORK is 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 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, 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 byPXERBLA. β¨ little peek-behind-the-curtain moment, no notes, no drama. π
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 )
like, they have to match. it's not a suggestion, it's a vibe check and if you fail it, that's on you. π
and that's the whole page, bestie!! this lil masterpiece shipped with LAPACK version 1.5 and is dated 12 May 1997 β yes she's vintage, no she's not outdated, she's timeless. πβ¨π go apply those reflectors, you absolute icon. periodt. ππ¦
π¦ 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