PSPOTRS(l)
π NAME π
okay bestie, welcome to the PSPOTRS(l) page π this one is, like, the solver β it solves a system of linear equations
sub( A ) * X = sub( B )
A(IA:IA+N-1,JA:JA+N-1)*X = B(IB:IB+N-1,JB:JB+NRHS-1)
periodt. π
β¨ SYNOPSIS β¨
SUBROUTINE PSPOTRS( UPLO, N, NRHS, A, IA, JA, DESCA, B, IB, JB, DESCB,
INFO )
CHARACTER UPLO
INTEGER IA, IB, INFO, JA, JB, N, NRHS
INTEGER DESCA( * ), DESCB( * )
REAL A( * ), B( * )
πΈ PURPOSE πΈ
so PSPOTRS solves a system of linear equations, and here's the vibe: sub( A ) means A(IA:IA+N-1,JA:JA+N-1), and it's a N-by-N symmetric positive definite distributed matrix that's already been Cholesky-factored into sub( A ) = U**T*U or L*L**T by PSPOTRF. and sub( B ) means the distributed matrix B(IB:IB+N-1,JB:JB+NRHS-1). it's giving solver energy fr fr β¨
π§ Notes π§
every global data object is described by an associated description vector, and that vector stores all 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. and 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 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)).
now, 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
π¨ important bestie: this routine requires square block decomposition ( MB_A = NB_A ). no cap.
π ARGUMENTS π
UPLO(global input)CHARACTERβ which triangle is living in storage:= 'U': upper triangle ofsub( A )is stored;= 'L': lower triangle ofsub( A )is stored.
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 local memory to an array of dimension(LLD_A, LOCc(JA+N-1)). on entry, this array contains the factorsLorUfrom the Cholesky factorizationsub( A ) = L*L**TorU**T*U, as computed byPSPOTRF. π₯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)REALpointer into the local memory to an array of local dimension(LLD_B,LOCc(JB+NRHS-1)). on entry, this array contains the the local pieces of the right hand sidessub( B ). on exit, this array contains the local pieces of the solution distributed matrixX. β¨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, bestie:= 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, no crumbs left π this was the PSPOTRS(l) moment β LAPACK version 1.5, dated 12 May 1997 πΈ slay, go solve something symmetric positive definite, 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