PCPOTRI(l)
π PCPOTRI π (the (l) LAPACK routine, version 1.5, bestie edition)
okay so first of all, welcome to PCPOTRI β she's a LAPACK routine and she's that girl. Here's the whole vibe.
β¨ NAME β¨
PCPOTRI β compute the inverse of a complex Hermitian positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**H*U or L*L**H computed by PCPOTRF. π
πΈ SYNOPSIS πΈ
SUBROUTINE PCPOTRI( UPLO, N, A, IA, JA, DESCA, INFO )
CHARACTER UPLO
INTEGER IA, INFO, JA, N
INTEGER DESCA( * )
COMPLEX A( * )
π PURPOSE π
PCPOTRI computes the inverse of a complex Hermitian positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**H*U or L*L**H computed by PCPOTRF. no cap, that's literally the whole job. π«Ά
π Notes π
okay so this part is the lore, and you need it, so lock in bestie π§
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.
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".
the notation tea β:
DTYPE_A(global) βDESCA( DTYPE_ ): the descriptor type. In this case,DTYPE_A = 1.CTXT_A(global) βDESCA( 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) βDESCA( M_ ): the number of rows in the global arrayA.N_A(global) βDESCA( N_ ): the number of columns in the global arrayA.MB_A(global) βDESCA( MB_ ): the blocking factor used to distribute the rows of the array.NB_A(global) βDESCA( NB_ ): the blocking factor used to distribute the columns of the array.RSRC_A(global) βDESCA( RSRC_ ): the process row over which the first row of the arrayAis distributed.CSRC_A(global) βDESCA( CSRC_ ): the process column over which the first column of the arrayAis distributed.LLD_A(local) βDESCA( 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.
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': Upper triangle ofsub( A )is stored;= 'L': Lower triangle ofsub( A )is stored.
Nβ (global input)INTEGERThe number of rows and columns to be operated on, i.e. the order of the distributed submatrixsub( A ).N >= 0. zero is valid bestie, don't come for her πAβ (local input/local output)COMPLEXpointer into the local memory to an array of dimension(LLD_A, LOCc(JA+N-1)). On entry, the local pieces of the triangular factorUorLfrom the Cholesky factorization of the distributed matrixsub( A ) = U**H*UorL*L**H, as computed byPCPOTRF. On exit, the local pieces of the upper or lower triangle of the (Hermitian) inverse ofsub( A ), overwriting the input factorUorL. she overwrites her input, that's just who she is πIAβ (global input)INTEGERThe row index in the global arrayAindicating the first row ofsub( A ).JAβ (global input)INTEGERThe 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.INFOβ (global output)INTEGER= 0: successful exit π< 0: If the i-th argument is an array and the j-entry had an illegal value, thenINFO = -(i*100+j), if the i-th argument is a scalar and had an illegal value, thenINFO = -i.> 0: IfINFO = i, the(i,i)element of the factorUorLis zero, and the inverse could not be computed.
β οΈ heads up bestie: ifINFO = i > 0, that(i,i)element of the factorUorLis zero and the inverse genuinely could not be computed. that's not a vibe, that's a hard stop. π
π no extra tips here, just the facts, because inventing behaviour would be not the move. everything above is the real deal, fr fr.
that's the whole page bestie, go forth and invert responsibly π¦πβ¨
This was LAPACK routine version 1.5, dated 12 May 1997 β iconic, timeless, and honestly the blueprint. mwah π ππΈ
π¦ 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