PZGERFS(l)
π PZGERFS β the LAPACK glow-up page π
okay bestie, so this is PZGERFS, a LAPACK routine, and yes it's from the l manual section (that's the parallel/l-series, iykyk). It's version 1.5, and it is so much more chill than its name suggests. Sit down, hydrate, let's go. π«Ά
β¨ NAME β¨
PZGERFS improves the computed solution to a system of linear equations, and hands you error bounds plus backward error estimates for those solutions. That's it, that's the job. π
π¦ SYNOPSIS π¦
SUBROUTINE PZGERFS( TRANS, N, NRHS, A, IA, JA, DESCA, AF, IAF, JAF,
DESCAF, IPIV, B, IB, JB, DESCB, X, IX, JX, DESCX,
FERR, BERR, WORK, LWORK, RWORK, LRWORK, INFO )
CHARACTER TRANS
INTEGER IA, IAF, IB, IX, INFO, JA, JAF, JB, JX, LRWORK,
LWORK, N, NRHS
INTEGER DESCA( * ), DESCAF( * ), DESCB( * ), DESCX( * ),
IPIV( * )
DOUBLE PRECISION BERR( * ), FERR( * ), RWORK( * )
COMPLEX*16 A( * ), AF( * ), B( * ), WORK( * ), X( * )
πΈ PURPOSE πΈ
PZGERFS improves the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions. iconic behaviour honestly π
π Notes π
Every 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
In the following comments, sub( A ), sub( X ) and sub( B ) denote respectively A(IA:IA+N-1,JA:JA+N-1), X(IX:IX+N-1,JX:JX+NRHS-1) and B(IB:IB+N-1,JB:JB+NRHS-1). π
π ARGUMENTS π
TRANS(global input) CHARACTER1* β specifies the form of the system of equations.
= 'N': sub( A ) * sub( X ) = sub( B ) (No transpose)
= 'T': sub( A )**T * sub( X ) = sub( B ) (Transpose)
= 'C': sub( A )**H * sub( X ) = sub( B ) (Conjugate transpose)
N(global input) INTEGER β the order of the matrixsub( A ).N >= 0.NRHS(global input) INTEGER β the number of right hand sides, i.e., the number of columns of the matricessub( B )andsub( X ).NRHS >= 0.A(local input) COMPLEX16 pointer into the local memory to an array of local dimension(LLD_A,LOCc(JA+N-1)).* β this array contains the local pieces of the distributed matrixsub( A ).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) INTEGER array of dimensionDLEN_. β the array descriptor for the distributed matrixA.AF(local input) COMPLEX16 pointer into the local memory to an array of local dimension(LLD_AF,LOCc(JA+N-1)).* β this array contains the local pieces of the distributed factors of the matrixsub( A ) = P * L * Uas computed byPZGETRF.IAF(global input) INTEGER β the row index in the global arrayAFindicating the first row ofsub( AF ).JAF(global input) INTEGER β the column index in the global arrayAFindicating the first column ofsub( AF ).DESCAF(global and local input) INTEGER array of dimensionDLEN_. β the array descriptor for the distributed matrixAF.IPIV(local input) INTEGER array of dimensionLOCr(M_AF)+MB_AF. β this array contains the pivoting information as computed byPZGETRF.IPIV(i)-> The global row local rowiwas swapped with. This array is tied to the distributed matrixA.B(local input) COMPLEX16 pointer into the local memory to an array of local dimension(LLD_B,LOCc(JB+NRHS-1)).* β this array contains the local pieces of the distributed matrix of right hand sidessub( B ).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) INTEGER array of dimensionDLEN_. β the array descriptor for the distributed matrixB.X(local input and output) COMPLEX16 pointer into the local memory to an array of local dimension(LLD_X,LOCc(JX+NRHS-1)).* β on entry, this array contains the local pieces of the distributed matrix solutionsub( X ). On exit, the improved solution vectors. β¨IX(global input) INTEGER β the row index in the global arrayXindicating the first row ofsub( X ).JX(global input) INTEGER β the column index in the global arrayXindicating the first column ofsub( X ).DESCX(global and local input) INTEGER array of dimensionDLEN_. β the array descriptor for the distributed matrixX.FERR(local output) DOUBLE PRECISION array of local dimensionLOCc(JB+NRHS-1). β the estimated forward error bound for each solution vector ofsub( X ). IfXTRUEis the true solution corresponding tosub( X ),FERRis an estimated upper bound for the magnitude of the largest element in(sub( X ) - XTRUE)divided by the magnitude of the largest element insub( X ). The estimate is as reliable as the estimate forRCOND, and is almost always a slight overestimate of the true error. This array is tied to the distributed matrixX.BERR(local output) DOUBLE PRECISION array of local dimensionLOCc(JB+NRHS-1). β the componentwise relative backward error of each solution vector (i.e., the smallest relative change in any entry ofsub( A )orsub( B )that makessub( X )an exact solution). This array is tied to the distributed matrixX.WORK(local workspace/local output) COMPLEX16 array, dimension(LWORK)* β on exit,WORK(1)returns the minimal and optimalLWORK.LWORK(local or global input) INTEGER β the dimension of the arrayWORK.LWORKis local input and must be at least
LWORK >= 2*LOCr( N + MOD(IA-1,MB_A) )
If LWORK = -1, then LWORK is global input and a workspace query is assumed; the routine only calculates the minimum and optimal size for all work arrays. Each of these values is returned in the first entry of the corresponding work array, and no error message is issued by PXERBLA.
RWORK(local workspace/local output) DOUBLE PRECISION array, dimension(LRWORK)β on exit,RWORK(1)returns the minimal and optimalLRWORK.LRWORK(local or global input) INTEGER β the dimension of the arrayRWORK.LRWORKis local input and must be at least
LRWORK >= LOCr( N + MOD(IB-1,MB_B) ).
If LRWORK = -1, then LRWORK is global input and a workspace query is assumed; the routine only calculates the minimum and optimal size for all work arrays. Each of these values is returned in the first entry of the corresponding work array, and no error message is issued by PXERBLA.
INFO(global 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, then INFO = -(i*100+j), if the i-th argument is a
scalar and had an illegal value, then INFO = -i.
π PARAMETERS π
ITMAX is the maximum number of steps of iterative refinement. π§
π« Notes π«
This routine temporarily returns when N <= 1. (not me getting out of bed for one single element π)
The distributed submatrices op( A ) and op( AF ) (respectively sub( X ) and sub( B )) should be distributed the same way on the same processes. These conditions ensure that sub( A ) and sub( AF ) (resp. sub( X ) and sub( B )) are "perfectly" aligned. π«Ά
Moreover, this routine requires the distributed submatrices sub( A ), sub( AF ), sub( X ), and sub( B ) to be aligned on a block boundary, i.e., if f(x,y) = MOD( x-1, y ):
f( IA, DESCA( MB_ ) ) = f( JA, DESCA( NB_ ) ) = 0,
f( IAF, DESCAF( MB_ ) ) = f( JAF, DESCAF( NB_ ) ) = 0,
f( IB, DESCB( MB_ ) ) = f( JB, DESCB( NB_ ) ) = 0, and
f( IX, DESCX( MB_ ) ) = f( JX, DESCX( NB_ ) ) = 0.
bestie this alignment thing is NOT optional. if your blocks aren't lined up it is over for you. π
okay that's the whole page, you ate it, you understood it, main character energy fr fr. This was LAPACK version 1.5, dated 12 May 1997 β yes, she's vintage, she's timeless, she's a classic. πβ¨π
π¦ 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