PZTRTI2(l)
π PZTRTI2 π
okay so bestie, welcome to PZTRTI2 β it lives in the l manual (that's the LAPACK routine one, version 1.5, iykyk) and it's genuinely so iconic. it's a ScaLAPACK joint that flips a triangular block matrix inside out. let's get into it fr fr π
πΈ NAME πΈ
PZTRTI2 β computes the inverse of a complex upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1). that's the whole vibe. the way that it just does that πβ¨
β¨ SYNOPSIS β¨
SUBROUTINE PZTRTI2( UPLO, DIAG, N, A, IA, JA, DESCA, INFO )
CHARACTER DIAG, UPLO
INTEGER IA, INFO, JA, N
INTEGER DESCA( * )
COMPLEX*16 A( * )
π PURPOSE π
PZTRTI2 computes the inverse of a complex upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1). and listen β this matrix should be contained in one and only one process memory space. it's a local operation, no cap. so don't be out here thinking it's gonna gossip across the whole grid π
π Notes π
Every global data object is described by an associated description vector. this vector stores the info you need to establish the mapping between an object element and its corresponding process and memory location. it's giving β¨organizational queenβ¨.
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". (cute, right? it's a little nickname π₯Ί)
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. so the vibe is global, the number is not π«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 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. (so one's giving column energy and one's giving row energy, periodt π)
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 π
UPLOβ (global input)CHARACTER*1= 'U':sub( A )is upper triangular;= 'L':sub( A )is lower triangular.
DIAGβ (global input)CHARACTER*1= '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 submatrix
sub( A ).N >= 0. (yes bestie, zero is allowed, we're inclusive π)
- the number of rows and columns to be operated on, i.e. the order of the distributed submatrix
Aβ (local input/local output)COMPLEX*16pointer 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. so it's giving makeover but the outfit stays the same π β¨IAβ (global input)INTEGER- the row index in the global array
Aindicating the first row ofsub( A ).
- the row index in the global array
JAβ (global input)INTEGER- the column index in the global array
Aindicating the first column ofsub( A ).
- the column index in the global array
DESCAβ (global and local input)INTEGERarray of dimensionDLEN_.- the array descriptor for the distributed matrix
A.
- the array descriptor for the distributed matrix
INFOβ (local output)INTEGER= 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.
ngl the negativeINFOmath is the one thing that will humble you π but it's fine, it's fine,INFO = -(i*100+j)for arrays andINFO = -ifor scalars, just remember it and you'll slay.
and that's the whole page bestie, you ate it, no crumbs π
this was LAPACK version 1.5, dated 12 May 1997 β yeah she's a vintage icon and she still serves πβ¨
π¦ 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