PDGETRS(l)
β¨ PDGETRS β¨
okay bestie, listen up β this is PDGETRS, a LAPACK routine (version 1.5), and it's literally here to 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 PDGETRF. no cap, that's the whole vibe π
π¦ NAME π¦
PDGETRS β 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 PDGETRF
πΈ SYNOPSIS πΈ
SUBROUTINE PDGETRS( 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( * )
DOUBLE PRECISION A( * ), B( * )
π PURPOSE π
PDGETRS 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 π
okay so this part is giving "read me before you touch anything" energy, and fr fr you need it π«Ά
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".
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 gridAis 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
This routine requires square block data decomposition ( MB_A=NB_A ). that one's not optional bestie, it's literally a requirement π
π 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)DOUBLE PRECISIONpointer 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 rowiwas swapped with. This array is tied to the distributed matrixA.Bβ (local input/local output)DOUBLE PRECISIONpointer 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. so like, your B is gone-gone after this, she's X now π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.= 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.
vibe check: INFO = 0 means you ate and left no crumbs. anything negative means an argument showed up wrong and you gotta go fix her π
and that's the whole page bestie!! this was LAPACK version 1.5, dated 12 May 1997 β yeah she's an oldie but she's iconic, main character energy since the 90s ππ go forth and solve those distributed systems, ily, bye!! ππ¦π
π¦ 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