PDLARZB(l)
πΈ PDLARZB πΈ
okay bestie come SIT π this is PDLARZB, a LAPACK auxiliary routine, and we're doing it from the (l) manual, version 1.5, no cap. She's a ScaLAPACK girlie: distributed matrices, BLACS grids, descriptors, the whole vibe. It's giving parallel linear algebra realness and honestly? iconic. π«Ά
β¨ NAME β¨
PDLARZB β applies a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1). β¨
π SYNOPSIS π
SUBROUTINE PDLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, IV, JV,
DESCV, T, C, IC, JC, DESCC, WORK )
CHARACTER DIRECT, SIDE, STOREV, TRANS
INTEGER IC, IV, JC, JV, K, L, M, N
INTEGER DESCC( * ), DESCV( * )
DOUBLE PRECISION C( * ), T( * ), V( * ), WORK( * )
like... look at her. so many arguments. so much power. π
π PURPOSE π
PDLARZB applies a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) β from the left or from the right, your call, main character energy either way. π
Q is a product of k elementary reflectors as returned by PDTZRZF.
β οΈ Currently, onlySTOREV = 'R'andDIRECT = 'B'are supported. The other combos are lowkey not here yet. Do not test them. Do not pass go. π«
π¦ 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".
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 gridAis 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β which side are we coming from, bestie:= 'L': applyQorQ**Tfrom the Left;= 'R': applyQorQ**Tfrom the Right.
TRANS(global input)CHARACTERβ transpose or no transpose, the eternal question:= 'N': No transpose, applyQ;= 'T': Transpose, applyQ**T.
DIRECT(global input)CHARACTERβ indicates howHis formed from a product of elementary reflectors:= 'F':H = H(1) H(2) . . . H(k)(Forward, not supported yet)= 'B':H = H(k) . . . H(2) H(1)(Backward)
STOREV(global input)CHARACTERβ indicates how the vectors which define the elementary reflectors are stored:= 'C': Columnwise (not supported yet)= 'R': Rowwise
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 order of the matrixT(= the number of elementary reflectors whose product defines the block reflector).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.V(local input)DOUBLE PRECISIONβ pointer into the local memory to an array of dimension(LLD_V, LOCc(JV+M-1))ifSIDE = 'L',(LLD_V, LOCc(JV+N-1))ifSIDE = 'R'. It contains the local pieces of the distributed vectorsVrepresenting the Householder transformation as returned byPDTZRZF.LLD_V >= LOCr(IV+K-1).IV(global input)INTEGERβ the row index in the global arrayVindicating the first row ofsub( V ).JV(global input)INTEGERβ the column index in the global arrayVindicating the first column ofsub( V ).DESCV(global and local input)INTEGERarray of dimensionDLEN_. The array descriptor for the distributed matrixV.T(local input)DOUBLE PRECISIONarray, dimensionMB_VbyMB_V. The lower triangular matrixTin the representation of the block reflector.C(local input/local output)DOUBLE PRECISIONβ pointer into the local memory to an array of dimension(LLD_C,LOCc(JC+N-1)). On entry, the M-by-N distributed matrixsub( C ). On exit,sub( C )is overwritten byQ*sub( C )orQ'*sub( C )orsub( C )*Qorsub( C )*Q'. (she gets rewritten, that's her job π)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)DOUBLE PRECISIONarray, dimension(LWORK).
So like, the size you need depends on a lot of things. Here it is, unedited, because we do not gatekeep β¨:
If STOREV = 'C',
if SIDE = 'L', LWORK >= ( NqC0 + MpC0 ) * K
else if SIDE = 'R', LWORK >= ( NqC0 + MAX( NpV0 + NUMROC( NUMROC(
N+ICOFFC, NB_V, 0, 0, NPCOL ), NB_V, 0, 0, LCMQ ), MpC0 ) ) * K
end if
else if STOREV = 'R',
if SIDE = 'L', LWORK >= ( MpC0 + MAX( MqV0 + NUMROC( NUMROC(
M+IROFFC, MB_V, 0, 0, NPROW ), MB_V, 0, 0, LCMP ), NqC0 ) ) * K
else if SIDE = 'R', LWORK >= ( MpC0 + NqC0 ) * K
end if
end if
where LCMQ = LCM / NPCOL with LCM = ICLM( NPROW, NPCOL ),
IROFFV = MOD( IV-1, MB_V ), ICOFFV = MOD( JV-1, NB_V ), IVROW = INDXG2P( IV, MB_V, MYROW, RSRC_V, NPROW ), IVCOL = INDXG2P( JV, NB_V, MYCOL, CSRC_V, NPCOL ), MqV0 = NUMROC( M+ICOFFV, NB_V, MYCOL, IVCOL, NPCOL ), NpV0 = NUMROC( N+IROFFV, MB_V, MYROW, IVROW, 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 ), NpC0 = NUMROC( N+ICOFFC, 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.
π§ Alignment requirements π§
The distributed submatrices V(IV:*, JV:*) and C(IC:IC+M-1,JC:JC+N-1) must verify some alignment properties, namely the following expressions should be true:
If STOREV = 'Columnwise'
If SIDE = 'Left', ( MB_V.EQ.MB_C .AND. IROFFV.EQ.IROFFC .AND. IVROW.EQ.ICROW )
If SIDE = 'Right', ( MB_V.EQ.NB_C .AND. IROFFV.EQ.ICOFFC )
else if STOREV = 'Rowwise'
If SIDE = 'Left', ( NB_V.EQ.MB_C .AND. ICOFFV.EQ.IROFFC )
If SIDE = 'Right', ( NB_V.EQ.NB_C .AND. ICOFFV.EQ.ICOFFC .AND. IVCOL.EQ.ICCOL )
end if
π«Ά lowkey the alignment rules are the whole personality of this routine. if those .AND.s don't hold, bestie, it's not gonna go well.
that's the whole page, no notes π go forth and distribute your matrices responsibly. this was PDLARZB, LAPACK auxiliary routine, LAPACK version 1.5, dated 12 May 1997 β 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