PZLASWP(l)

πŸ“¦ version 1.5, in ubuntu jammy

✨ NAME ✨

PZLASWP β€” bestie, this routine does a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1). That's it, that's the job. πŸ’«


🌸 SYNOPSIS 🌸

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

    CHARACTER       DIREC, ROWCOL

    INTEGER         IA, JA, K1, K2, N

    INTEGER         DESCA( * ), IPIV( * )

    COMPLEX*16      A( * )

πŸ’– PURPOSE πŸ’–

okay so PZLASWP 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 is 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 not doing that part for you, girl. πŸ™ˆ

Also note (and this is the important bit, don't skip it πŸ’€): this routine will only work for K1-K2 being in the same MB (or NB) block. If you want to pivot a full matrix, use PZLAPIV.

fr fr, same block only. that's not a vibe suggestion, that's a hard limit. πŸ”₯

πŸ“ Notes πŸ“

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

so here's the little legend of what lives where, no cap:

  • 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).
  • 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*16 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. she goes in one way and comes out shuffled, iconic. πŸ‘‘
  • 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.

and that's the whole page, bestie. every flag, every index, every block, all of it. 🫢

this lil love letter to pivoting comes to you from LAPACK version 1.5, dated 12 May 1997 β€” old enough to be our parent but still serving. πŸ’…βœ¨

πŸ“¦ where this page comes from