PDTRTRS(l)
π PDTRTRS(l) β bestie, it's triangular solve o'clock π
okay so, <rainbow>PDTRTRS</rainbow> is a LAPACK auxiliary routine, version 1.5, and she is that girl. She solves a triangular system in distributed-memory land, and honestly? Iconic. Let's go through her whole vibe together, no detail skipped, periodt π«Ά
πΈ NAME πΈ
PDTRTRS β solve a triangular system of the form sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ),
(yes she really does end on a comma, we don't question the queen π)
β¨ SYNOPSIS β¨
SUBROUTINE PDTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, IA, JA, DESCA, B, IB,
JB, DESCB, INFO )
CHARACTER DIAG, TRANS, UPLO
INTEGER IA, IB, INFO, JA, JB, N, NRHS
INTEGER DESCA( * ), DESCB( * )
DOUBLE PRECISION A( * ), B( * )
π PURPOSE π
PDTRTRS solves a triangular system of the form
where sub( A ) denotes A(IA:IA+N-1,JA:JA+N-1) and is a triangular distributed matrix of order N, and B(IB:IB+N-1,JB:JB+NRHS-1) is an N-by-NRHS distributed matrix denoted by sub( B ). A check is made to verify that sub( A ) is nonsingular. π
π Notes π
okay this next bit is the descriptor 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".
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 π
UPLO(global input)CHARACTERβ tells us which triangle we're working with, bestie:= 'U':sub( A )is upper triangular;= 'L':sub( A )is lower triangular.
TRANS(global input)CHARACTERβ specifies the form of the system of equations:= 'N': Solvesub( A ) * X = sub( B )(No transpose)= 'T': Solvesub( A )**T * X = sub( B )(Transpose)= 'C': Solvesub( A )**T * X = sub( B )(Transpose)
DIAG(global input)CHARACTERβ is the diagonal doing its own thing or nah:= 'N':sub( A )is non-unit triangular;= 'U':sub( A )is unit triangular.
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 matrixsub( B ).NRHS >= 0.A(local input)DOUBLE PRECISIONpointer into the local memory to an array of dimension(LLD_A,LOCc(JA+N-1)). This array contains the local pieces of the distributed triangular matrixsub( A ). IfUPLO = 'U', the leadingN-by-Nupper triangular part ofsub( A )contains the upper triangular matrix, and the strictly lower triangular part ofsub( A )is not referenced. IfUPLO = 'L', the leadingN-by-Nlower triangular part ofsub( A )contains the lower triangular matrix, and the strictly upper triangular part ofsub( A )is not referenced. IfDIAG = 'U', the diagonal elements ofsub( A )are also not referenced and are assumed to be1.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.B(local input/local output)DOUBLE PRECISIONpointer into the local memory to an array of dimension(LLD_B,LOCc(JB+NRHS-1)). On entry, this array contains the local pieces of the right hand side distributed matrixsub( B ). On exit, ifINFO = 0,sub( B )is overwritten by the solution matrixX. β¨ she's a glow-up, the answer replaces the question β¨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(output)INTEGERβ the vibe check report:= 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-th diagonal element ofsub( A )is zero, indicating that the submatrix is singular and the solutionsXhave not been computed.
π¨ not me warning you but: ifINFO > 0, yoursub( A )is singular and the solutionsXwere not computed. do not go looking for answers inB. they are not there.Xsaid "no thoughts, head empty" π
that's the whole page bestie, every flag, every index, every descriptor entry, all of it, fr fr π¦
signed off in style: this was LAPACK version 1.5, dated 12 May 1997. old money, still slaying π
π¦ 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