PDPOTF2(l)
π PDPOTF2 β bestie edition π
okay so this is PDPOTF2(l), a LAPACK routine, and she is that girl: she does the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1). Yes ma'am. π
β¨ NAME β¨
PDPOTF2 β compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1). periodt. π
πΈ SYNOPSIS πΈ
SUBROUTINE PDPOTF2( UPLO, N, A, IA, JA, DESCA, INFO )
CHARACTER UPLO
INTEGER IA, INFO, JA, N
INTEGER DESCA( * )
DOUBLE PRECISION A( * )
π¦ PURPOSE π¦
PDPOTF2 computes the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1).
The factorization has the form
sub( A ) = U' * U , if UPLO = 'U', or
sub( A ) = L * L', if UPLO = 'L',
where U is an upper triangular matrix and L is lower triangular. iconic behavior 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. iykyk.
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 grid A is 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
β οΈ heads up bestie: this routine requiresN <= NB_A-MOD(JA-1, NB_A)and square block decomposition (MB_A = NB_A). no cap, don't fight the requirements, they will win. π
π ARGUMENTS π
UPLOβ (global input)CHARACTER= 'U': Upper triangle ofsub( A )is stored;= 'L': Lower triangle ofsub( A )is stored.
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/local output)DOUBLE PRECISIONpointer into the local memory to an array of dimension(LLD_A, LOCc(JA+N-1)). On entry, this array contains the local pieces of theN-by-Nsymmetric distributed matrixsub( A )to be factored. IfUPLO = 'U', the leadingN-by-Nupper triangular part ofsub( A )contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. IfUPLO = 'L', the leadingN-by-Nlower triangular part ofsub( A )contains the lower triangular part of the distributed matrix, and its strictly upper triangular part is not referenced. On exit, ifUPLO = 'U', the upper triangular part of the distributed matrix contains the Cholesky factorU, ifUPLO = 'L', the lower triangular part of the distributed matrix contains the Cholesky factorL. she literally transforms herself, main character energy. π¦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.INFOβ (local output)INTEGER= 0: successful exit. we love a clean 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, the leading minor of orderK,A(IA:IA+K-1,JA:JA+K-1)is not positive definite, and the factorization could not be completed. π she tried her best.
that's the whole page bestie, you ate it. go factor something positive definite. π«Ά
LAPACK version 1.5 Β· 12 May 1997 Β· mwah, sending you the cutest of sign-offs ππΈπ
π¦ 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