PSORGRQ(l)
π PSORGRQ β bestie edition π
okay so this is PSORGRQ(l), a LAPACK routine, version 1.5, and she is that girl. Buckle up π
β¨ NAME β¨
PSORGRQ</purgle> β she generates an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N
Q = H(1) H(2)
no cap, that's literally the whole job. π¦
πΈ SYNOPSIS πΈ
SUBROUTINE PSORGRQ( M, N, K, A, IA, JA, DESCA, TAU, WORK, LWORK, INFO )
INTEGER IA, INFO, JA, K, LWORK, M, N
INTEGER DESCA( * )
REAL A( * ), TAU( * ), WORK( * )
π PURPOSE π
PSORGRQ generates an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N
as returned by PSGERQF.
π§ 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. (iykyk β the descriptor is the whole personality of the array.)
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 notation decoder ring, bestie:
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
π ARGUMENTS π
Mβ (global input)INTEGER. The number of rows to be operated on i.e the number of rows of the distributed submatrixQ.M >= 0.Nβ (global input)INTEGER. The number of columns to be operated on i.e the number of columns of the distributed submatrixQ.N >= M >= 0.Kβ (global input)INTEGER. The number of elementary reflectors whose product defines the matrixQ.M >= K >= 0.Aβ (local input/local output)REALpointer into the local memory to an array of dimension(LLD_A,LOCc(JA+N-1)). On entry, the i-th row must contain the vector which defines the elementary reflectorH(i),IA+M-K <= i <= IA+M-1, as returned byPSGERQFin theKrows of its distributed matrix argumentA(IA+M-K:IA+M-1,JA:*). On exit, this array contains the local pieces of the M-by-N distributed matrixQ.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 input)REAL, array, dimensionLOCr(IA+M-1). This array contains the scalar factorsTAU(i)of the elementary reflectorsH(i)as returned byPSGERQF.TAUis tied to the distributed matrixA. (they're a package deal, fr fr π«Ά)WORKβ (local workspace/local output)REALarray, 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 >= MB_A * ( MpA0 + NqA0 + MB_A ), where
IROFFA = MOD( IA-1, MB_A ), ICOFFA = MOD( JA-1, NB_A ), IAROW =
INDXG2P( IA, MB_A, MYROW, RSRC_A, NPROW ), IACOL = INDXG2P( JA,
NB_A, MYCOL, CSRC_A, NPCOL ), MpA0 = NUMROC( M+IROFFA, MB_A,
MYROW, IAROW, NPROW ), NqA0 = NUMROC( N+ICOFFA, NB_A, MYCOL,
IACOL, NPCOL ),
INDXG2P and NUMROC 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. (the classic "just tell me how much room I need" move, obsessed β¨)
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.
Heads up bestie: if INFO comes back negative, something you passed in was illegal. She's not being dramatic, she's being precise. π
that's the whole page, bestie. go forth and orthogonalize responsibly π
LAPACK version 1.5 β 12 May 1997 β yeah she's an icon from another era and she still slays. π π
π¦ 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