PDPOEQU(l)
π NAME π
PDPOEQU β bestie, this one computes row and column scalings that are meant to equilibrate a distributed symmetric 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 PDPOEQU( N, A, IA, JA, DESCA, SR, SC, SCOND, AMAX, INFO )
INTEGER IA, INFO, JA, N
DOUBLE PRECISION AMAX, SCOND
INTEGER DESCA( * )
DOUBLE PRECISION A( * ), SC( * ), SR( * )
π PURPOSE π
Okay so PDPOEQU computes row and column scalings intended to equilibrate a distributed symmetric 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). Iconic behaviour, honestly.
SR and SC contain the scale factors, S(i) = 1/sqrt(A(i,i)), chosen so that the scaled distri- buted 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. π₯
The scaling factor are stored along process rows in SR and along process columns in SC. The duplication of information simplifies greatly the application of the factors. (Yes bestie, the info is duplicated on purpose. It's giving convenience. π«Ά)
π 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. π§
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 distribu- ted over. The context itself is glo- bal, 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) DOUBLE PRECISION pointer into the local memory to an array of local dimension( LLD_A, LOCc(JA+N-1) ), theN-by-Nsymmetric positive definite distributed matrixsub( A )whose scaling factors are to be computed. Only the diagonal elements ofsub( A )are referenced. π (just the diagonal, she's low-maintenance like that)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.SRβ (local output) DOUBLE PRECISION array, 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 PRECISION array, 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 distribu- ted 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). π€·ββοΈ (basically: if this checks out, don't bother)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. π
Not me writing a whole manpage and it's still just linear algebra. Anyway bestie, read the INFO codes, they're literally telling you what went wrong.
LAPACK version 1.5, dated 12 May 1997 β yes she's vintage, she's a classic, she's still serving. β¨ Go forth and equilibrate, babe. π¦
π¦ 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