PSSYTRD(l)
π PSSYTRD π
okay bestie, sit DOWN, because we're about to talk about a LAPACK routine and it's giving main character energy. this is PSSYTRD from the LAPACK routine collection, version 1.5, and yes she's an icon, yes she's been around since before you were born, and yes she still slays. π
β¨ NAME β¨
PSSYTRD β reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation. that's the whole job, that's the whole vibe. π¦
πΈ SYNOPSIS πΈ
SUBROUTINE PSSYTRD( UPLO, N, A, IA, JA, DESCA, D, E, TAU, WORK, LWORK,
INFO )
CHARACTER UPLO
INTEGER IA, INFO, JA, LWORK, N
INTEGER DESCA( * )
REAL A( * ), D( * ), E( * ), TAU( * ), WORK( * )
look at all those arguments. so many little guys. each one matters, no cap. π
π PURPOSE π
PSSYTRD reduces a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation:
Q' * sub( A ) * Q = T
where sub( A ) = A(IA:IA+N-1,JA:JA+N-1).
like. she takes your big messy symmetric situation and turns it into something tridiagonal. that's a glow-up fr fr. β¨
π Notes
every global data object is 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.
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".
here's the whole notation breakdown, and yes you need all of it, 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 array A.N_A(global) β stored inDESCA( N_ )β the number of columns in the global array A.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 array A is distributed.CSRC_A(global) β stored inDESCA( CSRC_ )β the process column over which the first column of the array A is 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
math girlies rise UP π§
π ARGUMENTS π
UPLOβ (global input)CHARACTER. specifies whether the upper or lower triangular part of the symmetric 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)REALpointer 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 symmetric 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 orthogonal 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 orthogonal matrixQas a product of elementary reflectors. see Further Details. π (yes it's a lot, yes you'll survive)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)REAL, 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)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 >= 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. π (workspace query my beloved)
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.
π₯ 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 real scalar, and v is a real 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 real scalar, and v is a real 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 .AND. IROFFA.EQ.0 )
with
IROFFA = MOD( IA-1, MB_A )
ICOFFA = MOD( JA-1, NB_A )
bestie if you don't satisfy the alignment requirements, do NOT come crying to me. it literally says "should be true". that's a requirement, not a suggestion. π
okay that's the whole page! she's from LAPACK version 1.5, dated 12 May 1997 β a true vintage queen who has been serving tridiagonal realness since the 90s and honestly? still iconic. go forth and reduce. π«Άβ¨ππ
π¦ 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