PSORMR2(l)
π NAME π
okay so bestie, welcome to PSORMR2(l) β yes the manual name is right there, we're folding it in like a cute lil name tag instead of copying the boring header line. π
PSORMR2 β overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with SIDE = 'L' SIDE = 'R' TRANS = 'N'
periodt. β¨
π SYNOPSIS π
SUBROUTINE PSORMR2( SIDE, TRANS, M, N, K, A, IA, JA, DESCA, TAU, C, IC,
JC, DESCC, WORK, LWORK, INFO )
CHARACTER SIDE, TRANS
INTEGER IA, IC, INFO, JA, JC, K, LWORK, M, N
INTEGER DESCA( * ), DESCC( * )
REAL A( * ), C( * ), TAU( * ), WORK( * )
π― PURPOSE π―
okay so PSORMR2 overwrites the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with TRANS = 'T': Q**T * sub( C ) sub( C ) * Q**T
where Q is a real orthogonal distributed matrix defined as the product of K elementary reflectors
Q = H(1) H(2) . . . H(k)
as returned by PSGERQF. Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. π«
π 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.
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
π£οΈ ARGUMENTS π£οΈ
SIDE(global input)CHARACTERβ which side we're applying Q or Q**T from:= 'L': apply Q or Q**T from the Left;= 'R': apply Q or Q**T from the Right.
TRANS(global input)CHARACTERβ transpose vibe:= 'N': No transpose, apply Q;= 'T': Transpose, apply Q**T.
M(global input)INTEGERβ The number of rows to be operated on i.e the number of rows of the distributed submatrixsub( C ).M >= 0.N(global input)INTEGERβ The number of columns to be operated on i.e the number of columns of the distributed submatrixsub( C ).N >= 0.K(global input)INTEGERβ The number of elementary reflectors whose product defines the matrixQ. IfSIDE = 'L',M >= K >= 0, ifSIDE = 'R',N >= K >= 0.A(local input)REAL pointer into the local memoryβ to an array of dimension(LLD_A,LOCc(JA+M-1))ifSIDE='L', and(LLD_A,LOCc(JA+N-1))ifSIDE='R', whereLLD_A >= MAX(1,LOCr(IA+K-1)); On entry, the i-th row must contain the vector which defines the elementary reflectorH(i),IA <= i <= IA+K-1, as returned byPSGERQFin theKrows of its distributed matrix argumentA(IA:IA+K-1,JA:*).A(IA:IA+K-1,JA:*)is modified by the routine but restored on exit.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 dimension DLEN_.β The array descriptor for the distributed matrixA.TAU(local input)REAL, array, dimension LOCc(IA+K-1).β This array contains the scalar factorsTAU(i)of the elementary reflectorsH(i)as returned byPSGERQF.TAUis tied to the distributed matrixA.C(local input/local output)REAL pointer into the local memoryβ to an array of dimension(LLD_C,LOCc(JC+N-1)). On entry, the local pieces of the distributed matrixsub(C). On exit,sub( C )is overwritten byQ*sub( C )orQ'*sub( C )orsub( C )*Q'orsub( C )*Q.IC(global input)INTEGERβ The row index in the global arrayCindicating the first row ofsub( C ).JC(global input)INTEGERβ The column index in the global arrayCindicating the first column ofsub( C ).DESCC(global and local input)INTEGER array of dimension DLEN_.β The array descriptor for the distributed matrixC.WORK(local workspace/local output)REAL 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 least IfSIDE = 'L',LWORK >= MpC0 + MAX( MAX( 1, NqC0 ), NUMROC( NUMROC( M+IROFFC,MB_A,0,0,NPROW ),MB_A,0,0,LCMP ) );ifSIDE = 'R',LWORK >= NqC0 + MAX( 1, MpC0 );
where LCMP = LCM / NPROW with LCM = ICLM( NPROW, NPCOL ),
IROFFC = MOD( IC-1, MB_C ), ICOFFC = MOD( JC-1, NB_C ), ICROW = INDXG2P( IC, MB_C, MYROW, RSRC_C, NPROW ), ICCOL = INDXG2P( JC, NB_C, MYCOL, CSRC_C, NPCOL ), MpC0 = NUMROC( M+IROFFC, MB_C, MYROW, ICROW, NPROW ), NqC0 = NUMROC( N+ICOFFC, NB_C, MYCOL, ICCOL, NPCOL ),
ILCM, 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.
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.
π§ Alignment requirements π§
The distributed submatrices A(IA:*, JA:*) and C(IC:IC+M-1,JC:JC+N-1) must verify some alignment properties, namely the following expressions should be true:
If SIDE = 'L', ( NB_A.EQ.MB_C .AND. ICOFFA.EQ.IROFFC ) If SIDE = 'R', ( NB_A.EQ.NB_C .AND. ICOFFA.EQ.ICOFFC .AND. IACOL.EQ.ICCOL )
bestie, that's the whole vibe. no cap, every flag, every formula, every lil descriptor stayed exactly where it was. π
mwah π this page is from LAPACK routine version 1.5, dated 12 May 1997, and it's the PSORMR2(l) manual page. periodt. π«Άβ¨
π¦ 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