PZUNMR3(l)

πŸ“¦ version 1.5, in ubuntu jammy

πŸ’– PZUNMR3 πŸ’–

okay bestie, sit down, hydrate, and let me tell you about PZUNMR3 β€” a real one from the LAPACK crew, version 1.5 era, and yes it's giving distributed linear algebra main character energy ✨


✨ NAME ✨

PZUNMR3 is out here overwriting the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with β€” and I need you to breathe for this β€” SIDE = 'L', SIDE = 'R', TRANS = 'N'. that's the whole job. that's the assignment. she ate πŸ’…


πŸŽ€ SYNOPSIS πŸŽ€

SUBROUTINE PZUNMR3( 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 that argument list. eighteen arguments. she's thorough, she's organized, she's not playing games 🫢


🌸 PURPOSE 🌸

so what does PZUNMR3 actually do, bestie? she overwrites the general complex M-by-N distributed matrix

sub( C ) = C(IC:IC+M-1,JC:JC+N-1)

with β€” and here's the tea, when 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 πŸ’« (yes, PZTZRZF is her bestie, they come as a set, iykyk).

and Q is of order M if SIDE = 'L', and of order N if SIDE = 'R'. periodt.


πŸ“ Notes πŸ“

okay so here's the lore you actually need. every global data object is described by an associated description vector. that vector stores all the info you need to map an object element to its corresponding process and memory location. it's the group chat admin of the whole operation.

let A be a generic term for any 2D block cyclicly distributed array. such a global array has an associated description vector DESCA. and in the following comments, read the character _ as "of the global array" β€” like, M_A = "M of the global array", that's the vibe 🌈

  • DTYPE_A (global) β€” stored in DESCA( DTYPE_ ) β€” the descriptor type. in this case, DTYPE_A = 1.
  • CTXT_A (global) β€” stored in DESCA( 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. iconic, honestly.
  • M_A (global) β€” stored in DESCA( M_ ) β€” the number of rows in the global array A.
  • N_A (global) β€” stored in DESCA( N_ ) β€” the number of columns in the global array A.
  • MB_A (global) β€” stored in DESCA( MB_ ) β€” the blocking factor used to distribute the rows of the array.
  • NB_A (global) β€” stored in DESCA( NB_ ) β€” the blocking factor used to distribute the columns of the array.
  • RSRC_A (global) β€” stored in DESCA( RSRC_ ) β€” the process row over which the first row of the array A is distributed.
  • CSRC_A (global) β€” stored in DESCA( CSRC_ ) β€” the process column over which the first column of the array A is distributed.
  • LLD_A (local) β€” stored in DESCA( LLD_ ) β€” the leading dimension of the local array. LLD_A >= MAX(1,LOCr(M_A)).

now let K be the number of rows or columns of a distributed matrix, and assume 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.
  • 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 πŸ‘‘

one bullet per argument, bestie, no skips, we respect the whole list πŸ’œ

  • 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 submatrix sub( C ). M >= 0.
  • N β€” (global input) INTEGER. The number of columns to be operated on, i.e the number of columns of the distributed submatrix sub( C ). N >= 0.
  • K β€” (global input) INTEGER. The number of elementary reflectors whose product defines the matrix Q. If SIDE = 'L', M >= K >= 0, if SIDE = 'R', N >= K >= 0.
  • L β€” (global input) INTEGER. The columns of the distributed submatrix sub( A ) containing the meaningful part of the Householder reflectors. If SIDE = 'L', M >= L >= 0, if SIDE = '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)) if SIDE='L', and (LLD_A,LOCc(JA+N-1)) if SIDE='R', where LLD_A >= MAX(1,LOCr(IA+K-1)). On entry, the i-th row must contain the vector which defines the elementary reflector H(i), IA <= i <= IA+K-1, as returned by PZTZRZF in the K rows of its distributed matrix argument A(IA:IA+K-1,JA:*). A(IA:IA+K-1,JA:*) is modified by the routine but restored on exit 🫢 (she's polite, she cleans up after herself).
  • IA β€” (global input) INTEGER. The row index in the global array A indicating the first row of sub( A ).
  • JA β€” (global input) INTEGER. The column index in the global array A indicating the first column of sub( A ).
  • DESCA β€” (global and local input) INTEGER array of dimension DLEN_. The array descriptor for the distributed matrix A.
  • TAU β€” (local input) COMPLEX*16, array, dimension LOCc(IA+K-1). This array contains the scalar factors TAU(i) of the elementary reflectors H(i) as returned by PZTZRZF. 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 matrix sub(C). On exit, sub( C ) is overwritten by Q*sub( C ) or Q'*sub( C ) or sub( C )*Q' or sub( C )*Q.
  • IC β€” (global input) INTEGER. The row index in the global array C indicating the first row of sub( C ).
  • JC β€” (global input) INTEGER. The column index in the global array C indicating the first column of sub( C ).
  • DESCC β€” (global and local input) INTEGER array of dimension DLEN_. 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 >= MpC0 + MAX( MAX( 1, NqC0 ), NUMROC( NUMROC( M+IROFFC,MB_A,0,0,NPROW ),MB_A,0,0,LCMP ) ); if SIDE = 'R', LWORK >= NqC0 + MAX( 1, MpC0 ).

where LCMP = LCM / NPROW with LCM = ICLM( NPROW, 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. (no drama, no complaint, she just hands you the numbers.)
  • INFO β€” (local output) INTEGER
    • = 0: successful exit πŸŽ‰
    • < 0: if the i-th argument is an array and the j-entry had an illegal value, then INFO = -(i*100+j), if the i-th argument is a scalar and had an illegal value, then INFO = -i.

πŸ“ Alignment requirements πŸ“

not to be that girl but there ARE rules, bestie, and they are non-negotiable 🌸

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 )
fr fr, check your alignment before you call her. she will not fix it for you. πŸ’€

okay that's the whole page, you're welcome, go forth and multiply (matrices) 🧚

this was LAPACK routine version 1.5, dated 12 May 1997 β€” absolute vintage, absolute legend, and honestly? still slaying after all these years. πŸ’–βœ¨πŸŽ€πŸ¦‹

πŸ“¦ where this page comes from