PZUNMRZ(l)
๐ PZUNMRZ(l) โ LAPACK routine (version 1.5) ๐
okay bestie, sit down, hydrate, and let me tell you about PZUNMRZ โ a real one from the LAPACK fam, version 1.5 energy. this is the distributed-memory girlie who applies a unitary matrix to your matrix without ever letting you see her do it. no cap.
โจ NAME โจ
PZUNMRZ โ 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'
she's giving "I'll take your matrix and hand it back... changed." ๐
๐ซถ SYNOPSIS ๐ซถ
SUBROUTINE PZUNMRZ( 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*16 A( * ), C( * ), TAU( * ), WORK( * )
look at her. eighteen arguments and not one of them is optional. main character behavior fr fr. ๐
๐ธ PURPOSE ๐ธ
PZUNMRZ 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 PZTZRZF. and Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. she adapts. she contains multitudes. ๐
๐ฆ Notes ๐ฆ
the descriptor lore (iykyk)
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".
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)).
LOCr / LOCc explained (the math girlies know) ๐งฎ
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
slay. ๐
๐ 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) 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 matrix Q. 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*16 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, the i-th row must contain the vector which defines the elementary reflectorH(i),IA <= i <= IA+K-1, as returned byPZTZRZFin the K rows 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. she borrows it and gives it back, that's called being polite ๐
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) INTEGER array of dimensionDLEN_. The array descriptor for the distributed matrix A.TAUโ (local input) COMPLEX*16, array, dimensionLOCc(IA+K-1). This array contains the scalar factorsTAU(i)of the elementary reflectorsH(i)as returned byPZTZRZF. TAU is tied to the distributed matrix A.Cโ (local input/local output) COMPLEX*16 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 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) INTEGER array of dimensionDLEN_. The array descriptor for the distributed matrix C.WORKโ (local workspace/local output) COMPLEX*16 array, dimension(LWORK)On exit,WORK(1)returns the minimal and optimal LWORK.LWORKโ (local or global input) INTEGER โ The dimension of the array WORK. LWORK is local input and must be at least
if SIDE = '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.
bestie that formula is LONG but she's just doing math, don't be scared. ๐ซถ
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', ( 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 this part is NOT a vibe suggestion, it's a requirement. if your alignment is off, she's gonna be in her feels and things break. respect the alignment. ๐
and that's the whole page bestie โ LAPACK version 1.5, dated 12 May 1997, still serving looks all these decades later. go forth and multiply (matrices). ๐โจ๐
๐ฆ 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