PSGETRS(l)
π PSGETRS π
okay bestie, welcome to PSGETRS from the LAPACK fam, routine version 1.5, sitting pretty in section l of the manual. she solves distributed linear systems and she does it flawlessly β let's get into it β¨
β¨ NAME β¨
PSGETRS β solve a system of distributed linear equations op( sub( A ) ) * X = sub( B ) with a general N-by-N distributed matrix sub( A ) using the LU factorization computed by PSGETRF. π«Ά
πΈ SYNOPSIS πΈ
SUBROUTINE PSGETRS( TRANS, N, NRHS, A, IA, JA, DESCA, IPIV, B, IB, JB,
DESCB, INFO )
CHARACTER TRANS
INTEGER IA, IB, INFO, JA, JB, N, NRHS
INTEGER DESCA( * ), DESCB( * ), IPIV( * )
REAL A( * ), B( * )
like... look at her. no cap, that's the whole signature. π
π¦ PURPOSE π¦
PSGETRS solves a system of distributed linear equations where sub( A ) denotes A(IA:IA+N-1,JA:JA+N-1), op( A ) = A or A**T, and sub( B ) denotes B(IB:IB+N-1,JB:JB+NRHS-1). β¨
π 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. 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".
NOTATION STORED IN EXPLANATION
--------------- -------------- --------------------------------------
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 distribu-
ted over. The context itself is glo-
bal, but the handle (the integer
value) may vary.
M_A (global) DESCA( M_ ) The number of rows in the global
array A.
N_A (global) DESCA( N_ ) The number of columns in the global
array A.
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 array A is distributed.
CSRC_A (global) DESCA( CSRC_ ) The process column over which the
first column of the array A is
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
π heads up bestie: this routine requires square block data decomposition (MB_A=NB_A). not optional, that's the vibe check.
π ARGUMENTS π
TRANSβ (global input)CHARACTER. specifies the form of the system of equations:= 'N': sub( A ) * X = sub( B ) (No transpose)= 'T': sub( A )**T * X = sub( B ) (Transpose)= 'C': sub( A )**T * X = sub( B ) (Transpose)
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.NRHSβ (global input)INTEGER. the number of right hand sides, i.e., the number of columns of the distributed submatrixsub( B ).NRHS >= 0.Aβ (local input)REALpointer into the local memory to an array of dimension(LLD_A, LOCc(JA+N-1)). on entry, this array contains the local pieces of the factorsLandUfrom the factorizationsub( A ) = P*L*U; the unit diagonal elements ofLare not stored. π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, dimension( LOCr(M_A)+MB_A ). this array contains the pivoting information.IPIV(i) -> The global row local row i was swapped with.this array is tied to the distributed matrixA.Bβ (local input/local output)REALpointer into the local memory to an array of dimension(LLD_B,LOCc(JB+NRHS-1)). on entry, the right hand sidessub( B ). on exit,sub( B )is overwritten by the solution distributed matrixX. β¨ main character transformation honestly.IBβ (global input)INTEGER. the row index in the global arrayBindicating the first row ofsub( B ).JBβ (global input)INTEGER. the column index in the global arrayBindicating the first column ofsub( B ).DESCBβ (global and local input)INTEGERarray of dimensionDLEN_. the array descriptor for the distributed matrixB.INFOβ (global 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.
and that's the whole page, bestie π this was LAPACK version 1.5, dated 12 May 1997 β iconic behavior, truly a classic. 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