PCGEQRF(l)
π PCGEQRF π
okay so bestie, gather round, because this one is a LAPACK routine β LAPACK routine (version 1.5), to be exact β and she is booked and busy doing QR factorizations on distributed matrices. π«Ά
πΈ NAME πΈ
PCGEQRF β she computes a QR factorization of a complex distributed M-by-N matrix, specifically
sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
that's it, that's the job. no cap. π
β¨ SYNOPSIS β¨
SUBROUTINE PCGEQRF( M, N, A, IA, JA, DESCA, TAU, WORK, LWORK, INFO )
INTEGER IA, INFO, JA, LWORK, M, N
INTEGER DESCA( * )
COMPLEX A( * ), TAU( * ), WORK( * )
π¦ PURPOSE π¦
PCGEQRF computes a QR factorization of a complex distributed M-by-N matrix
sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
like. that's her whole personality and honestly? iconic. β¨
π Notes π
Every global data object is 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". π
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 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
π 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)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.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 least
LWORK >= NB_A * ( Mp0 + Nq0 + NB_A )
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. π
bestie listen: ifLWORK = -1, thenLWORKis 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 byPXERBLA. π
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.
π₯ FURTHER DETAILS π₯
The matrix Q is represented as a product of elementary reflectors
Q = H(ja) H(ja+1) . . . H(ja+k-1), where k = min(m,n).
Each H(i) has the form
H(j) = 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:ia+m-1,ja+i-1), and tau in TAU(ja+i-1). π¦
and that's the whole page, bestie β you ate. π β¨
this was LAPACK version 1.5, dated 12 May 1997, so likeβ¦ vintage vintage. she's been serving QR factorizations since before we were born and she's still iconic for it. π mwah, bye π«Άπ
π¦ 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