pdlagge.f

Go to the documentation of this file.

      SUBROUTINE pdlagge( M, N, D, A, IA, JA, DESCA, ISEED, ORDER, WORK,
     $                    LWORK, INFO )
*
*  -- ScaLAPACK routine (version 1.7) --
*     University of Tennessee, Knoxville, Oak Ridge National Laboratory,
*     and University of California, Berkeley.
*     May 1, 1997
*
*     .. Scalar Arguments ..
      INTEGER            IA, INFO, JA, LWORK, M, N, ORDER
*     ..
*     .. Array Arguments ..
      INTEGER            DESCA( * ), ISEED( 4 )
      DOUBLE PRECISION   A( * ), D( * ), WORK( * )
*     ..
*
*  Purpose
*  =======
*
*  PDLAGGE generates a real symmetric matrix A, by pre- and post-
*  multiplying a real diagonal matrix D with a random orthogonal
*  matrices:  A = U*D*VT.
*
*  This is just a quick implementation which will be replaced in the
*  future. The random matrix A1(m,n) is generated and random left
*  orthogonal matrix U(m,m) is obtained  by running QR on A1:
*     A1(m,n) = U(m,m)*R,
*  where U(m,m) is a product of min(m,n) Householder rotations.
*  Afterwards the space of A1 is reused for a second random matrix
*  A2(m,n), which is used to obtain the right orthogonal matrix VT(n,n)
*  by running LQ on A2:
*     A2(m,n) = L*VT(n,n).
*  This requires vastly more computation than necessary, but not 
*  significantly more communication than is used in the rest of this 
*  routine, and hence is not that much slower than an efficient 
*  solution.
*
*  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
*           Number of rows of the matrix A. M >= 0.
*
*  N       (global input) INTEGER
*          Number  of columns of matrix A.  N >= 0.
*
*  D       (local input) DOUBLE PRECISION array, dimension (N)
*          The diagonal elements of the diagonal matrix D.
*
*  A       (local output) DOUBLE PRECISION array
*          Global dimension (M, N), local dimension (MP, NQ)
*
*  IA      (global input) INTEGER
*          The global row index of the submatrix of the distributed
*          matrix A to operate on.
*
*  JA      (global input) INTEGER
*          The global column index of the submatrix of the distributed
*          matrix A to operate on.
*
*  DESCA   (global and local input) INTEGER array of dimension DLEN_
*          The array descriptor for the distributed matrix A.
*
*  ISEED   (global input/output) INTEGER array, dimension (4)
*          On entry, the seed of the random number generator; the array
*          elements must be between 0 and 4095, and ISEED(4) must be
*          odd. On exit, the seed is updated and will remain identical
*          on all processes in the context.
*
*  ORDER   (global input) INTEGER
*          Number of reflectors in the matrix Q
*          At present, ORDER .NE. N is not supported
*
*  WORK    (local workspace) DOUBLE PRECISION array, dimension (LWORK)
*
*  LWORK   (local input) INTEGER dimension of WORK
*          LWORK >= MAX( QR_WORK, LQ_WORK )
*          QR_WORK = LDAA*MAX( 1, NQ ) + 200 + MAX( 1, DTAU1 ) +
*                    MAX( SIZEMQRLEFT, SIZEQRF)
*          LQ_WORK = LDAA*MAX( 1, NQ ) + 200 + MAX( 1, DTAU2) +
*                    MAX( SIZEMLQRIGHT, SIZEQRF )
*          Where:
*          LDAA = DESCA( LLD_ )
*          MB_A = DESCA( MB_ )
*          NB_A = DESCA( NB_ )
*          RSRC_A = DESCA( RSRC_ )
*          CSRC_A = DESCA( CSRC_ )
*          LCM = ILCM( NPROW, NPCOL )
*          LCMQ = LCM / NPCOL
*          IROFFA = MOD( IA-1, MB_A )
*          ICOFFA = MOD( JA-1, NB_A )
*          IAROW = INDXG2P( IA, MB_A, MYROW, RSRC_A, NPROW )
*          IACOL = INDXG2P( JA, NB_A, MYCOL, CSRC_A, NPCOL )
*          MP = NUMROC( N+IROFFA, MB_A, MYROW, IAROW, NPROW )
*          NQ = NUMROC( N+ICOFFA, NB_A, MYCOL, IACOL, NPCOL )
*          DTAU1 = NUMROC( JA + SIZE- 1, NB_A, MYCOL, IACOL, NPROW )
*          DTAU2 = NUMROC( IA + SIZE- 1, MB_A, MYROW, IAROW, NPROW )
*          SIZEMQRLEFT = MAX( (MB_A*(MB_A-1))/2, ( MP + NQ ) * MB_A )
*               + ( MP + NB_A ) * NB_A
*          SIZEMLQRIGHT =  MAX( (MB_A*(MB_A-1))/2, (MP + NQ)*MB_A ) +
*                      MB_A * MB_A
*          SIZEQRF = NB_A*NP + MB_A*NQ + NB_A*NB_A
*
*  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.
*
* ======================================================================
*
*     .. Parameters ..
      INTEGER            BLOCK_CYCLIC_2D, DLEN_, DTYPE_, CTXT_, M_, N_,
     $                   mb_, nb_, rsrc_, csrc_, lld_
      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 )
      DOUBLE PRECISION   ZERO
      parameter( zero = 0.0d+0 )
