PZGECON(l)
PZGECON π β¨
okay bestie, sit DOWN, because we're doing LAPACK today β specifically PZGECON, a routine from the LAPACK library, version 1.5, and she is that girl. π
β¨ NAME β¨
PZGECON β she estimates the reciprocal of the condition number of a general distributed complex matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PZGETRF. π¦
πΈ SYNOPSIS πΈ
SUBROUTINE PZGECON( NORM, N, A, IA, JA, DESCA, ANORM, RCOND, WORK,
LWORK, RWORK, LRWORK, INFO )
CHARACTER NORM
INTEGER IA, INFO, JA, LRWORK, LWORK, N
DOUBLE PRECISION ANORM, RCOND
INTEGER DESCA( * )
DOUBLE PRECISION RWORK( * )
COMPLEX*16 A( * ), WORK( * )
π PURPOSE π
PZGECON estimates the reciprocal of the condition number of a general distributed complex matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PZGETRF. no cap. π₯
An estimate is obtained for norm(inv(A(IA:IA+N-1,JA:JA+N-1))), and the reciprocal of the condition number is computed as
RCOND = 1 / ( norm( A(IA:IA+N-1,JA:JA+N-1) ) *
norm( inv(A(IA:IA+N-1,JA:JA+N-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. (it's giving β¨infrastructureβ¨)
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". iykyk π
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
π ARGUMENTS π
NORM(global input)CHARACTERβ specifies whether the 1-norm condition number or the infinity-norm condition number is required:= '1' or 'O': 1-norm= 'I': Infinity-norm
N(global input)INTEGERβ the order of the distributed matrixA(IA:IA+N-1,JA:JA+N-1).N >= 0. periodt. πA(local input)COMPLEX*16pointer 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 factorizationA(IA:IA+N-1,JA:JA+N-1) = P*L*U; the unit diagonal elements ofLare not stored. (not them hiding the ones π)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. π«ΆANORM(global input)DOUBLE PRECISIONβ ifNORM = '1'or'O', the 1-norm of the original distributed matrixA(IA:IA+N-1,JA:JA+N-1). IfNORM = 'I', the infinity-norm of the original distributed matrixA(IA:IA+N-1,JA:JA+N-1).RCOND(global output)DOUBLE PRECISIONβ the reciprocal of the condition number of the distributed matrixA(IA:IA+N-1,JA:JA+N-1), computed as
RCOND = 1 / ( norm( A(IA:IA+N-1,JA:JA+N-1) ) *
norm( inv(A(IA:IA+N-1,JA:JA+N-1)) ) ).
WORK(local workspace/local output)COMPLEX*16array, 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)) + MAX( 2,
MAX(NB_A*CEIL(NPROW-1,NPCOL),LOCc(N+MOD(JA-1,NB_A)) +
NB_A*CEIL(NPCOL-1,NPROW)) ).
LOCr and LOCc values can be computed using the ScaLAPACK tool function NUMROC; NPROW and NPCOL can be determined by calling the subroutine BLACS_GRIDINFO. 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 PRECISIONarray, 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 leastLRWORK >= 2*LOCc(N+MOD(JA-1,NB_A)). IfLRWORK = -1, thenLRWORKis 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 byPXERBLA. β¨INFO(global output)INTEGERβ= 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.
bestie, note the negative INFO convention β she's telling you exactly which argument and which entry went off the rails. read the math, don't guess. π
and that's the whole page, no skips, no crumbs left behind π«Ά
this was LAPACK, version 1.5, dated 12 May 1997 β a certified vintage icon ππ slay, stay distributed, and may your RCOND never be zero. π¦β¨
π¦ 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