PZPOEQU(l)
β¨ NAME β¨
PZPOEQU β bestie, this is PZPOEQU(l), and what she does is compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the two-norm). π
π SYNOPSIS π
SUBROUTINE PZPOEQU( N, A, IA, JA, DESCA, SR, SC, SCOND, AMAX, INFO )
INTEGER IA, INFO, JA, N
DOUBLE PRECISION AMAX, SCOND
INTEGER DESCA( * )
DOUBLE PRECISION SC( * ), SR( * )
COMPLEX*16 A( * )
π PURPOSE π
okay so listen π β PZPOEQU computes row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the two-norm). SR and SC hold the scale factors, S(i) = 1/sqrt(A(i,i)), chosen so that the scaled distributed matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has ones on the diagonal. This choice of SR and SC puts the condition number of B within a factor N of the smallest possible condition number over all possible diagonal scalings. iconic, honestly. β¨
The scaling factors are stored along process rows in SR and along process columns in SC. The duplication of that info simplifies the application of the factors so much β it's giving convenience, no cap. π«Ά
π Notes π
Each global data object is described by an associated description vector. That 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
π ARGUMENTS π
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. πA(local input)COMPLEX*16β pointer into the local memory to an array of local dimension( LLD_A, LOCc(JA+N-1) ), theN-by-NHermitian positive definite distributed matrixsub( A )whose scaling factors are to be computed. Only the diagonal elements ofsub( A )are referenced. lowkey efficient of her. π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.SR(local output)DOUBLE PRECISIONarray, dimensionLOCr(M_A)β ifINFO = 0,SR(IA:IA+N-1)contains the row scale factors forsub( A ).SRis aligned with the distributed matrixA, and replicated across every process column.SRis tied to the distributed matrixA. π«SC(local output)DOUBLE PRECISIONarray, dimensionLOCc(N_A)β ifINFO = 0,SC(JA:JA+N-1)contains the column scale factors forA(IA:IA+M-1,JA:JA+N-1).SCis aligned with the distributed matrixA, and replicated down every process row.SCis tied to the distributed matrixA.SCOND(global output)DOUBLE PRECISIONβ ifINFO = 0,SCONDcontains the ratio of the smallestSR(i)(orSC(j)) to the largestSR(i)(orSC(j)), withIA <= i <= IA+N-1andJA <= j <= JA+N-1. IfSCOND >= 0.1andAMAXis neither too large nor too small, it is not worth scaling bySR(orSC). β¨AMAX(global output)DOUBLE PRECISIONβ absolute value of largest matrix element. IfAMAXis very close to overflow or very close to underflow, the matrix should be scaled.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.> 0: ifINFO = K, theK-th diagonal entry ofsub( A )is nonpositive.
heads up bestie: that > 0 case is real β a nonpositive diagonal entry means your matrix is not the Hermitian positive definite queen you thought she was, and there's no scaling that's gonna save it. π
that's the whole page, fr fr β no details left behind, every flag and every LOCr accounted for. mwah π
LAPACK version 1.5 β 12 May 1997 π¦π§ββοΈπ
π¦ 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