PCHETD2(l)
PCHETD2 π
okay bestie, gather round, because today we're talking about a LAPACK auxiliary routine from the ScaLAPACK corner of the world. It's called PCHETD2, and what it does is reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation. That's the whole vibe. Parallel. Distributed. Hermitian. Tridiagonal. Iconic.
β¨ SYNOPSIS β¨
SUBROUTINE PCHETD2( UPLO, N, A, IA, JA, DESCA, D, E, TAU, WORK, LWORK,
INFO )
CHARACTER UPLO
INTEGER IA, INFO, JA, LWORK, N
INTEGER DESCA( * )
REAL D( * ), E( * )
COMPLEX A( * ), TAU( * ), WORK( * )
like. look at her. she's serving signature. π
π PURPOSE π
PCHETD2 reduces a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation:
Q' * sub( A ) * Q = T
where sub( A ) = A(IA:IA+N-1,JA:JA+N-1).
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".
okay so here's the little legend, and I need you to actually read it because it's the whole key to the kingdom π:
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 ofKthat a process would receive ifKwere distributed over thepprocesses of its process column.- Similarly,
LOCc( K )denotes the number of elements ofKthat a process would receive ifKwere distributed over theqprocesses 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 π
UPLOβ (global input)CHARACTER. Specifies whether the upper or lower triangular part of the Hermitian matrixsub( A )is stored:= 'U': Upper triangular= 'L': Lower triangular
Nβ (global input)INTEGER. The number of rows and columns to be operated on, i.e. the order 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, this array contains the local pieces of the Hermitian distributed matrixsub( A ). IfUPLO = 'U', the leadingN-by-Nupper triangular part ofsub( A )contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. IfUPLO = 'L', the leadingN-by-Nlower triangular part ofsub( A )contains the lower triangular part of the matrix, and its strictly upper triangular part is not referenced.
On exit, if UPLO = 'U', the diagonal and first superdiagonal of sub( A ) are overwritten by the corresponding elements of the tridiagonal matrix T, and the elements above the first superdiagonal, with the array TAU, represent the unitary matrix Q as a product of elementary reflectors; if UPLO = 'L', the diagonal and first subdiagonal of sub( A ) are overwritten by the corresponding elements of the tridiagonal matrix T, and the elements below the first subdiagonal, with the array TAU, represent the unitary matrix Q as 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.Dβ (local output)REALarray, dimensionLOCc(JA+N-1). The diagonal elements of the tridiagonal matrixT:D(i) = A(i,i).Dis tied to the distributed matrixA.Eβ (local output)REALarray, dimensionLOCc(JA+N-1)ifUPLO = 'U',LOCc(JA+N-2)otherwise. The off-diagonal elements of the tridiagonal matrixT:E(i) = A(i,i+1)ifUPLO = 'U',E(i) = A(i+1,i)ifUPLO = 'L'.Eis tied to the distributed matrixA.TAUβ (local output)COMPLEX, array, dimensionLOCc(JA+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 leastLWORK >= 3*N.
π¨ 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. so cute, so efficient.
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 π¦
If UPLO = 'U', the matrix Q is represented as a product of elementary reflectors
Q = H(n-1) . . . H(2) H(1).
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(i+1:n) = 0 and v(i) = 1; v(1:i-1) is stored on exit in A(ia:ia+i-2,ja+i), and tau in TAU(ja+i-1).
If UPLO = 'L', the matrix Q is represented as a product of elementary reflectors
Q = H(1) H(2) . . . H(n-1).
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) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in A(ia+i+1:ia+n-1,ja+i-1), and tau in TAU(ja+i-1).
The contents of sub( A ) on exit are illustrated by the following examples with n = 5:
if UPLO = 'U': if UPLO = 'L':
( d e v2 v3 v4 ) ( d )
( d e v3 v4 ) ( e d )
( d e v4 ) ( v1 e d )
( d e ) ( v1 v2 e d )
( d ) ( v1 v2 v3 e d )
where d and e denote diagonal and off-diagonal elements of T, and vi denotes an element of the vector defining H(i).
Alignment requirements
The distributed submatrix sub( A ) must verify some alignment properties, namely the following expression should be true:
( MB_A.EQ.NB_A .AND. IROFFA.EQ.ICOFFA )
with
IROFFA = MOD( IA-1, MB_A ) and ICOFFA = MOD( JA-1, NB_A ).
πΈ bestie do not skip this one. if the alignment doesn't line up, the vibe check fails, and the vibe check failing here means your distributed matrix is simply not going to cooperate.
okay that's the whole page, mwah π β this was <b>LAPACK version 1.5</b>, dated <b>12 May 1997</b>, and yes she's been slaying since before some of us were born. 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