PDLAPV2(l)
πΈ PDLAPV2 β the LAPACK auxiliary routine, bestie edition πΈ
okay so. you opened PDLAPV2(l) and you're like "what is this". bestie, same, but now I know and you're gonna know too. it's from LAPACK version 1.5, it's a distributed-memory auxiliary routine, and it's literally the girl who does the pivoting. π
β¨ NAME β¨
PDLAPV2 β she applies either P (that's the permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting
A(IA:IA+M-1,JA:JA+N-1)
and the result is row or column pivoting. that's the whole job. that's her. π
β¨ SYNOPSIS β¨
SUBROUTINE PDLAPV2( DIREC, ROWCOL, M, N, A, IA, JA, DESCA, IPIV, IP, JP,
DESCIP )
CHARACTER DIREC, ROWCOL
INTEGER IA, IP, JA, JP, M, N
INTEGER DESCA( * ), DESCIP( * ), IPIV( * )
DOUBLE PRECISION A( * )
β¨ PURPOSE β¨
PDLAPV2 applies either P (the permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting.
and here's the part where you have to pay attention, no cap: the pivot vector should be aligned with the distributed matrix A.
- for pivoting the rows of
sub( A ),IPIVshould be distributed along a process column and replicated over all process rows π«Ά - similarly,
IPIVshould be distributed along a process row and replicated over all process columns for column pivoting π«Ά
π 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 β¨paperworkβ¨ but it matters.
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 π)
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 that its process grid has dimension p x q.
LOCr( K )denotes the number of elements ofKthat a process would receive ifKwere distributed over thepprocesses of its process column.- Similarly,
LOCc( K )denotes the number of elements ofKthat a process would receive ifKwere distributed over theqprocesses 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) β 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. Specifies if the rows or columns are to be permuted:'R'β rows will be permuted'C'β columns will be permuted
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)DOUBLE PRECISIONpointer into the local memory to an array of dimension(LLD_A, LOCc(JA+N-1)). On entry, this local array contains the local pieces of the distributed matrixsub( A )to which the row or columns interchanges will be applied. On exit, this array contains the local pieces of the permuted distributed matrix. π¦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β (input)INTEGERarray, dimension>= LOCr(M_A)+MB_AifROWCOL = 'R',LOCc(N_A)+NB_Aotherwise. 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.IPIVis tied to the distributed matrixA. π₯IPβ (global input)INTEGER.IPIV's global row index, which points to the beginning of the submatrix which is to be operated on.JPβ (global input)INTEGER.IPIV's global column index, which points to the beginning of the submatrix which is to be operated on.DESCIPβ (global and local input)INTEGERarray of dimension8. The array descriptor for the distributed matrixIPIV. π
heads up bestie: thatIPIVworkspace bit is not decorative β the lastMB_A(orNB_A) chunk of the array is literally doing work. do not go shrinking it. π
and that's the whole page!! you ate this fr fr π«Ά
so cute little sign-off: this one is from LAPACK version 1.5, dated 12 May 1997 β an icon, a legend, and she's still out here pivoting. periodt. πβ¨ππ¦πΈπ
π¦ 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