|
SRC\pcgeql2.f |
|
| #lines: 309 size: 12 Kb creation: 18/01/2006 23:36:04 last modification: 08/05/2008 18:37:42 attribute: ARCH Find Reload | |
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55: 56: 57: 58: 59: 60: 61: 62: 63: 64: 65: 66: 67: 68: 69: 70: 71: 72: 73: 74: 75: 76: 77: 78: 79: 80: 81: 82: 83: 84: 85: 86: 87: 88: 89: 90: 91: 92: 93: 94: 95: 96: 97: 98: 99: 100: 101: 102: 103: 104: 105: 106: 107: 108: 109: 110: 111: 112: 113: 114: 115: 116: 117: 118: 119: 120: 121: 122: 123: 124: 125: 126: 127: 128: 129: 130: 131: 132: 133: 134: 135: 136: 137: 138: 139: 140: 141: 142: 143: 144: 145: 146: 147: 148: 149: 150: 151: 152: 153: 154: 155: 156: 157: 158: 159: 160: 161: 162: 163: 164: 165: 166: 167: 168: 169: 170: 171: 172: 173: 174: 175: 176: 177: 178: 179: 180: 181: 182: 183: 184: 185: 186: 187: 188: 189: 190: 191: 192: 193: 194: 195: 196: 197: 198: 199: 200: 201: 202: 203: 204: 205: 206: 207: 208: 209: 210: 211: 212: 213: 214: 215: 216: 217: 218: 219: 220: 221: 222: 223: 224: 225: 226: 227: 228: 229: 230: 231: 232: 233: 234: 235: 236: 237: 238: 239: 240: 241: 242: 243: 244: 245: 246: 247: 248: 249: 250: 251: 252: 253: 254: 255: 256: 257: 258: 259: 260: 261: 262: 263: 264: 265: 266: 267: 268: 269: 270: 271: 272: 273: 274: 275: 276: 277: 278: 279: 280: 281: 282: 283: 284: 285: 286: 287: 288: 289: 290: 291: 292: 293: 294: 295: 296: 297: 298: 299: 300: 301: 302: 303: 304: 305: 306: 307: 308: 309: |
SUBROUTINE PCGEQL2( M, N, A, IA, JA, DESCA, TAU, WORK, LWORK,
$ INFO )
*
* -- ScaLAPACK routine (version 1.7) --
* University of Tennessee, Knoxville, Oak Ridge National Laboratory,
* and University of California, Berkeley.
* May 25, 2001
*
* .. Scalar Arguments ..
INTEGER IA, INFO, JA, LWORK, M, N
* ..
* .. Array Arguments ..
INTEGER DESCA( * )
COMPLEX A( * ), TAU( * ), WORK( * )
* ..
*
* Purpose
* =======
*
* PCGEQL2 computes a QL factorization of a complex distributed M-by-N
* matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L.
*
* 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".
*
* NOTATION STORED IN EXPLANATION
* --------------- -------------- --------------------------------------
* DTYPE_A(global) DESCA( DTYPE_ )The descriptor type. In this case,
* DTYPE_A = 1.
* CTXT_A (global) DESCA( CTXT_ ) The BLACS context handle, indicating
* the BLACS process grid A is distribu-
* ted over. The context itself is glo-
* bal, but the handle (the integer
* value) may vary.
* M_A (global) DESCA( M_ ) The number of rows in the global
* array A.
* N_A (global) DESCA( N_ ) The number of columns in the global
* array A.
* MB_A (global) DESCA( MB_ ) The blocking factor used to distribute
* the rows of the array.
* NB_A (global) DESCA( NB_ ) The blocking factor used to distribute
* the columns of the array.
* RSRC_A (global) DESCA( RSRC_ ) The process row over which the first
* row of the array A is distributed.
* CSRC_A (global) DESCA( CSRC_ ) The process column over which the
* first column of the array A is
* distributed.
* LLD_A (local) DESCA( 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 submatrix sub( A ). M >= 0.
*
* N (global input) INTEGER
* The number of columns to be operated on, i.e. the number of
* columns of the distributed submatrix sub( A ). N >= 0.
*
* A (local input/local output) COMPLEX pointer into the
* local memory to an array of dimension (LLD_A, LOCc(JA+N-1)).
* On entry, the local pieces of the M-by-N distributed matrix
* sub( A ) which is to be factored. On exit, if M >= N, the
* lower triangle of the distributed submatrix
* A( IA+M-N:IA+M-1, JA:JA+N-1 ) contains the N-by-N lower
* triangular matrix L; if M <= N, the elements on and below
* the (N-M)-th superdiagonal contain the M by N lower
* trapezoidal matrix L; the remaining elements, with the
* array TAU, represent the unitary matrix Q 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 of sub( A ).
*
* JA (global input) INTEGER
* The column index in the global array A indicating the
* first column of sub( A ).
*
* DESCA (global and local input) INTEGER array of dimension DLEN_.
* The array descriptor for the distributed matrix A.
*
* TAU (local output) COMPLEX, array, dimension LOCc(JA+N-1)
* This array contains the scalar factors of the elementary
* reflectors. TAU is tied to the distributed matrix A.
*
* WORK (local workspace/local output) COMPLEX array,
* dimension (LWORK)
* On exit, WORK(1) returns the minimal and optimal LWORK.
*
* LWORK (local or global input) INTEGER
* The dimension of the array WORK.
* LWORK is local input and must be at least
* LWORK >= Mp0 + MAX( 1, Nq0 ), where
*
* IROFF = MOD( IA-1, MB_A ), ICOFF = MOD( JA-1, NB_A ),
* IAROW = INDXG2P( IA, MB_A, MYROW, RSRC_A, NPROW ),
* IACOL = INDXG2P( JA, NB_A, MYCOL, CSRC_A, NPCOL ),
* Mp0 = NUMROC( M+IROFF, MB_A, MYROW, IAROW, NPROW ),
* Nq0 = NUMROC( N+ICOFF, NB_A, MYCOL, IACOL, NPCOL ),
*
* and NUMROC, INDXG2P 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, then INFO = -(i*100+j), if the i-th
* argument is a scalar and had an illegal value, then
* INFO = -i.
*
* Further Details
* ===============
*
* The matrix Q is represented as a product of elementary reflectors
*
* Q = H(ja+k-1) . . . H(ja+1) H(ja), where k = min(m,n).
*
* 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(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
* A(ia:ia+m-k+i-2,ja+n-k+i-1), and tau in TAU(ja+n-k+i-1).
*
* =====================================================================
*
* .. Parameters ..
INTEGER BLOCK_CYCLIC_2D, CSRC_, CTXT_, DLEN_, DTYPE_,
$ LLD_, MB_, M_, NB_, N_, RSRC_
PARAMETER ( BLOCK_CYCLIC_2D = 1, DLEN_ = 9, DTYPE_ = 1,
$ CTXT_ = 2, M_ = 3, N_ = 4, MB_ = 5, NB_ = 6,
$ RSRC_ = 7, CSRC_ = 8, LLD_ = 9 )
COMPLEX ONE
PARAMETER ( ONE = ( 1.0E+0, 0.0E+0 ) )
* ..
* .. Local Scalars ..
LOGICAL LQUERY
CHARACTER COLBTOP, ROWBTOP
INTEGER I, IACOL, IAROW, ICTXT, II, J, JJ, K, LWMIN,
$ MP, MYCOL, MYROW, NPCOL, NPROW, NQ
COMPLEX AJJ, ALPHA
* ..
* .. External Subroutines ..
EXTERNAL BLACS_ABORT, BLACS_GRIDINFO, CHK1MAT, CGEBR2D,
$ CGEBS2D, CLARFG, CSCAL,
$ INFOG2L, PCELSET, PCLARFC,
$ PCLARFG, PB_TOPGET, PB_TOPSET, PXERBLA
* ..
* .. External Functions ..
INTEGER INDXG2P, NUMROC
EXTERNAL INDXG2P, NUMROC
* ..
* .. Intrinsic Functions ..
INTRINSIC CMPLX, MAX, MIN, MOD, REAL
* ..
* .. Executable Statements ..
*
* Get grid parameters
*
ICTXT = DESCA( CTXT_ )
CALL BLACS_GRIDINFO( ICTXT, NPROW, NPCOL, MYROW, MYCOL )
*
* Test the input parameters
*
INFO = 0
IF( NPROW.EQ.-1 ) THEN
INFO = -(600+CTXT_)
ELSE
CALL CHK1MAT( M, 1, N, 2, IA, JA, DESCA, 6, INFO )
IF( INFO.EQ.0 ) THEN
IAROW = INDXG2P( IA, DESCA( MB_ ), MYROW, DESCA( RSRC_ ),
$ NPROW )
IACOL = INDXG2P( JA, DESCA( NB_ ), MYCOL, DESCA( CSRC_ ),
$ NPCOL )
MP = NUMROC( M+MOD( IA-1, DESCA( MB_ ) ), DESCA( MB_ ),
$ MYROW, IAROW, NPROW )
NQ = NUMROC( N+MOD( JA-1, DESCA( NB_ ) ), DESCA( NB_ ),
$ MYCOL, IACOL, NPCOL )
LWMIN = MP + MAX( 1, NQ )
*
WORK( 1 ) = CMPLX( REAL( LWMIN ) )
LQUERY = ( LWORK.EQ.-1 )
IF( LWORK.LT.LWMIN .AND. .NOT.LQUERY )
$ INFO = -9
END IF
END IF
*
IF( INFO.NE.0 ) THEN
CALL PXERBLA( ICTXT, 'PCGEQL2', -INFO )
CALL BLACS_ABORT( ICTXT, 1 )
RETURN
ELSE IF( LQUERY ) THEN
RETURN
END IF
*
* Quick return if possible
*
IF( M.EQ.0 .OR. N.EQ.0 )
$ RETURN
*
CALL PB_TOPGET( ICTXT, 'Broadcast', 'Rowwise', ROWBTOP )
CALL PB_TOPGET( ICTXT, 'Broadcast', 'Columnwise', COLBTOP )
CALL PB_TOPSET( ICTXT, 'Broadcast', 'Rowwise', 'D-ring' )
CALL PB_TOPSET( ICTXT, 'Broadcast', 'Columnwise', ' ' )
*
IF( DESCA( M_ ).EQ.1 ) THEN
IF( MYCOL.EQ.IACOL )
$ NQ = NQ - MOD( JA-1, DESCA( NB_ ) )
CALL INFOG2L( IA, JA, DESCA, NPROW, NPCOL, MYROW, MYCOL, II,
$ JJ, IAROW, IACOL )
IACOL = INDXG2P( JA+N-1, DESCA( NB_ ), MYCOL, DESCA( CSRC_ ),
$ NPCOL )
IF( MYROW.EQ.IAROW ) THEN
IF( MYCOL.EQ.IACOL ) THEN
I = II+(JJ+NQ-2)*DESCA( LLD_ )
AJJ = A( I )
CALL CLARFG( 1, AJJ, A( I ), 1, TAU( JJ+NQ-1 ) )
IF( N.GT.1 ) THEN
ALPHA = ONE - CONJG( TAU( JJ+NQ-1 ) )
CALL CGEBS2D( ICTXT, 'Rowwise', ' ', 1, 1, ALPHA, 1 )
CALL CSCAL( NQ-1, ALPHA, A( II+(JJ-1)*DESCA( LLD_ ) ),
$ DESCA( LLD_ ) )
END IF
CALL CGEBS2D( ICTXT, 'Columnwise', ' ', 1, 1,
$ TAU( JJ+NQ-1 ), 1 )
A( I ) = AJJ
ELSE
IF( N.GT.1 ) THEN
CALL CGEBR2D( ICTXT, 'Rowwise', ' ', 1, 1, ALPHA,
$ 1, IAROW, IACOL )
CALL CSCAL( NQ, ALPHA, A( II+(JJ-1)*DESCA( LLD_ ) ),
$ DESCA( LLD_ ) )
END IF
END IF
ELSE IF( MYCOL.EQ.IACOL ) THEN
CALL CGEBR2D( ICTXT, 'Columnwise', ' ', 1, 1,
$ TAU( JJ+NQ-1 ), 1, IAROW, IACOL )
END IF
*
ELSE
*
K = MIN( M, N )
DO 10 J = JA+K-1, JA, -1
I = IA + J - JA
*
* Generate elementary reflector H(j) to annihilate
* A(ia:i+m-k-1,j+n-k)
*
CALL PCLARFG( M-K+I-IA+1, AJJ, M-K+I, N-K+J, A, IA,
$ N-K+J, DESCA, 1, TAU )
*
* Apply H(j)' to A(ia:i+m-k,ja:j+n-k-1) from the left
*
CALL PCELSET( A, I+M-K, J+N-K, DESCA, ONE )
CALL PCLARFC( 'Left', M-K+I-IA+1, N-K+J-JA, A, IA, N-K+J,
$ DESCA, 1, TAU, A, IA, JA, DESCA, WORK )
CALL PCELSET( A, I+M-K, J+N-K, DESCA, AJJ )
*
10 CONTINUE
*
END IF
*
CALL PB_TOPSET( ICTXT, 'Broadcast', 'Rowwise', ROWBTOP )
CALL PB_TOPSET( ICTXT, 'Broadcast', 'Columnwise', COLBTOP )
*
WORK( 1 ) = CMPLX( REAL( LWMIN ) )
*
RETURN
*
* End of PCGEQL2
*
END
|