PZLAPIV(l)
π NAME π
PZLAPIV β the LAPACK auxiliary routine (manual section l, bestie) that applies either P (that's the permutation matrix, the one IPIV is telling you about) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), and the whole point is that you end up with row or column pivoting. π
β¨ SYNOPSIS β¨
SUBROUTINE PZLAPIV( DIREC, ROWCOL, PIVROC, M, N, A, IA, JA, DESCA, IPIV,
IP, JP, DESCIP, IWORK )
CHARACTER*1 DIREC, PIVROC, ROWCOL
INTEGER IA, IP, JA, JP, M, N
INTEGER DESCA( * ), DESCIP( * ), IPIV( * ), IWORK( * )
COMPLEX*16 A( * )
π PURPOSE π
okay so. PZLAPIV applies either P (the permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), which results in row or column pivoting. Iconic.
The pivot vector may be distributed across a process row or a process column. And here's the vibe: the pivot vector should be aligned with the distributed matrix A. This routine will transpose the pivot vector if necessary. So, for example, if the row pivots should be applied to the columns of sub( A ), you pass ROWCOL='C' and PIVROC='C'. iykyk π
π¦ Notes π¦
Every global data object gets described by an associated description vector, no cap. That vector stores all the info you need 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 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
π Restrictions π
IPIV must always be a distributed vector (not a matrix). Thus:
IF( ROWPIV .EQ. 'C' ) THEN
JP must be 1
ELSE
IP must be 1
END IF
The following restrictions apply when IPIV must be transposed:
IF( ROWPIV.EQ.'C' .AND. PIVROC.EQ.'C') THEN
DESCIP(MB_) must equal DESCA(NB_)
ELSE IF( ROWPIV.EQ.'R" .AND. PIVROC.EQ.'R') THEN
DESCIP(NB_) must equal DESCA(MB_)
END IF
bestie pls read those twice, they will absolutely ruin your day if you ignore them π
πΈ ARGUMENTS πΈ
DIREC(global input)CHARACTER*1β specifies in which order the permutation is applied:= 'F'(Forward) applies pivots Forward from top of matrix. ComputesP*sub( A ). π₯= 'B'(Backward) applies pivots Backward from bottom of matrix. Computesinv( P )*sub( A ).
ROWCOL(global input)CHARACTER*1β specifies if the rows or columns are to be permuted:= 'R'Rows will be permuted= 'C'Columns will be permuted
PIVROC(global input)CHARACTER*1β specifies whetherIPIVis distributed over a process row or column:= 'R'IPIVdistributed over a process row= 'C'IPIVdistributed over a process column
M(global input)INTEGERβ the number of rows to be operated on, i.e. the number of rows of the distributed submatrixsub( A ).M >= 0.N(global input)INTEGERβ the number of columns to be operated on, i.e. the number of columns of the distributed submatrixsub( A ).N >= 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, this array contains the local pieces of the distributed submatrixsub( A )to which the row or column interchanges will be applied. On exit, the local pieces of the permuted distributed submatrix. β¨IA(global input)INTEGERβ the row index in the global arrayAindicating the first row ofsub( A ).JA(global input)INTEGERβ the column index in the global arrayAindicating the first column ofsub( A ).DESCA(global and local input)INTEGERarray of dimensionDLEN_β the array descriptor for the distributed matrixA.IPIV(local input)INTEGERarray, dimension>= LOCr(M_A)+MB_AifROWCOL='R', otherwiseLOCc(N_A)+NB_A. It contains the pivoting information.IPIV(i)is the global row (column), local row (column)iwas swapped with. The last piece of the array of sizeMB_A(resp.NB_A) is used as workspace. This array is tied to the distributed matrixA. π«ΆIWORK(local workspace)INTEGERarray, dimension(LDW)β whereLDWis equal to the workspace necessary for transposition, and the storage of the transposedIPIV:
Let LCM be the least common multiple of NPROW and NPCOL.
IF( ROWCOL.EQ.'R' .AND. PIVROC.EQ.'R' ) THEN
IF( NPROW.EQ.NPCOL ) THEN
LDW = LOCr( N_P + MOD(JP-1, NB_P) ) + NB_P
ELSE
LDW = LOCr( N_P + MOD(JP-1, NB_P) ) + NB_P * CEIL( CEIL(LOCc(N_P)/NB_P) /
(LCM/NPCOL) )
END IF
ELSE IF( ROWCOL.EQ.'C' .AND. PIVROC.EQ.'C' ) THEN
IF( NPROW.EQ.NPCOL ) THEN
LDW = LOCc( M_P + MOD(IP-1, MB_P) ) + MB_P
ELSE
LDW = LOCc( M_P + MOD(IP-1, MB_P) ) + MB_P * CEIL( CEIL(LOCr(M_P)/MB_P) /
(LCM/NPROW) )
END IF
ELSE
IWORK is not referenced.
END IF
and that's the whole thing, bestie, go forth and pivot responsibly π this page is from LAPACK version 1.5, dated 12 May 1997 β yes she's vintage, yes she still ate ππ¦β¨
π¦ 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