PDGETRI(l)
PDGETRI π the LAPACK girlies know
okay bestie, gather round, because today we're talking about PDGETRI β a LAPACK routine, version 1.5, and she is lowkey the moment. This page is literally titled PDGETRI(l) in the man pages, so now you know her full government name. π
β¨ NAME β¨
PDGETRI β compute the inverse of a distributed matrix using the LU factorization computed by PDGETRF. That's it, that's the whole vibe. π¦
β¨ SYNOPSIS β¨
SUBROUTINE PDGETRI( N, A, IA, JA, DESCA, IPIV, WORK, LWORK, IWORK,
LIWORK, INFO )
INTEGER IA, INFO, JA, LIWORK, LWORK, N
INTEGER DESCA( * ), IPIV( * ), IWORK( * )
DOUBLE PRECISION A( * ), WORK( * )
β¨ PURPOSE β¨
PDGETRI computes the inverse of a distributed matrix using the LU factorization computed by PDGETRF. No cap. The method is: it inverts U first, and then it gets the inverse of sub( A ) = A(IA:IA+N-1,JA:JA+N-1) β which we call InvA, cute nickname, love that for her β by solving the system InvA*L = inv(U) for InvA. periodt. π
Notes π
Every 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. iykyk.
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". π§
Here's the whole notation situation, and yes I'm giving you every single line because nothing gets skipped in this house:
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 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.
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 β¨
okay this is the part where you actually pay attention, bestie, because every one of these matters π
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.Aβ (local input/local output)DOUBLE PRECISIONpointer into the local memory to an array of dimension(LLD_A,LOCc(JA+N-1)). On entry, the local pieces of theLandUobtained by the factorizationsub( A ) = P*L*Ucomputed byPDGETRF. On exit, ifINFO = 0,sub( A )contains the inverse of the original distributed matrixsub( A ). glow up β¨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β (local input)INTEGERarray, dimensionLOCr(M_A)+MB_A. keeps track of the pivoting information.IPIV(i)is the global row index the local rowiwas swapped with. This array is tied to the distributed matrixA. πWORKβ (local workspace/local output)DOUBLE PRECISIONarray, dimension(LWORK). On exit,WORK(1)returns the minimal and optimalLWORK.LWORKβ (local or global input)INTEGER. The dimension of the arrayWORK.LWORKis local input and must be at leastLWORK = LOCr(N+MOD(IA-1,MB_A))*NB_A.WORKis used to keep a copy of at most an entire column block ofsub( A ).
If LWORK = -1, then LWORK is global input and a workspace query is assumed; the routine only calculates the minimum and optimal size for all work arrays. Each of these values is returned in the first entry of the corresponding work array, and no error message is issued by PXERBLA. sneaky little query mode, we love her π«Ά
IWORKβ (local workspace/local output)INTEGERarray, dimension(LIWORK). On exit,IWORK(1)returns the minimal and optimalLIWORK.LIWORKβ (local or global input)INTEGER. The dimension of the arrayIWORKused as workspace for physically transposing the pivots.LIWORKis local input and must be at least ifNPROW == NPCOLthenLIWORK = LOCc( N_A + MOD(JA-1, NB_A) ) + NB_A, elseLIWORK = LOCc( N_A + MOD(JA-1, NB_A) ) + MAX( CEIL(CEIL(LOCr(M_A)/MB_A)/(LCM/NPROW)), NB_A )whereLCMis the least common multiple of process rows and columns (NPROWandNPCOL). end if
If LIWORK = -1, then LIWORK is global input and a workspace query is assumed; the routine only calculates the minimum and optimal size for all work arrays. Each of these values is returned in the first entry of the corresponding work array, and no error message is issued by PXERBLA. same energy, different array π
INFOβ (global 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.> 0: IfINFO = K,U(IA+K-1,IA+K-1)is exactly zero; the matrix is singular and its inverse could not be computed.
π¨ bestie listen: ifINFO = K > 0, thenU(IA+K-1,IA+K-1)is exactly zero, the matrix is singular, and its inverse could not be computed. That's not a vibe check you pass, that's a vibe check you fail. π
and that's the whole page, fr fr. this one's from LAPACK version 1.5, dated 12 May 1997 β vintage icon behavior honestly, she's been serving since the 90s and she's still in rotation ππΈ thanks for coming to my ted talk, 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