PCGETRS(l)
π PCGETRS(l) π
okay so bestie, welcome to PCGETRS, straight outta section l of the manual. it solves 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 PCGETRF. and yes she's iconic, she's giving linear algebra main character energy. π¦
β¨ NAME β¨
PCGETRS β 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 PCGETRF. periodt. π
πΈ SYNOPSIS πΈ
SUBROUTINE PCGETRS( 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( * )
COMPLEX A( * ), B( * )
no cap, that's the whole vibe right there. π
π PURPOSE π
PCGETRS solves a system of distributed linear equations. sub( A ) denotes A(IA:IA+N-1,JA:JA+N-1), op( A ) = A, A**T or A**H and sub( B ) denotes B(IB:IB+N-1,JB:JB+NRHS-1).
π§ Notes
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".
ok so here's the little legend, and it is so important, do not skip it:
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 array A.N_A(global) β stored inDESCA( N_ ). The number of columns in the global array A.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 array A is distributed.CSRC_A(global) β stored inDESCA( CSRC_ ). The process column over which the first column of the array A is 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
β οΈ bestie listen β this routine requires square block data decomposition ( MB_A=NB_A ). it's not optional, it's the law. π
π₯ 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 )**H * X = sub( B )(Conjugate 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)COMPLEXpointer 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 factors L and U from the factorizationsub( A ) = P*L*U; the unit diagonal elements of L are not stored. πIAβ (global input)INTEGER. The row index in the global array A indicating the first row ofsub( A ).JAβ (global input)INTEGER. The column index in the global array A indicating the first column ofsub( A ).DESCAβ (global and local input)INTEGERarray of dimensionDLEN_. The array descriptor for the distributed matrix A.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 matrix A.Bβ (local input/local output)COMPLEXpointer 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 matrix X. πIBβ (global input)INTEGER. The row index in the global array B indicating the first row ofsub( B ).JBβ (global input)INTEGER. The column index in the global array B indicating the first column ofsub( B ).DESCBβ (global and local input)INTEGERarray of dimensionDLEN_. The array descriptor for the distributed matrix B.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.
and that's the whole page, bestie!! π«Ά this lil legend came to you from LAPACK version 1.5, dated 12 May 1997 β yeah she's vintage, she's an heirloom, and she still eats. 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