PCGELQ2(l)
π PCGELQ2 π (the l manual, bestie β LAPACK routine, version 1.5, she's an icon)
okay so. sit down, grab a strawberry π, because we're doing LAPACK today and honestly? she's serving.
πΈ NAME πΈ
PCGELQ2 β she computes an LQ factorization of a complex distributed M-by-N matrix, literally:
sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q
no cap. that's the whole job. π
β¨ SYNOPSIS β¨
SUBROUTINE PCGELQ2( M, N, A, IA, JA, DESCA, TAU, WORK, LWORK, INFO )
INTEGER IA, INFO, JA, LWORK, M, N
INTEGER DESCA( * )
COMPLEX A( * ), TAU( * ), WORK( * )
look at her. ten arguments, zero notes, all business. π
π PURPOSE π
PCGELQ2 computes a LQ factorization of a complex distributed M-by-N matrix
sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q.
π Notes π
Every global data object gets described by an associated description vector. This vector stores the info you need 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".
The whole notation table, but make it a list because we're not doing tables in here:
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
bestie if you skim the NUMROC math I will find out. π
π ARGUMENTS π
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) COMPLEX pointer 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 below the diagonal ofsub( A )contain the M by min(M,N) lower trapezoidal matrixL(Lis lower triangular ifM <= N); the elements above 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) INTEGER array of dimensionDLEN_. The array descriptor for the distributed matrixA.TAUβ (local output) COMPLEX, array, dimensionLOCr(IA+MIN(M,N)-1). This array contains the scalar factors of the elementary reflectors.TAUis tied to the distributed matrixA.WORKβ (local workspace/local output) COMPLEX array, 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 >= Nq0 + MAX( 1, Mp0 ), where
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 ),
and NUMROC, INDXG2P are ScaLAPACK tool functions; MYROW, MYCOL, NPROW and NPCOL can be determined by calling the subroutine BLACS_GRIDINFO.
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.
INFOβ (local 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.
π¦ FURTHER DETAILS π¦
The matrix Q is represented as a product of elementary reflectors
Q = H(ia+k-1)' H(ia+k-2)' . . . H(ia)', where k = min(m,n).
Each H(i) has the form
H(i) = 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; conjg(v(i+1:n)) is stored on exit in A(ia+i-1,ja+i:ja+n-1), and tau in TAU(ia+i-1).
not me explaining reflectors like it's a group chat. it's giving numerical linear algebra AND main character energy. π
and that's the whole page, bestie β no notes left behind, every flag, every bound, every LOCr where it belongs. π«Ά
this was PCGELQ2(l) from the LAPACK routine manual, LAPACK version 1.5, dated 12 May 1997. iconic behavior honestly. go forth and factor. πβ¨
π¦ 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