PZHETRD(l)
π NAME π
okay so bestie, welcome to PZHETRD (a PZHETRD(l) moment fr fr) β she reduces a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation. that's the whole gig. iconic. π
β¨ SYNOPSIS β¨
SUBROUTINE PZHETRD( UPLO, N, A, IA, JA, DESCA, D, E, TAU, WORK, LWORK,
INFO )
CHARACTER UPLO
INTEGER IA, INFO, JA, LWORK, N
INTEGER DESCA( * )
DOUBLE PRECISION D( * ), E( * )
COMPLEX*16 A( * ), TAU( * ), WORK( * )
πΈ PURPOSE πΈ
so what she actually does: PZHETRD 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). slay. π«Ά
π Notes π
every global data object gets 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 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 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 π
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)COMPLEX*16β pointer 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 leading N-by-N upper triangular part ofsub( A )contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. ifUPLO = 'L', the leading N-by-N lower triangular part ofsub( A )contains the lower triangular part of the matrix, and its strictly upper triangular part is not referenced. on exit, ifUPLO = 'U', the diagonal and first superdiagonal ofsub( A )are overwritten by the corresponding elements of the tridiagonal matrixT, and the elements above the first superdiagonal, with the arrayTAU, represent the unitary matrixQas a product of elementary reflectors; ifUPLO = 'L', the diagonal and first subdiagonal ofsub( A )are overwritten by the corresponding elements of the tridiagonal matrixT, and the elements below the first subdiagonal, 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.D(local output)DOUBLE PRECISIONarray, 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)DOUBLE PRECISIONarray, 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*16, 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)COMPLEX*16array, 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 >= MAX( NB * ( NP +1 ), 3 * NB )
where
NB = MB_A = NB_A,
NP = NUMROC( N, NB, MYROW, IAROW, NPROW ),
IAROW = INDXG2P( IA, NB, MYROW, RSRC_A, NPROW ).
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(global output)INTEGERβ status check, bestie:= 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 β¨
bestie. listen. the distributed submatrix sub( A ) must verify some alignment properties, or we're not doing this. specifically, this expression should be true:
( MB_A.EQ.NB_A .AND. IROFFA.EQ.ICOFFA .AND. IROFFA.EQ.0 )
with
IROFFA = MOD( IA-1, MB_A )
and
ICOFFA = MOD( JA-1, NB_A ).
and that's the whole page, bestie!! π source + version check for the vibe: this is LAPACK version 1.5, dated 12 May 1997 β yes she's vintage, she's still serving, periodt. πβ¨π¦ no cap, go reduce something. ππ
π¦ 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