PZLATRD(l)
πΈ PZLATRD(l) β bestie edition π
okay so this is a LAPACK auxiliary routine, manual page PZLATRD(l), and it is lowkey doing the most: it takes NB rows and columns of a complex Hermitian distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduces them to complex tridiagonal form via a unitary similarity transformation Q' * sub( A ) * Q, and then hands you back the matrices V and W you need to apply that transformation to the unreduced part of sub( A ). she's giving workhorse, she's giving backstage crew, and honestly? iconic. π
β¨ NAME β¨
PZLATRD β reduce NB rows and columns of a complex Hermitian distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) to complex tridiagonal form by an unitary similarity transformation Q' * sub( A ) * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of sub( A ). π¦
π«Ά SYNOPSIS π«Ά
SUBROUTINE PZLATRD( UPLO, N, NB, A, IA, JA, DESCA, D, E, TAU, W, IW, JW,
DESCW, WORK )
CHARACTER UPLO
INTEGER IA, IW, JA, JW, N, NB
INTEGER DESCA( * ), DESCW( * )
DOUBLE PRECISION D( * ), E( * )
COMPLEX*16 A( * ), TAU( * ), W( * ), WORK( * )
π PURPOSE π
so PZLATRD reduces NB rows and columns of a complex Hermitian distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) down to complex tridiagonal form, using a unitary similarity transformation Q' * sub( A ) * Q, and it also gives you back the matrices V and W that you need to apply the transformation to the unreduced part of sub( A ). slay. β¨
- If
UPLO = 'U',PZLATRDreduces the last NB rows and columns of a matrix, of which the upper triangle is supplied; - if
UPLO = 'L',PZLATRDreduces the first NB rows and columns of a matrix, of which the lower triangle is supplied.
this is an auxiliary routine called by PZHETRD. she's the supporting character who is honestly carrying the whole plot. π
π§ Notes π§
every global data object is described by an associated description vector. this vector stores the info required to establish the mapping between an object element and its corresponding process and memory location. no cap.
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 π
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.NBβ (global input)INTEGER. the number of rows and columns to be reduced.Aβ (local input/local output)COMPLEX*16pointer 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 last NB columns have been reduced to tridiagonal form, with the diagonal elements overwriting the diagonal elements ofsub( A ); the elements above the diagonal with the arrayTAU, represent the unitary matrixQas a product of elementary reflectors. ifUPLO = 'L', the first NB columns have been reduced to tridiagonal form, with the diagonal elements overwriting the diagonal elements ofsub( A ); the elements below the diagonal 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.Wβ (local output)COMPLEX*16pointer into the local memory to an array of dimension(LLD_W,NB_W). this array contains the local pieces of the N-by-NB_WmatrixWrequired to update the unreduced part ofsub( A ).IWβ (global input)INTEGER. the row index in the global arrayWindicating the first row ofsub( W ).JWβ (global input)INTEGER. the column index in the global arrayWindicating the first column ofsub( W ).DESCWβ (global and local input)INTEGERarray of dimensionDLEN_. the array descriptor for the distributed matrixW.WORKβ (local workspace)COMPLEX*16array, dimension(NB_A).
π FURTHER DETAILS π
if UPLO = 'U', the matrix Q is represented as a product of elementary reflectors:
Q = H(n) H(n-1) . . . H(n-nb+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:n) = 0 and v(i-1) = 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(nb).
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 elements of the vectors v together form the N-by-NB matrix V which is needed, with W, to apply the transformation to the unreduced part of the matrix, using a Hermitian rank-2k update of the form: sub( A ) := sub( A ) - V*W' - W*V'.
the contents of A on exit are illustrated by the following examples with n = 5 and nb = 2:
if UPLO = 'U': if UPLO = 'L':
( a a a v4 v5 ) ( d )
( a a v4 v5 ) ( 1 d )
( a 1 v5 ) ( v1 1 a )
( d 1 ) ( v1 v2 a a )
( d ) ( v1 v2 a a a )
where d denotes a diagonal element of the reduced matrix, a denotes an element of the original matrix that is unchanged, and vi denotes an element of the vector defining H(i). π
ok bestie that's the whole thing, every flag and every detail, no gatekeeping, fr fr. π«Ά
and that's a wrap! this lil legend lives in LAPACK version 1.5, dated 12 May 1997, and the page itself is PZLATRD(l). mwah. π
β¨π
π¦ 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