PSPOCON(l)

πŸ“¦ version 1.5, in ubuntu jammy

πŸ’– PSPOCON(l) πŸ’–

okay bestie, gather round, because this is the LAPACK routine PSPOCON from LAPACK version 1.5 and she is booked and busy estimating condition numbers. no cap, she's literally the vibe check for your Cholesky factorization. let's get into it πŸ¦‹


✨ NAME ✨

PSPOCON β€” estimates the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite distributed matrix, using the Cholesky factorization A = U**T*U or A = L*L**T computed by PSPOTRF. periodt πŸ’…


🌸 SYNOPSIS 🌸

SUBROUTINE PSPOCON( UPLO, N, A, IA, JA, DESCA, ANORM, RCOND, WORK,
                    LWORK, IWORK, LIWORK, INFO )

    CHARACTER       UPLO

    INTEGER         IA, INFO, JA, LIWORK, LWORK, N

    REAL            ANORM, RCOND

    INTEGER         DESCA( * ), IWORK( * )

    REAL            A( * ), WORK( * )

πŸ‘‘ PURPOSE πŸ‘‘

PSPOCON estimates the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite distributed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by PSPOTRF.

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.

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".

ok so here's the tea on what lives where, bestie β€” every single field, no skips:

  • DTYPE_A(global) β€” stored in DESCA( DTYPE_ ) β€” the descriptor type. In this case, DTYPE_A = 1.
  • CTXT_A (global) β€” stored in DESCA( 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 in DESCA( M_ ) β€” the number of rows in the global array A.
  • N_A (global) β€” stored in DESCA( N_ ) β€” the number of columns in the global array A.
  • MB_A (global) β€” stored in DESCA( MB_ ) β€” the blocking factor used to distribute the rows of the array.
  • NB_A (global) β€” stored in DESCA( NB_ ) β€” the blocking factor used to distribute the columns of the array.
  • RSRC_A (global) β€” stored in DESCA( RSRC_ ) β€” the process row over which the first row of the array A is distributed.
  • CSRC_A (global) β€” stored in DESCA( CSRC_ ) β€” the process column over which the first column of the array A is distributed.
  • LLD_A (local) β€” stored in DESCA( 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 πŸ’…

  • UPLO β€” (global input) CHARACTER. Specifies whether the factor stored in A(IA:IA+N-1,JA:JA+N-1) is upper or lower triangular.
    • = 'U': Upper triangular
    • = 'L': Lower triangular
  • N β€” (global input) INTEGER. The order of the distributed matrix A(IA:IA+N-1,JA:JA+N-1). N >= 0.
  • A β€” (local input) REAL pointer 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 factors L or U from the Cholesky factorization A(IA:IA+N-1,JA:JA+N-1) = U'*U or L*L', as computed by PSPOTRF.
  • IA β€” (global input) INTEGER. The row index in the global array A indicating the first row of sub( A ).
  • JA β€” (global input) INTEGER. The column index in the global array A indicating the first column of sub( A ).
  • DESCA β€” (global and local input) INTEGER array of dimension DLEN_. The array descriptor for the distributed matrix A.
  • ANORM β€” (global input) REAL. The 1-norm (or infinity-norm) of the symmetric distributed matrix A(IA:IA+N-1,JA:JA+N-1).
  • RCOND β€” (global output) REAL. The reciprocal of the condition number of the distributed matrix A(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) REAL array, dimension (LWORK). On exit, WORK(1) returns the minimal and optimal LWORK.
  • LWORK β€” (local or global input) INTEGER. The dimension of the array WORK. LWORK is local input and must be at least
LWORK >= 2*LOCr(N+MOD(IA-1,MB_A)) +
         2*LOCc(N+MOD(JA-1,NB_A)) + MAX( 2,
         MAX(NB_A*CEIL(NPROW-1,NPCOL),LOCc(N+MOD(JA-1,NB_A)) +
         NB_A*CEIL(NPCOL-1,NPROW)) ).

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.

  • IWORK β€” (local workspace/local output) INTEGER array, dimension (LIWORK). On exit, IWORK(1) returns the minimal and optimal LIWORK.
  • LIWORK β€” (local or global input) INTEGER. The dimension of the array IWORK. LIWORK is local input and must be at least
LIWORK >= LOCr(N+MOD(IA-1,MB_A)).

If LIWORK = -1, then LIWORK 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.
    • = 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.
🫢 heads up bestie: LWORK = -1 and LIWORK = -1 flip these into global input workspace-query mode, and PXERBLA stays quiet in that case. not a bug, it's a feature πŸ’–

and that's the whole page, no crumbs left, fr fr 🌈✨

LAPACK version 1.5 Β· 12 May 1997 β€” yeah she's an old icon but she still ate πŸ’…πŸ‘‘ mwah, love u, go estimate those condition numbers πŸ¦‹πŸ’–

πŸ“¦ where this page comes from