PZUNG2L(l)

πŸ“¦ version 1.5, in ubuntu jammy

✨ PZUNG2L ✨

okay bestie, gather round β€” this is the manpage for PZUNG2L, a LAPACK routine (we're on version 1.5 here, vintage πŸ’…). It's a ScaLAPACK joint, so it's all about distributed matrices and process grids. Yes, it's giving linear algebra. Yes, it's iconic. Let's get into it πŸ¦‹


πŸ’– NAME πŸ’–

PZUNG2L β€” generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M

Q = H(k)

periodt. πŸ’…


πŸŽ€ SYNOPSIS πŸŽ€

SUBROUTINE PZUNG2L( M, N, K, A, IA, JA, DESCA, TAU, WORK, LWORK, INFO )

    INTEGER         IA, INFO, JA, K, LWORK, M, N

    INTEGER         DESCA( * )

    COMPLEX*16      A( * ), TAU( * ), WORK( * )

🌸 PURPOSE 🌸

PZUNG2L generates an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M

as returned by PZGEQLF.

no cap, that "as returned by PZGEQLF" part matters β€” this routine is literally the glow-up of PZGEQLF's output. πŸ”₯

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".

Here's the whole notation vibe check, one bullet at a time, because we're not doing tables in this house:

  • NOTATION: DTYPE_A (global) β€” STORED IN: DESCA( DTYPE_ ) β€” EXPLANATION: the descriptor type. In this case, DTYPE_A = 1.
  • NOTATION: CTXT_A (global) β€” STORED IN: DESCA( CTXT_ ) β€” EXPLANATION: 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.
  • NOTATION: M_A (global) β€” STORED IN: DESCA( M_ ) β€” EXPLANATION: the number of rows in the global array A.
  • NOTATION: N_A (global) β€” STORED IN: DESCA( N_ ) β€” EXPLANATION: the number of columns in the global array A.
  • NOTATION: MB_A (global) β€” STORED IN: DESCA( MB_ ) β€” EXPLANATION: the blocking factor used to distribute the rows of the array.
  • NOTATION: NB_A (global) β€” STORED IN: DESCA( NB_ ) β€” EXPLANATION: the blocking factor used to distribute the columns of the array.
  • NOTATION: RSRC_A (global) β€” STORED IN: DESCA( RSRC_ ) β€” EXPLANATION: the process row over which the first row of the array A is distributed.
  • NOTATION: CSRC_A (global) β€” STORED IN: DESCA( CSRC_ ) β€” EXPLANATION: the process column over which the first column of the array A is distributed.
  • NOTATION: LLD_A (local) β€” STORED IN: DESCA( LLD_ ) β€” EXPLANATION: 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 πŸ¦‹

every single one, bestie, we're not skipping anybody πŸ’œ

  • M β€” (global input) INTEGER. The number of rows to be operated on, i.e. the number of rows of the distributed submatrix Q. M >= 0.
  • N β€” (global input) INTEGER. The number of columns to be operated on, i.e. the number of columns of the distributed submatrix Q. M >= N >= 0.
  • K β€” (global input) INTEGER. The number of elementary reflectors whose product defines the matrix Q. N >= K >= 0.
  • A β€” (local input/local output) COMPLEX*16 pointer into the local memory to an array of dimension (LLD_A,LOCc(JA+N-1)). On entry, the j-th column must contain the vector which defines the elementary reflector H(j), JA+N-K <= j <= JA+N-1, as returned by PZGEQLF in the K columns of its distributed matrix argument A(IA:*,JA+N-K:JA+N-1). On exit, this array contains the local pieces of the M-by-N distributed matrix Q.
  • 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(JA+N-1). This array contains the scalar factors TAU(j) of the elementary reflectors H(j) as returned by PZGEQLF. TAU is tied to the distributed matrix A.
  • 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
LWORK >= MpA0 + MAX( 1, NqA0 )

where

IROFFA = MOD( IA-1, MB_A ), ICOFFA = MOD( JA-1, NB_A ), IAROW = INDXG2P( IA, MB_A, MYROW, RSRC_A, NPROW ), IACOL = INDXG2P( JA, NB_A, MYCOL, CSRC_A, NPCOL ), MpA0 = NUMROC( M+IROFFA, MB_A, MYROW, IAROW, NPROW ), NqA0 = NUMROC( N+ICOFFA, NB_A, MYCOL, IACOL, NPCOL ),

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 <b>global input</b> 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 <b>no error message is issued by PXERBLA</b>. 🫢
  • INFO β€” (local output) INTEGER.
    • = 0: successful exit β€” we ate, no crumbs πŸŽ‰
    • < 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.

heads up bestie: negative INFO means somebody passed something cursed. Check that arithmetic before you come for the routine. πŸ’€

and that's the whole page, no notes, we covered every flag, every formula, every descriptor field πŸ’–

This was the PZUNG2L manpage from LAPACK version 1.5, dated 12 May 1997. Old money. Still iconic. Still slaying in Fortran. πŸ’…βœ¨ mwah 🫢

πŸ“¦ where this page comes from