*     ..
*     .. Local Scalars ..
      INTEGER            CSRC_A, DTAU1, DTAU2, I, IACOL, IAROW, ICOFFA,
     $                   iroffa, lcm, lcmq, ldaa, lq_work, lwmin, mb_a,
     $                   mp, mycol, myrow, nb_a, npcol, nprow, nq,
     $                   ptr2aa, ptr2tau, ptr2work, qr_work, rsrc_a,
     $                   SIZE, sizelqf, sizemlqright, sizemqrleft,
     $                   sizeqrf
*     ..
*     .. External Subroutines ..
      EXTERNAL           blacs_gridinfo, chk1mat, pdelset, pdgelqf,
     $                   pdgeqrf, pdlaset, pdmatgen, pdormlq, pdormqr,
     $                   pxerbla
*     ..
*     .. External Functions ..
      INTEGER            ILCM, INDXG2P, NUMROC
      EXTERNAL           ilcm, indxg2p, numroc
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          max, min, mod
*     ..
*     .. Executable Statements ..
*     This is just to keep ftnchek happy
      IF( block_cyclic_2d*dlen_*dtype_*m_*n_.LT.0 )RETURN
*
*     Initialize grid information.
*
      CALL blacs_gridinfo( desca( ctxt_ ), nprow, npcol, myrow, mycol )
*
*     Check LWORK.
*
      info = 0
      SIZE = min( m, n )
      IF( nprow.EQ.-1 ) THEN
         info = -607
      ELSE
         CALL chk1mat( m, 1, n, 2, ia, ja, desca, 8, info )
      END IF
*     Calculation of a minimum workspace.
      ldaa = desca( lld_ )
      mb_a = desca( mb_ )
      nb_a = desca( nb_ )
      rsrc_a = desca( rsrc_ )
      csrc_a = desca( csrc_ )
      lcm = ilcm( nprow, npcol )
      lcmq = lcm / npcol
      iroffa = mod( ia-1, mb_a )
      icoffa = mod( ja-1, nb_a )
      iarow = indxg2p( ia, mb_a, myrow, rsrc_a, nprow )
      iacol = indxg2p( ja, nb_a, mycol, csrc_a, npcol )
      dtau1 = numroc( ja+size-1, nb_a, mycol, iacol, npcol )
      dtau2 = numroc( ia+size-1, mb_a, myrow, iarow, nprow )
      mp = numroc( m+iroffa, mb_a, myrow, iarow, nprow )
      nq = numroc( n+icoffa, nb_a, mycol, iacol, npcol )
