PCLASWP(l)

πŸ“¦ version 1.5, in ubuntu jammy

πŸ’– PCLASWP(l) β€” LAPACK auxiliary routine, but make it make sense πŸ’–

okay bestie, sit down, grab a boba, because we're talking about PCLASWP β€” a LAPACK auxiliary routine from version 1.5, and she is lowkey iconic. ✨


✨ NAME ✨

PCLASWP β€” perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1). swapping era, fr fr πŸ”πŸ’…


🌸 SYNOPSIS 🌸

SUBROUTINE PCLASWP( DIREC, ROWCOL, N, A, IA, JA, DESCA, K1, K2, IPIV )

    CHARACTER       DIREC, ROWCOL

    INTEGER         IA, JA, K1, K2, N

    INTEGER         DESCA( * ), IPIV( * )

    COMPLEX         A( * )

πŸ¦‹ PURPOSE πŸ¦‹

so PCLASWP performs a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1). one interchange gets initiated for each of rows or columns K1 through K2 of sub( A ). this routine assumes that the pivoting information has already been broadcast along the process row or column β€” like, it's already been shared, don't come for her, she's not doing that part. 🫢

also, heads up, bestie: this routine will only work for K1-K2 being in the same MB (or NB) block. that's the vibe check right there. if you want to pivot a full matrix, use PCLAPIV. periodt. πŸ‘‘

πŸ“ 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. (it's giving ✨glow-up for data✨)

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". iykyk πŸ’œ

here's the whole notation moment, laid out for u:

  • 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.
  • 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)).

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 πŸŽ€

  • DIREC β€” (global input) CHARACTER. specifies in which order the permutation is applied: = 'F' (Forward), = 'B' (Backward). pick ur direction, main character energy either way πŸ’«
  • ROWCOL β€” (global input) CHARACTER. specifies if the rows or columns are permuted: = 'R' (Rows), = 'C' (Columns).
  • N β€” (global input) INTEGER. if ROWCOL = 'R', the length of the rows of the distributed matrix A(*,JA:JA+N-1) to be permuted; if ROWCOL = 'C', the length of the columns of the distributed matrix A(IA:IA+N-1,*) to be permuted.
  • A β€” (local input/local output) COMPLEX pointer into the local memory to an array of dimension (LLD_A, * ). on entry, this array contains the local pieces of the distributed matrix to which the row/columns interchanges will be applied. on exit the permuted distributed matrix. glow up complete πŸ’…βœ¨
  • 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.
  • K1 β€” (global input) INTEGER. the first element of IPIV for which a row or column interchange will be done.
  • K2 β€” (global input) INTEGER. the last element of IPIV for which a row or column interchange will be done.
  • IPIV β€” (local input) INTEGER array, dimension LOCr(M_A)+MB_A for row pivoting and LOCc(N_A)+NB_A for column pivoting. this array is tied to the matrix A, IPIV(K) = L implies rows (or columns) K and L are to be interchanged. matching set, no cap πŸ“
🌈 reminder bestie: K1 through K2 gotta live in the same MB (or NB) block or this whole thing does not slay. and if you're pivoting a full matrix? PCLAPIV is the one. go get her.

and that's the whole page, bestie β€” written by the LAPACK girlies, LAPACK version 1.5, dated 12 May 1997, and it ate. πŸ’–πŸ”₯βœ¨πŸ’…πŸ¦‹πŸ‘‘πŸŒΈ

πŸ“¦ where this page comes from