PZGEBD2(l)
β¨ NAME β¨
okay so PZGEBD2 β reduce 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 B by an unitary transformation. periodt.
π«Ά SYNOPSIS π«Ά
SUBROUTINE PZGEBD2( M, N, A, IA, JA, DESCA, D, E, TAUQ, TAUP, WORK,
LWORK, INFO )
INTEGER IA, INFO, JA, LWORK, M, N
INTEGER DESCA( * )
DOUBLE PRECISION D( * ), E( * )
COMPLEX*16 A( * ), TAUP( * ), TAUQ( * ), WORK( * )
π PURPOSE π
PZGEBD2 reduces 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 B by an unitary transformation: Q' * sub( A ) * P = B.
If M >= N, B is upper bidiagonal; if M < N, B is lower bidiagonal.
π« 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".
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
π 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.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.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 general distributed matrixsub( A ). On exit, ifM >= N, the diagonal and the first superdiagonal ofsub( A )are overwritten with the upper bidiagonal matrix B; the elements below the diagonal, with the arrayTAUQ, represent the unitary matrix Q as a product of elementary reflectors, and the elements above the first superdiagonal, with the arrayTAUP, represent the orthogonal matrix P as a product of elementary reflectors. IfM < N, the diagonal and the first subdiagonal are overwritten with the lower bidiagonal matrix B; the elements below the first subdiagonal, with the arrayTAUQ, represent the unitary matrix Q as a product of elementary reflectors, and the elements above the diagonal, with the arrayTAUP, represent the orthogonal matrix P as a product of elementary reflectors. See Further Details.IAβ (global input)INTEGER. The row index in the global array A indicating the first row ofsub( A ).JAβ (global input)INTEGER. The column index in the global array A indicating the first column ofsub( A ).DESCAβ (global and local input)INTEGERarray of dimensionDLEN_. The array descriptor for the distributed matrix A.Dβ (local output)DOUBLE PRECISIONarray, dimensionLOCc(JA+MIN(M,N)-1)ifM >= N;LOCr(IA+MIN(M,N)-1)otherwise. The distributed diagonal elements of the bidiagonal matrix B:D(i) = A(i,i). D is tied to the distributed matrix A.Eβ (local output)DOUBLE PRECISIONarray, dimensionLOCr(IA+MIN(M,N)-1)ifM >= N;LOCc(JA+MIN(M,N)-2)otherwise. The distributed off-diagonal elements of the bidiagonal distributed matrix B: ifm >= n,E(i) = A(i,i+1)fori = 1,2,...,n-1; ifm < n,E(i) = A(i+1,i)fori = 1,2,...,m-1. E is tied to the distributed matrix A.TAUQβ (local output)COMPLEX*16array dimensionLOCc(JA+MIN(M,N)-1). The scalar factors of the elementary reflectors which represent the unitary matrix Q.TAUQis tied to the distributed matrix A. See Further Details.TAUPβ (local output)COMPLEX*16array, dimensionLOCr(IA+MIN(M,N)-1). The scalar factors of the elementary reflectors which represent the unitary matrix P.TAUPis tied to the distributed matrix A. See Further Details.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 leastLWORK >= MAX( MpA0, NqA0 )
where NB = MB_A = NB_A, IROFFA = MOD( IA-1, NB ) IAROW = INDXG2P( IA, NB, MYROW, RSRC_A, NPROW ), IACOL = INDXG2P( JA, NB, MYCOL, CSRC_A, NPCOL ), MpA0 = NUMROC( M+IROFFA, NB, MYROW, IAROW, NPROW ), NqA0 = NUMROC( N+IROFFA, NB, MYCOL, IACOL, NPCOL ).
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β (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 π₯
The matrices Q and P are represented as products of elementary reflectors:
If m >= n,
Q = H(1) H(2) . . . H(n) and P = G(1) G(2) . . . G(n-1)
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; v(1:i-1) = 0, v(i) = 1, and v(i+1:m) is stored on exit in A(ia+i:ia+m-1,ja+i-1); u(1:i) = 0, u(i+1) = 1, and u(i+2:n) is stored on exit in A(ia+i-1,ja+i+1:ja+n-1); tauq is stored in TAUQ(ja+i-1) and taup in TAUP(ia+i-1).
If m < n,
Q = H(1) H(2) . . . H(m-1) and P = G(1) G(2) . . . G(m)
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; v(1:i) = 0, v(i+1) = 1, and v(i+2: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+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).
The contents of sub( A ) on exit are illustrated by the following examples:
m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n):
( d e u1 u1 u1 ) ( d u1 u1 u1 u1 u1 )
( v1 d e u2 u2 ) ( e d u2 u2 u2 u2 )
( v1 v2 d e u3 ) ( v1 e d u3 u3 u3 )
( v1 v2 v3 d e ) ( v1 v2 e d u4 u4 )
( v1 v2 v3 v4 d ) ( v1 v2 v3 e d u5 )
( v1 v2 v3 v4 v5 )
where d and e denote diagonal and off-diagonal elements of B, vi denotes an element of the vector defining H(i), and ui an element of the vector defining G(i).
π Alignment requirements π
The distributed submatrix sub( A ) must verify some alignment properties, namely the following expressions should be true:
( MB_A.EQ.NB_A .AND. IROFFA.EQ.ICOFFA )
mwah π this page is from LAPACK version 1.5, dated 12 May 1997, and it's the PZGEBD2(l) manual page. 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