PZLABRD(l)
π PZLABRD β the LAPACK auxiliary routine, but make it make sense
okay bestie, sit down, grab a boba, because we're about to talk about PZLABRD, a LAPACK auxiliary routine (that's the l in LAPACK, lowercase energy, it's a helper not a main character). She doesn't do the whole job herself β she's the girl behind the girl. β¨
πΈ NAME πΈ
PZLABRD β reduces the first NB rows and columns of a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form by a unitary transformation Q' * A * P, and hands back the matrices X and Y which are needed to apply the transformation to the unreduced part of sub( A ).
π SYNOPSIS π
SUBROUTINE PZLABRD( M, N, NB, A, IA, JA, DESCA, D, E, TAUQ, TAUP, X, IX,
JX, DESCX, Y, IY, JY, DESCY, WORK )
INTEGER IA, IX, IY, JA, JX, JY, M, N, NB
INTEGER DESCA( * ), DESCX( * ), DESCY( * )
DOUBLE PRECISION D( * ), E( * )
COMPLEX*16 A( * ), TAUP( * ), TAUQ( * ), X( * ), Y( * ), WORK( * )
π PURPOSE π
PZLABRD reduces the first NB rows and columns of a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form by an unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of sub( A ).
If M >= N, sub( A ) is reduced to upper bidiagonal form; if M < N, to lower bidiagonal form.
She is an auxiliary routine, bestie β called by PZGEBRD. She's not the one making the phone call, she's the one who set up the phone call. π«Ά
π¦ 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. 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".
So here's the whole notation tea, one bullet per item:
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 β¨
Mβ (global input) INTEGER. The number of rows to be operated on, i.e. the number of rows of the distributed submatrixsub( A ).M >= 0. no negative row counts, that's not the vibe.Nβ (global input) INTEGER. The number of columns to be operated on, i.e. the number of columns of the distributed submatrixsub( A ).N >= 0.NBβ (global input) INTEGER. The number of leading rows and columns ofsub( A )to be reduced.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 general distributed matrixsub( A )to be reduced. On exit, the firstNBrows and columns of the matrix are overwritten; the rest of the distributed matrixsub( A )is unchanged. Ifm >= n, elements on and below the diagonal in the firstNBcolumns, with the arrayTAUQ, represent the unitary matrixQas a product of elementary reflectors; and elements above the diagonal in the firstNBrows, with the arrayTAUP, represent the unitary matrixPas a product of elementary reflectors. Ifm < n, elements below the diagonal in the firstNBcolumns, with the arrayTAUQ, represent the unitary matrixQas a product of elementary reflectors, and elements on and above the diagonal in the firstNBrows, with the arrayTAUP, represent the unitary matrixPas a product of elementary reflectors. See Further Details below. π«Ά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) INTEGER array of dimensionDLEN_. The array descriptor for the distributed matrixA.Dβ (local output) DOUBLE PRECISION array, dimensionLOCr(IA+MIN(M,N)-1)ifM >= N;LOCc(JA+MIN(M,N)-1)otherwise. The distributed diagonal elements of the bidiagonal matrixB:D(i) = A(ia+i-1,ja+i-1).Dis tied to the distributed matrixA.Eβ (local output) DOUBLE PRECISION array, dimensionLOCr(IA+MIN(M,N)-1)ifM >= N;LOCc(JA+MIN(M,N)-2)otherwise. The distributed off-diagonal elements of the bidiagonal distributed matrixB: ifm >= n,E(i) = A(ia+i-1,ja+i)fori = 1,2,...,n-1; ifm < n,E(i) = A(ia+i,ja+i-1)fori = 1,2,...,m-1.Eis tied to the distributed matrixA.TAUQβ (local output) COMPLEX*16 array dimensionLOCc(JA+MIN(M,N)-1). The scalar factors of the elementary reflectors which represent the unitary matrixQ.TAUQis tied to the distributed matrixA. See Further Details.TAUPβ (local output) COMPLEX*16 array, dimensionLOCr(IA+MIN(M,N)-1). The scalar factors of the elementary reflectors which represent the unitary matrixP.TAUPis tied to the distributed matrixA. See Further Details.Xβ (local output) COMPLEX*16 pointer into the local memory to an array of dimension(LLD_X,NB). On exit, the local pieces of the distributed M-by-NB matrixX(IX:IX+M-1,JX:JX+NB-1)required to update the unreduced part ofsub( A ).IXβ (global input) INTEGER. The row index in the global arrayXindicating the first row ofsub( X ).JXβ (global input) INTEGER. The column index in the global arrayXindicating the first column ofsub( X ).DESCXβ (global and local input) INTEGER array of dimensionDLEN_. The array descriptor for the distributed matrixX.Yβ (local output) COMPLEX*16 pointer into the local memory to an array of dimension(LLD_Y,NB). On exit, the local pieces of the distributed N-by-NB matrixY(IY:IY+N-1,JY:JY+NB-1)required to update the unreduced part ofsub( A ).IYβ (global input) INTEGER. The row index in the global arrayYindicating the first row ofsub( Y ).JYβ (global input) INTEGER. The column index in the global arrayYindicating the first column ofsub( Y ).DESCYβ (global and local input) INTEGER array of dimensionDLEN_. The array descriptor for the distributed matrixY.WORKβ (local workspace) COMPLEX*16 array, dimension(LWORK).LWORK >= NB_A + NQ, with
NQ = NUMROC( N+MOD( IA-1, NB_Y ), NB_Y, MYCOL, IACOL, NPCOL )
IACOL = INDXG2P( JA, NB_A, MYCOL, CSRC_A, NPCOL )
INDXG2P and NUMROC are ScaLAPACK tool functions; MYROW, MYCOL, NPROW and NPCOL can be determined by calling the subroutine BLACS_GRIDINFO. π
π FURTHER DETAILS π
The matrices Q and P are represented as products of elementary reflectors:
Q = H(1) H(2) . . . H(nb) and P = G(1) G(2) . . . G(nb)
Each H(i) and G(i) has the form:
H(i) = I - tauq * v * v' and G(i) = I - taup * u * u'
where tauq and taup are complex scalars, and v and u are complex vectors.
If m >= n, v(1:i-1) = 0, v(i) = 1, and v(i:m) is stored on exit in A(ia+i-1:ia+m-1,ja+i-1); u(1:i) = 0, u(i+1) = 1, and u(i+1:n) is stored on exit in A(ia+i-1,ja+i:ja+n-1); tauq is stored in TAUQ(ja+i-1) and taup in TAUP(ia+i-1).
If m < n, v(1:i) = 0, v(i+1) = 1, and v(i+1:m) is stored on exit in A(ia+i+1:ia+m-1,ja+i-1); u(1:i-1) = 0, u(i) = 1, and u(i:n) is stored on exit in A(ia+i-1,ja+i:ja+n-1); tauq is stored in TAUQ(ja+i-1) and taup in TAUP(ia+i-1).
The elements of the vectors v and u together form the m-by-nb matrix V and the nb-by-n matrix U' which are needed, with X and Y, to apply the transformation to the unreduced part of the matrix, using a block update of the form:
sub( A ) := sub( A ) - V*Y' - X*U'.
The contents of sub( A ) on exit are illustrated by the following examples with nb = 2:
m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n):
( 1 1 u1 u1 u1 ) ( 1 u1 u1 u1 u1 u1 )
( v1 1 1 u2 u2 ) ( 1 1 u2 u2 u2 u2 )
( v1 v2 a a a ) ( v1 1 a a a a )
( v1 v2 a a a ) ( v1 v2 a a a a )
( v1 v2 a a a ) ( v1 v2 a a a a )
( v1 v2 a a a )
where a denotes an element of the original matrix which is unchanged, vi denotes an element of the vector defining H(i), and ui an element of the vector defining G(i). literally the map of who did what. πΊοΈβ¨
LAPACK version 1.5 Β· 12 May 1997
okay that's the whole page, bestie π this iconic little aux routine has been out here since May 1997 and she's still carrying the entire PZGEBRD operation on her back. slay, queen, 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