PSTRTI2(l)
π NAME π
okay so PSTRTI2 β she computes the inverse of a real upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1). that's the whole vibe. bestie inverts triangles, no cap. π¦
β¨ SYNOPSIS β¨
SUBROUTINE PSTRTI2( UPLO, DIAG, N, A, IA, JA, DESCA, INFO )
CHARACTER DIAG, UPLO
INTEGER IA, INFO, JA, N
INTEGER DESCA( * )
REAL A( * )
π PURPOSE π
So PSTRTI2 computes the inverse of a real upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1). iconic behavior.
And listen β this matrix needs to be contained in one and only one process memory space. that means it's a local operation, bestie. no passing notes across the grid, she's doing this solo. π
πΈ Notes πΈ
Every global data object has an associated description vector tagging along with it, and that vector is the one holding all the info you need to map an object element to its corresponding process and memory location. it's giving personal assistant energy, honestly. π«Ά
Let A be a generic term for any 2D block cyclicly distributed array. A global array like that has an associated description vector DESCA. And in the comments below, whenever you see the character _, read it 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 grid A is 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 array A.N_A(global) β stored inDESCA( N_ ). The number of columns in the global array A.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 array A is distributed.CSRC_A(global) β stored inDESCA( CSRC_ ). The process column over which the first column of the array A is distributed.LLD_A(local) β stored inDESCA( LLD_ ). The leading dimension of the local array.LLD_A >= MAX(1,LOCr(M_A)).
Okay so 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
math girlies stay winning. πβ¨
π ARGUMENTS π
UPLO(global input)CHARACTER*1β tells you which triangle you're working with:= 'U':sub( A )is upper triangular;= 'L':sub( A )is lower triangular.
DIAG(global input)CHARACTER*1β is the diagonal doing its own thing or nah:= 'N':sub( A )is non-unit triangular= 'U':sub( A )is unit triangular
N(global input)INTEGERβ the number of rows and columns to be operated on, i.e. the order of the distributed submatrixsub( A ).N >= 0. (yes bestie, zero is allowed, she's flexible π )A(local input/local output)REALpointer into the local memory to an array of dimension(LLD_A,LOCc(JA+N-1))β this array contains the local pieces of the triangular matrixsub( A ). IfUPLO = 'U', the leadingN-by-Nupper triangular part of the matrixsub( A )contains the upper triangular matrix, and the strictly lower triangular part ofsub( A )is not referenced. IfUPLO = 'L', the leadingN-by-Nlower triangular part of the matrixsub( A )contains the lower triangular matrix, and the strictly upper triangular part ofsub( A )is not referenced. IfDIAG = 'U', the diagonal elements ofsub( A )are also not referenced and are assumed to be1. On exit, the (triangular) inverse of the original matrix, in the same storage format. glow up complete. β¨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. the whole lore, in one vector. πINFO(local output)INTEGERβ the receipts:= 0: successful exit π< 0: If thei-th argument is an array and thej-entry had an illegal value, thenINFO = -(i*100+j), if thei-th argument is a scalar and had an illegal value, thenINFO = -i.
heads up bestie: when INFO < 0 she is not being shady, that negative number is literally pointing at which argument had the illegal value. read it like a map, not a mood. π§
that's the whole page, bestie β go invert something triangular and be iconic about it. π
signing off with the receipts: this is LAPACK version 1.5, dated 12 May 1997. vintage, but she still eats. π
π¦ 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