PDLATRA(l)
β¨ PDLATRA β the trace girlie of the l manual β¨
okay so bestie, pull up a chair, because we're about to talk about a LAPACK auxiliary routine from the l manual and honestly? she's lowkey iconic. her name is PDLATRA and she does exactly one thing and does it beautifully. π
πΈ NAME πΈ
PDLATRA β computes the trace of an N-by-N distributed matrix sub( A ), aka the matrix you get when you're looking at A( IA:IA+N-1, JA:JA+N-1 ). no cap, that's the whole job. π
π¦ SYNOPSIS π¦
DOUBLE PRECISION FUNCTION PDLATRA( N, A, IA, JA, DESCA )
INTEGER IA, JA, N
INTEGER DESCA( * )
DOUBLE PRECISION A( * )
she's a DOUBLE PRECISION FUNCTION, she takes five arguments, she does not take notes. periodt. β¨
π PURPOSE π
so PDLATRA computes the trace of an N-by-N distributed matrix sub( A ), which (say it with me) denotes A( IA:IA+N-1, JA:JA+N-1 ). and here's the part that matters: the result is left on every process of the grid. not just one lucky process. every process. we love a generous queen. π
π«Ά Notes π«Ά
each global data object is described by an associated description vector, and that vector stores the info you need to establish the mapping between an object element and its corresponding process and memory location. iykyk. π
let A be a generic term for any 2D block cyclicly distributed array. such a global array has an associated description vector DESCA. and in the following comments, read the character _ as "of the global array". ok? ok. π
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. and bestie,LLD_A >= MAX(1,LOCr(M_A)). π¨
now 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 way that these two just parallel each other? obsessed. β¨
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 π
Nβ (global input)INTEGER. the number of rows and columns to be operated on, i.e. the order of the distributed submatrixsub( A ). andN >= 0, so no negative nonsense please. πAβ (local input)DOUBLE PRECISIONpointer into the local memory to an array of dimension( LLD_A, LOCc(JA+N-1) ). this array contains the local pieces of the distributed matrix the trace is to be computed from. she's the main character, fr fr. π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. do not skip her, she's carrying all the mapping info on her back. π
π«Ά reminder bestie: everything above is facts, i just wrapped it in glitter. no invented behaviour, no extra tips, just the manual with a vibe check. π
and that's the whole page!! π this cutie comes to you from LAPACK version 1.5, dated 12 May 1997 β vintage, but she ate and left no crumbs. πΈβ¨ bye bestie, go compute a trace! ππ¦π
π¦ 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