PCGEQPF(l)
π PCGEQPF β¨ (NAME)
ok so bestie, gather round π«Ά the routine we're obsessing over today is PCGEQPF β she's a LAPACK routine and she computes a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1). no cap. iconic behavior honestly π
π SYNOPSIS (the receipts)
SUBROUTINE PCGEQPF( M, N, A, IA, JA, DESCA, IPIV, TAU, WORK, LWORK,
RWORK, LRWORK, INFO )
INTEGER IA, JA, INFO, LRWORK, LWORK, M, N
INTEGER DESCA( * ), IPIV( * )
REAL RWORK( * )
COMPLEX A( * ), TAU( * ), WORK( * )
like look at her. thirteen arguments. she's got range π
πΈ PURPOSE (what she actually does)
PCGEQPF computes a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1):
sub( A ) * P = Q * R.
periodt. that's the whole vibe. π¦
π Notes
Every global data object out here is described by an associated description vector. This vector stores all the info you need to establish the mapping between an object element and its corresponding process and memory location. it's giving β¨ administrative excellence β¨
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 array A.N_A (global)β stored inDESCA( N_ ): the number of columns in the global array A.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 array A is distributed.CSRC_A (global)β stored inDESCA( CSRC_ ): the process column over which the first column of the array A is 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
math but make it fashion π
π₯ ARGUMENTS (meet the cast)
Mβ (global input)INTEGER. The number of rows to be operated on, i.e. the number of rows of the distributed submatrixsub( A ).M >= 0.Nβ (global input)INTEGER. The number of columns to be operated on, i.e. the number of columns of the distributed submatrixsub( A ).N >= 0.Aβ (local input/local output)COMPLEXpointer into the local memory to an array of dimension(LLD_A, LOCc(JA+N-1)). On entry, the local pieces of the M-by-N distributed matrixsub( A )which is to be factored. On exit, the elements on and above the diagonal ofsub( A )contain themin(M,N)byNupper trapezoidal matrixR(Ris upper triangular ifM >= N); the elements below the diagonal, with the arrayTAU, represent the unitary matrixQas a product of elementary reflectors (see Further Details). π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.IPIVβ (local output)INTEGERarray, dimensionLOCc(JA+N-1). On exit, ifIPIV(I) = K, the local i-th column ofsub( A )*Pwas the global K-th column ofsub( A ).IPIVis tied to the distributed matrixA.TAUβ (local output)COMPLEX, array, dimensionLOCc(JA+MIN(M,N)-1). This array contains the scalar factorsTAUof the elementary reflectors.TAUis tied to the distributed matrixA.WORKβ (local workspace/local output)COMPLEXarray, 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 leastLWORK >= MAX(3,Mp0 + Nq0).
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)REALarray, 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 >= LOCc(JA+N-1)+Nq0.
IROFF = MOD( IA-1, MB_A ), ICOFF = MOD( JA-1, NB_A ), IAROW =
INDXG2P( IA, MB_A, MYROW, RSRC_A, NPROW ), IACOL = INDXG2P( JA,
NB_A, MYCOL, CSRC_A, NPCOL ), Mp0 = NUMROC( M+IROFF, MB_A,
MYROW, IAROW, NPROW ), Nq0 = NUMROC( N+ICOFF, NB_A, MYCOL,
IACOL, NPCOL ), LOCc(JA+N-1) = NUMROC( JA+N-1, NB_A, MYCOL,
CSRC_A, NPCOL )
and NUMROC, INDXG2P are ScaLAPACK tool functions; MYROW, MYCOL, NPROW and NPCOL can be determined by calling the subroutine BLACS_GRIDINFO.
If LRWORK = -1, then LRWORK 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, thenINFO = -(i*100+j), if the i-th argument is a scalar and had an illegal value, thenINFO = -i.
ngl the INFO < 0 encoding is lowkey a little unhinged but she's been doing it since forever so we respect her π
π§ FURTHER DETAILS (the lore)
The matrix Q is represented as a product of elementary reflectors
Q = H(1) H(2) . . . H(n)
Each H(i) has the form
H = I - tau * v * v'
where tau is a complex scalar, and v is a complex vector with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(ia+i-1:ia+m-1,ja+i-1).
The matrix P is represented in jpvt as follows: If
jpvt(j) = i
then the jth column of P is the ith canonical unit vector.
like. the canonical unit vector said "I'm the moment" and honestly? she was π
that's the whole page bestie, you ate that reading session, go drink some water ππ
βΏ this has been PCGEQPF(l), from LAPACK version 1.5, dated 12 May 1997 β yeah she's vintage, she's archive-core, she's a classic and we love her βΏ
π¦ 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