PDLARFT(l)
β¨ PDLARFT β the manual page, but make it cute β¨
okay bestie, gather round π this is PDLARFT, a LAPACK auxiliary routine, and she is lowkey the backbone of your whole block-reflector situation. (Header vibes: PDLARFT(l), LAPACK auxiliary routine, version 1.5. Yes we're in the LAPACK section, yes it's giving legacy, yes she still slays. π)
π« NAME π«
PDLARFT β form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors.
That's it, that's the whole personality. She builds you a T. π«Ά
πΈ SYNOPSIS πΈ
SUBROUTINE PDLARFT( DIRECT, STOREV, N, K, V, IV, JV, DESCV, TAU, T, WORK
)
CHARACTER DIRECT, STOREV
INTEGER IV, JV, K, N
INTEGER DESCV( * )
DOUBLE PRECISION TAU( * ), T( * ), V( * ), WORK( * )
(yes, the argument list wraps to a second line. she contains multitudes. π )
π¦ PURPOSE π¦
So PDLARFT forms the triangular factor T of a real block reflector H of order n, which β say it with me β is defined as a product of k elementary reflectors. β¨
- If
DIRECT = 'F', thenH = H(1) H(2) . . . H(k)andTis upper triangular. - If
DIRECT = 'B', thenH = H(k) . . . H(2) H(1)andTis lower triangular.
And depending on how the vectors are stored:
- If
STOREV = 'C', the vector which defines the elementary reflectorH(i)is stored in the i-th column of the distributed matrixV, and
H = I - V * T * V'
- If
STOREV = 'R', the vector which defines the elementary reflectorH(i)is stored in the i-th row of the distributed matrixV, and
H = I - V' * T * V
π Notes π
(no fr, read these, they're the lore π§)
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 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 π
the whole squad, one by one, no skipping, we love a complete cast π
DIRECTβ (global input)CHARACTER*1. Specifies the order in which the elementary reflectors are multiplied to form the block reflector:= 'F':H = H(1) H(2) . . . H(k)(Forward)= 'B':H = H(k) . . . H(2) H(1)(Backward)
STOREVβ (global input)CHARACTER*1. Specifies how the vectors which define the elementary reflectors are stored (see also Further Details):= 'R': rowwise
Nβ (global input)INTEGER. The order of the block reflectorH.N >= 0.Kβ (global input)INTEGER. The order of the triangular factorT(= the number of elementary reflectors).1 <= K <= MB_V (= NB_V).Vβ (input/output)DOUBLE PRECISIONpointer into the local memory to an array of local dimension(LOCr(IV+N-1),LOCc(JV+K-1))ifSTOREV = 'C', and(LOCr(IV+K-1),LOCc(JV+N-1))ifSTOREV = 'R'. The distributed matrixVcontains the Householder vectors. See further details.IVβ (global input)INTEGER. The row index in the global arrayVindicating the first row ofsub( V ).JVβ (global input)INTEGER. The column index in the global arrayVindicating the first column ofsub( V ).DESCVβ (global and local input)INTEGERarray of dimensionDLEN_. The array descriptor for the distributed matrixV.TAUβ (local input)DOUBLE PRECISION, array, dimensionLOCr(IV+K-1)ifINCV = M_V, andLOCc(JV+K-1)otherwise. This array contains the Householder scalars related to the Householder vectors.TAUis tied to the distributed matrixV.Tβ (local output)DOUBLE PRECISIONarray, dimension(NB_V,NB_V)ifSTOREV = 'Col', and(MB_V,MB_V)otherwise. It contains thek-by-ktriangular factor of the block reflector associated withV. IfDIRECT = 'F',Tis upper triangular; ifDIRECT = 'B',Tis lower triangular.WORKβ (local workspace)DOUBLE PRECISIONarray, dimension(K*(K-1)/2).
π FURTHER DETAILS π
The shape of the matrix V and the storage of the vectors which define the H(i) is best illustrated by the following example with n = 5 and k = 3. The elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. The rest of the array is not used.
DIRECT = 'F' and STOREV = 'C': DIRECT = 'F' and STOREV = 'R':
V( IV:IV+N-1, ( 1 ) V( IV:IV+K-1, ( 1 v1 v1 v1 v1 )
JV:JV+K-1 ) = ( v1 1 ) JV:JV+N-1 ) = ( 1 v2 v2 v2 )
( v1 v2 1 ) ( 1 v3 v3 )
( v1 v2 v3 )
( v1 v2 v3 )
DIRECT = 'B' and STOREV = 'C': DIRECT = 'B' and STOREV = 'R':
V( IV:IV+N-1, ( v1 v2 v3 ) V( IV:IV+K-1, ( v1 v1 1 )
JV:JV+K-1 ) = ( v1 v2 v3 ) JV:JV+N-1 ) = ( v2 v2 v2 1 )
( 1 v2 v3 ) ( v3 v3 v3 v3 1 )
( 1 v3 )
( 1 )
like, look at her. four whole layouts. iconic behavior. π
π reminder bestie: the 1s in those pictures are not stored β the matching array elements get modified and then restored on exit. The rest of the array is simply not used. Don't go reading ghosts out there.
and that's the page!! π written by the LAPACK squad, version 1.5, dated 12 May 1997 β yes she's vintage, yes she still hits different, no cap. go build your T and eat. π
β¨π¦
π¦ 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