*
      sizemqrleft = max( ( mb_a*( mb_a-1 ) ) / 2, ( mp+nq )*mb_a ) +
     $              ( mp+nb_a )*nb_a
      sizemlqright = max( ( mb_a*( mb_a-1 ) ) / 2, ( mp+nq )*mb_a ) +
     $               mb_a*mb_a
      sizeqrf = nb_a*mp + mb_a*nq + nb_a*nb_a + 100
      sizelqf = nb_a*( mp+nq+nb_a ) + 100
*
      qr_work = ldaa*max( 1, nq ) + 200 + max( 1, dtau1 ) +
     $          max( sizemqrleft, sizeqrf )
      lq_work = ldaa*max( 1, nq ) + 200 + max( 1, dtau2 ) +
     $          max( sizemlqright, sizelqf )
      lwmin = max( qr_work, lq_work )
      work( 1 ) = lwmin
      IF( lwork.EQ.-1 )
     $   GO TO 20
*
*     Test the input arguments.
*
      IF( info.EQ.0 ) THEN
         IF( size.NE.order ) THEN
            info = -9
         ELSE IF( lwork.LT.lwmin ) THEN
            info = -11
         END IF
      END IF
      IF( info.LT.0 ) THEN
         CALL pxerbla( desca( ctxt_ ), 'PDLAGGE', -info )
         RETURN
      END IF
*
*     Build a diagonal matrix A with the eigenvalues specified in D.
*
      CALL pdlaset( 'Full', m, n, zero, zero, a, ia, ja, desca )
      DO 10 i = 1, SIZE
         CALL pdelset( a, i, i, desca, d( i ) )
   10 CONTINUE
*
*     Local dimension of array TAU in tis case is LOCc(JA+MIN(M,N)-1).
*
      ptr2aa = 2
      ptr2tau = ptr2aa + ldaa*max( 1, nq ) + 100
      ptr2work = ptr2tau + max( 1, dtau1 ) + 100
*
      CALL pdlaset( 'All', m, n, zero, zero, work( ptr2aa ), ia, ja,
     $              desca )
*
*     Build a random matrix AA1.
*
      CALL pdmatgen( desca( ctxt_ ), 'N', 'N', m, n, desca( mb_ ),
     $               desca( nb_ ), work( ptr2aa ), desca( lld_ ),
     $               desca( rsrc_ ), desca( csrc_ ), iseed( 1 ), 0, mp,
     $               0, nq, myrow, mycol, nprow, npcol )
*
*     Produce QR decomposition AA1 -> U*R.
*
      CALL pdgeqrf( m, n, work( ptr2aa ), ia, ja, desca,
     $              work( ptr2tau ), work( ptr2work ), sizeqrf, info )
*
*     A = U*A.
*
      CALL pdormqr( 'L', 'N', m, n, SIZE, work( ptr2aa ), ia, ja, desca,
     $              work( ptr2tau ), a, ia, ja, desca, work( ptr2work ),
     $              sizemqrleft, info )
*
*     Reinitialize pointer to WORK array. Dimension of array TAU in
*     this case is  LOCr(IA+MIN(M,N)-1).
*
      ptr2work = ptr2tau + max( 1, dtau2 ) + 100
*
*     Use the same workspace to generate a random matrix AA2.
*
      CALL pdmatgen( desca( ctxt_ ), 'N', 'N', m, n, desca( mb_ ),
     $               desca( nb_ ), work( ptr2aa ), desca( lld_ ),
     $               desca( rsrc_ ), desca( csrc_ ), iseed( 2 ), 0, mp,
     $               0, nq, myrow, mycol, nprow, npcol )
*
*     Produce LQ decomposition of random matrix  AA2 -> L*VT.
*
      CALL pdgelqf( m, n, work( ptr2aa ), ia, ja, desca,
     $              work( ptr2tau ), work( ptr2work ), sizelqf, info )
*
*     Calculate A = A*VT.
*
      CALL pdormlq( 'R', 'N', m, n, SIZE, work( ptr2aa ), ia, ja, desca,
     $              work( ptr2tau ), a, ia, ja, desca, work( ptr2work ),
     $              sizemlqright, info )
*
*     End of PDLAGGE
*
   20 CONTINUE
      RETURN
      END