pcheev.f

Go to the documentation of this file.

      SUBROUTINE pcheev( JOBZ, UPLO, N, A, IA, JA, DESCA, W, Z, IZ, JZ,
     $                   DESCZ, WORK, LWORK, RWORK, LRWORK, INFO )
*
*  -- ScaLAPACK routine (version 1.7) --
*     University of Tennessee, Knoxville, Oak Ridge National Laboratory,
*     and University of California, Berkeley.
*     August 14, 2001 
*
*     .. Scalar Arguments ..
      CHARACTER          JOBZ, UPLO
      INTEGER            IA, INFO, IZ, JA, JZ, LRWORK, LWORK, N
*     ..
*     .. Array Arguments ..
      INTEGER            DESCA( * ), DESCZ( * )
      REAL               RWORK( * ), W( * )
      COMPLEX            A( * ), WORK( * ), Z( * )
*     ..
*
*  Purpose
*  =======
*
*  PCHEEV computes selected eigenvalues and, optionally, eigenvectors
*  of a real Hermitian matrix A by calling the recommended sequence
*  of ScaLAPACK routines.
*
*  In its present form, PCHEEV assumes a homogeneous system and makes
*  only spot checks of the consistency of the eigenvalues across the
*  different processes.  Because of this, it is possible that a
*  heterogeneous system may return incorrect results without any error
*  messages.
*
*  Notes
*  =====
*  A description vector is associated with each 2D block-cyclicly dis-
*  tributed matrix.  This vector stores the information required to
*  establish the mapping between a matrix entry and its corresponding
*  process and memory location.
*
*  In the following comments, the character _ should be read as
*  "of the distributed matrix".  Let A be a generic term for any 2D
*  block cyclicly distributed matrix.  Its description vector is DESCA:
*
*  NOTATION        STORED IN      EXPLANATION
*  --------------- -------------- --------------------------------------
*  DTYPE_A(global) DESCA( DTYPE_) The descriptor type.
*  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 distributed
*                                 matrix A.
*  N_A    (global) DESCA( N_ )    The number of columns in the distri-
*                                 buted matrix A.
*  MB_A   (global) DESCA( MB_ )   The blocking factor used to distribute
*                                 the rows of A.
*  NB_A   (global) DESCA( NB_ )   The blocking factor used to distribute
*                                 the columns of A.
*  RSRC_A (global) DESCA( RSRC_ ) The process row over which the first
*                                 row of the matrix A is distributed.
*  CSRC_A (global) DESCA( CSRC_ ) The process column over which the
*                                 first column of A is distributed.
*  LLD_A  (local)  DESCA( LLD_ )  The leading dimension of the local
*                                 array storing the local blocks of the
*                                 distributed matrix A.
*                                 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 ).
*
*  Arguments
*  =========
*
*     NP = the number of rows local to a given process.
*     NQ = the number of columns local to a given process.
*
*  JOBZ    (global input) CHARACTER*1
*          Specifies whether or not to compute the eigenvectors:
*          = 'N':  Compute eigenvalues only.
*          = 'V':  Compute eigenvalues and eigenvectors.
*
*  UPLO    (global input) CHARACTER*1
*          Specifies whether the upper or lower triangular part of the
*          Hermitian matrix A is stored:
*          = 'U':  Upper triangular
*          = 'L':  Lower triangular
*
*  N       (global input) INTEGER
*          The number of rows and columns of the matrix A.  N >= 0.
*
*  A       (local input/workspace) block cyclic COMPLEX array,
*          global dimension (N, N), local dimension ( LLD_A,
*          LOCc(JA+N-1) )
*
*          On entry, the Hermitian matrix A.  If UPLO = 'U', only the
*          upper triangular part of A is used to define the elements of
*          the Hermitian matrix.  If UPLO = 'L', only the lower
*          triangular part of A is used to define the elements of the
*          Hermitian matrix.
*
*          On exit, the lower triangle (if UPLO='L') or the upper
*          triangle (if UPLO='U') of A, including the diagonal, is
*          destroyed.
*
*  IA      (global input) INTEGER
*          A's global row index, which points to the beginning of the
*          submatrix which is to be operated on.
*
*  JA      (global input) INTEGER
*          A's global column index, which points to the beginning of
*          the submatrix which is to be operated on.
*
*  DESCA   (global and local input) INTEGER array of dimension DLEN_.
*          The array descriptor for the distributed matrix A.
*          If DESCA( CTXT_ ) is incorrect, PCHEEV cannot guarantee
*          correct error reporting.
*
*  W       (global output) REAL array, dimension (N)
*          If INFO=0, the eigenvalues in ascending order.
*
*  Z       (local output) COMPLEX array,
*          global dimension (N, N),
*          local dimension (LLD_Z, LOCc(JZ+N-1))
*          If JOBZ = 'V', then on normal exit the first M columns of Z
*          contain the orthonormal eigenvectors of the matrix
*          corresponding to the selected eigenvalues.
*          If JOBZ = 'N', then Z is not referenced.
*
*  IZ      (global input) INTEGER
*          Z's global row index, which points to the beginning of the
*          submatrix which is to be operated on.
*
*  JZ      (global input) INTEGER
*          Z's global column index, which points to the beginning of
*          the submatrix which is to be operated on.
*
*  DESCZ   (global and local input) INTEGER array of dimension DLEN_.
*          The array descriptor for the distributed matrix Z.
*          DESCZ( CTXT_ ) must equal DESCA( CTXT_ )
*
*  WORK    (local workspace/output) COMPLEX array,
*          dimension (LWORK)
*          On output, WORK(1) returns the workspace needed to guarantee
*          completion.  If the input parameters are incorrect, WORK(1)
*          may also be incorrect.
*
*          If JOBZ='N' WORK(1) = minimal workspace for eigenvalues only.
*          If JOBZ='V' WORK(1) = minimal workspace required to
*             generate all the eigenvectors.
*
*
*  LWORK   (local input) INTEGER
*          See below for definitions of variables used to define LWORK.
*          If no eigenvectors are requested (JOBZ = 'N') then
*             LWORK >= MAX( NB*( NP0+1 ), 3 ) +3*N
*          If eigenvectors are requested (JOBZ = 'V' ) then
*          the amount of workspace required:
*             LWORK >= (NP0 + NQ0 + NB)*NB + 3*N + N^2
*
*          Variable definitions:
*             NB = DESCA( MB_ ) = DESCA( NB_ ) =
*                  DESCZ( MB_ ) = DESCZ( NB_ )
*             NP0 = NUMROC( NN, NB, 0, 0, NPROW )
*             NQ0 = NUMROC( MAX( N, NB, 2 ), NB, 0, 0, NPCOL )
*
*          If LWORK = -1, the LWORK is global input and a workspace
*          query is assumed; the routine only calculates the minimum
*          size for the WORK array.  The required workspace is returned
*          as the first element of WORK and no error message is issued
*          by PXERBLA.
*
*  RWORK   (local workspace/output) COMPLEX array,
*          dimension (LRWORK)
*          On output RWORK(1) returns the
*          REAL workspace needed to
*          guarantee completion.  If the input parameters are incorrect,
*          RWORK(1) may also be incorrect.
*
*  LRWORK  (local input) INTEGER
*          Size of RWORK array.
*          If eigenvectors are desired (JOBZ = 'V') then
*             LRWORK >= 2*N + 2*N-2
*          If eigenvectors are not desired (JOBZ = 'N') then
*             LRWORK >= 2*N
*
*          If LRWORK = -1, the LRWORK is global input and a workspace
*          query is assumed; the routine only calculates the minimum
*          size for the RWORK array.  The required workspace is returned
*          as the first element of RWORK and no error message is issued
*          by PXERBLA.
*
*  INFO    (global 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.
*          > 0:  If INFO = 1 through N, the i(th) eigenvalue did not
*                converge in CSTEQR2 after a total of 30*N iterations.
*                If INFO = N+1, then PCHEEV has detected heterogeneity
*                by finding that eigenvalues were not identical across
*                the process grid.  In this case, the accuracy of
*                the results from PCHEEV cannot be guaranteed.
*
*  Alignment requirements
*  ======================
*
*  The distributed submatrices A(IA:*, JA:*) and C(IC:IC+M-1,JC:JC+N-1)
*  must verify some alignment properties, namely the following
*  expressions should be true:
*
*  ( MB_A.EQ.NB_A.EQ.MB_Z .AND. IROFFA.EQ.IROFFZ .AND. IROFFA.EQ.0 .AND.
*    IAROW.EQ.IZROW )
*  where
*  IROFFA = MOD( IA-1, MB_A ) and ICOFFA = MOD( JA-1, NB_A ).
*
*  =====================================================================
*
*  Version 1.4 limitations:
*     DESCA(MB_) = DESCA(NB_)
*     DESCA(M_) = DESCZ(M_)
*     DESCA(N_) = DESCZ(N_)
*     DESCA(MB_) = DESCZ(MB_)
*     DESCA(NB_) = DESCZ(NB_)
*     DESCA(RSRC_) = DESCZ(RSRC_)
*
*     .. 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 )
      REAL               ZERO, ONE
      parameter( zero = 0.0e+0, one = 1.0e+0 )
      COMPLEX            CZERO, CONE
      parameter( czero = ( 0.0e+0, 0.0e+0 ),
     $                   cone = ( 1.0e+0, 0.0e+0 ) )
      INTEGER            ITHVAL
      parameter( ithval = 10 )
*     ..
*     .. Local Scalars ..
      LOGICAL            LOWER, WANTZ
      INTEGER            CONTEXTC, CSRC_A, I, IACOL, IAROW, ICOFFA,
     $                   iinfo, indd, inde, indrd, indre, indrwork,
     $                   indtau, indwork, indwork2, iroffa, iroffz,
     $                   iscale, izrow, j, k, ldc, llrwork, llwork,
     $                   lrmin, lrwmin, lwmin, mb_a, mb_z, mycol,
     $                   mypcolc, myprowc, myrow, nb, nb_a, nb_z, np0,
     $                   npcol, npcolc, nprocs, nprow, nprowc, nq0, nrc,
     $                   rsizecsteqr2, rsrc_a, rsrc_z, sizecsteqr2,
     $                   sizepchetrd, sizepcunmtr
      REAL               ANRM, BIGNUM, EPS, RMAX, RMIN, SAFMIN, SIGMA,
     $                   smlnum
*     ..
*     .. Local Arrays ..
      INTEGER            DESCQR( 10 ), IDUM1( 3 ), IDUM2( 3 )
*     ..
*     .. External Functions ..
      LOGICAL            LSAME
      INTEGER            INDXG2P, NUMROC, SL_GRIDRESHAPE
      REAL               PCLANHE, PSLAMCH
      EXTERNAL           lsame, indxg2p, numroc, sl_gridreshape,
     $                   pclanhe, pslamch
*     ..
*     .. External Subroutines ..
      EXTERNAL           blacs_gridexit, blacs_gridinfo, chk1mat,
     $                   csteqr2, descinit, pcelget, pcgemr2d, pchetrd,
     $                   pchk1mat, pchk2mat, pclascl, pclaset, pcunmtr,
     $                   pxerbla, scopy, sgamn2d, sgamx2d, sscal
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          abs, cmplx, ichar, int, max, min, mod, real,
     $                   sqrt
*     ..
*     .. Executable Statements ..
*       This is just to keep ftnchek and toolpack/1 happy
      IF( block_cyclic_2d*csrc_*ctxt_*dlen_*dtype_*lld_*mb_*m_*nb_*n_*
     $    rsrc_.LT.0 )RETURN
*
*     Quick return
*
      IF( n.EQ.0 )
     $   RETURN
*
*     Test the input arguments.
*
      CALL blacs_gridinfo( desca( ctxt_ ), nprow, npcol, myrow, mycol )
      info = 0
*
*     Initialize pointer to some safe value
*
      indtau = 1
      indd = 1
      inde = 1
      indwork = 1
      indwork2 = 1
*
      indre = 1
      indrd = 1
      indrwork = 1
*
      wantz = lsame( jobz, 'V' )
      IF( nprow.EQ.-1 ) THEN
         info = -( 700+ctxt_ )
      ELSE IF( wantz ) THEN
         IF( desca( ctxt_ ).NE.descz( ctxt_ ) ) THEN
            info = -( 1200+ctxt_ )
         END IF
      END IF
      IF( info.EQ.0 ) THEN
         CALL chk1mat( n, 3, n, 3, ia, ja, desca, 7, info )
         IF( wantz )
     $      CALL chk1mat( n, 3, n, 3, iz, jz, descz, 12, info )
*
         IF( info.EQ.0 ) THEN
*
*           Get machine constants.
*
            safmin = pslamch( desca( ctxt_ ), 'Safe minimum' )
            eps = pslamch( desca( ctxt_ ), 'Precision' )
            smlnum = safmin / eps
            bignum = one / smlnum
            rmin = sqrt( smlnum )
            rmax = min( sqrt( bignum ), one / sqrt( sqrt( safmin ) ) )
*
            nprocs = nprow*npcol
            nb_a = desca( nb_ )
            mb_a = desca( mb_ )
            nb = nb_a
            lower = lsame( uplo, 'L' )
*
            rsrc_a = desca( rsrc_ )
            csrc_a = desca( csrc_ )
            iroffa = mod( ia-1, mb_a )
            icoffa = mod( ja-1, nb_a )
            iarow = indxg2p( 1, nb_a, myrow, rsrc_a, nprow )
            iacol = indxg2p( 1, mb_a, mycol, csrc_a, npcol )
            np0 = numroc( n+iroffa, nb, myrow, iarow, nprow )
            nq0 = numroc( n+icoffa, nb, mycol, iacol, npcol )
            IF( wantz ) THEN
               nb_z = descz( nb_ )
               mb_z = descz( mb_ )
               rsrc_z = descz( rsrc_ )
               iroffz = mod( iz-1, mb_a )
               izrow = indxg2p( 1, nb_a, myrow, rsrc_z, nprow )
            ELSE
               iroffz = 0
               izrow = 0
            END IF
*
*           COMPLEX work space for PCHETRD
*
            CALL pchetrd( uplo, n, a, ia, ja, desca, rwork( indd ),
     $                    rwork( inde ), work( indtau ),
     $                    work( indwork ), -1, iinfo )
            sizepchetrd = int( abs( work( 1 ) ) )
*
*           COMPLEX work space for PCUNMTR
*
            IF( wantz ) THEN
               CALL pcunmtr( 'L', uplo, 'N', n, n, a, ia, ja, desca,
     $                       work( indtau ), z, iz, jz, descz,
     $                       work( indwork ), -1, iinfo )
               sizepcunmtr = int( abs( work( 1 ) ) )
            ELSE
               sizepcunmtr = 0
            END IF
*
*           REAL work space for CSTEQR2
*
            IF( wantz ) THEN
               rsizecsteqr2 = max( 1, 2*n-2 )
            ELSE
               rsizecsteqr2 = 0
            END IF
*
*           Initialize the context of the single column distributed
*           matrix required by CSTEQR2. This specific distribution
*           allows each process to do 1/pth of the work updating matrix
*           Q during CSTEQR2 and achieve some parallelization to an
*           otherwise serial subroutine.
*
            ldc = 0
            IF( wantz ) THEN
               contextc = sl_gridreshape( desca( ctxt_ ), 0, 1, 1,
     $                    nprocs, 1 )
               CALL blacs_gridinfo( contextc, nprowc, npcolc, myprowc,
     $                              mypcolc )
               nrc = numroc( n, nb_a, myprowc, 0, nprocs )
               ldc = max( 1, nrc )
               CALL descinit( descqr, n, n, nb, nb, 0, 0, contextc, ldc,
     $                        info )
            END IF
*
*           COMPLEX work space for CSTEQR2
*
            IF( wantz ) THEN
               sizecsteqr2 = n*ldc
            ELSE
               sizecsteqr2 = 0
            END IF
*
*           Set up pointers into the WORK array
*
            indtau = 1
            indd = indtau + n
            inde = indd + n
            indwork = inde + n
            indwork2 = indwork + n*ldc
            llwork = lwork - indwork + 1
*
*           Set up pointers into the RWORK array
*
            indre = 1
            indrd = indre + n
            indrwork = indrd + n
            llrwork = lrwork - indrwork + 1
*
*           Compute the total amount of space needed
*
            lrwmin = 2*n + rsizecsteqr2
            lwmin = 3*n + max( sizepchetrd, sizepcunmtr, sizecsteqr2 )
*
         END IF
         IF( info.EQ.0 ) THEN
            IF( .NOT.( wantz .OR. lsame( jobz, 'N' ) ) ) THEN
               info = -1
            ELSE IF( .NOT.( lower .OR. lsame( uplo, 'U' ) ) ) THEN
               info = -2
            ELSE IF( lwork.LT.lwmin .AND. lwork.NE.-1 ) THEN
               info = -14
            ELSE IF( lrwork.LT.lrwmin .AND. lrwork.NE.-1 ) THEN
               info = -16
            ELSE IF( iroffa.NE.0 ) THEN
               info = -5
            ELSE IF( desca( mb_ ).NE.desca( nb_ ) ) THEN
               info = -( 700+nb_ )
            END IF
            IF( wantz ) THEN
               IF( iroffa.NE.iroffz ) THEN
                  info = -10
               ELSE IF( iarow.NE.izrow ) THEN
                  info = -10
               ELSE IF( desca( m_ ).NE.descz( m_ ) ) THEN
                  info = -( 1200+m_ )
               ELSE IF( desca( n_ ).NE.descz( n_ ) ) THEN
                  info = -( 1200+n_ )
               ELSE IF( desca( mb_ ).NE.descz( mb_ ) ) THEN
                  info = -( 1200+mb_ )
               ELSE IF( desca( nb_ ).NE.descz( nb_ ) ) THEN
                  info = -( 1200+nb_ )
               ELSE IF( desca( rsrc_ ).NE.descz( rsrc_ ) ) THEN
                  info = -( 1200+rsrc_ )
               ELSE IF( desca( ctxt_ ).NE.descz( ctxt_ ) ) THEN
                  info = -( 1200+ctxt_ )
               END IF
            END IF
         END IF
         IF( wantz ) THEN
            idum1( 1 ) = ichar( 'V' )
         ELSE
            idum1( 1 ) = ichar( 'N' )
         END IF
         idum2( 1 ) = 1
         IF( lower ) THEN
            idum1( 2 ) = ichar( 'L' )
         ELSE
            idum1( 2 ) = ichar( 'U' )
         END IF
         idum2( 2 ) = 2
         IF( lwork.EQ.-1 ) THEN
            idum1( 3 ) = -1
         ELSE
            idum1( 3 ) = 1
         END IF
         idum2( 3 ) = 3
         IF( wantz ) THEN
            CALL pchk2mat( n, 3, n, 3, ia, ja, desca, 7, n, 3, n, 3, iz,
     $                     jz, descz, 12, 3, idum1, idum2, info )
         ELSE
            CALL pchk1mat( n, 3, n, 3, ia, ja, desca, 7, 3, idum1,
     $                     idum2, info )
         END IF
         work( 1 ) = cmplx( lwmin )
         rwork( 1 ) = real( lrwmin )
      END IF
*
      IF( info.NE.0 ) THEN
         CALL pxerbla( desca( ctxt_ ), 'PCHEEV', -info )
         IF( wantz )
     $      CALL blacs_gridexit( contextc )
         RETURN
      ELSE IF( lwork.EQ.-1 .OR. lrwork.EQ.-1 ) THEN
         IF( wantz )
     $      CALL blacs_gridexit( contextc )
         RETURN
      END IF
*
*     Scale matrix to allowable range, if necessary.
*
      iscale = 0
*
      anrm = pclanhe( 'M', uplo, n, a, ia, ja, desca,
     $       rwork( indrwork ) )
*
*
      IF( anrm.GT.zero .AND. anrm.LT.rmin ) THEN
         iscale = 1
         sigma = rmin / anrm
      ELSE IF( anrm.GT.rmax ) THEN
         iscale = 1
         sigma = rmax / anrm
      END IF
*
      IF( iscale.EQ.1 ) THEN
         CALL pclascl( uplo, one, sigma, n, n, a, ia, ja, desca, iinfo )
      END IF
*
*     Reduce Hermitian matrix to tridiagonal form.
*
      CALL pchetrd( uplo, n, a, ia, ja, desca, rwork( indrd ),
     $              rwork( indre ), work( indtau ), work( indwork ),
     $              llwork, iinfo )
*
*     Copy the values of D, E to all processes.
*
      DO 10 i = 1, n
         CALL pcelget( 'A', ' ', work( indd+i-1 ), a, i+ia-1, i+ja-1,
     $                 desca )
         rwork( indrd+i-1 ) = real( work( indd+i-1 ) )
   10 CONTINUE
      IF( lsame( uplo, 'U' ) ) THEN
         DO 20 i = 1, n - 1
            CALL pcelget( 'A', ' ', work( inde+i-1 ), a, i+ia-1, i+ja,
     $                    desca )
            rwork( indre+i-1 ) = real( work( inde+i-1 ) )
   20    CONTINUE
      ELSE
         DO 30 i = 1, n - 1
            CALL pcelget( 'A', ' ', work( inde+i-1 ), a, i+ia, i+ja-1,
     $                    desca )
            rwork( indre+i-1 ) = real( work( inde+i-1 ) )
   30    CONTINUE
      END IF
*
      IF( wantz ) THEN
*
         CALL pclaset( 'Full', n, n, czero, cone, work( indwork ), 1, 1,
     $                 descqr )
*
*        CSTEQR2 is a modified version of LAPACK's CSTEQR.  The
*        modifications allow each process to perform partial updates
*        to matrix Q.
*
         CALL csteqr2( 'I', n, rwork( indrd ), rwork( indre ),
     $                 work( indwork ), ldc, nrc, rwork( indrwork ),
     $                 info )
*
         CALL pcgemr2d( n, n, work( indwork ), 1, 1, descqr, z, ia, ja,
     $                  descz, contextc )
*
         CALL pcunmtr( 'L', uplo, 'N', n, n, a, ia, ja, desca,
     $                 work( indtau ), z, iz, jz, descz,
     $                 work( indwork ), llwork, iinfo )
*
      ELSE
*
         CALL csteqr2( 'N', n, rwork( indrd ), rwork( indre ),
     $                 work( indwork ), 1, 1, rwork( indrwork ), info )
      END IF
*
*     Copy eigenvalues from workspace to output array
*
      CALL scopy( n, rwork( indd ), 1, w, 1 )
*
*     If matrix was scaled, then rescale eigenvalues appropriately.
*
      IF( iscale.EQ.1 ) THEN
         CALL sscal( n, one / sigma, w, 1 )
      END IF
*
      work( 1 ) = real( lwmin )
*
*     Free up resources
*
      IF( wantz ) THEN
         CALL blacs_gridexit( contextc )
      END IF
*
*     Compare every ith eigenvalue, or all if there are only a few,
*     across the process grid to check for heterogeneity.
*
      IF( n.LE.ithval ) THEN
         j = n
         k = 1
      ELSE
         j = n / ithval
         k = ithval
      END IF
*
      lrmin = int( rwork( 1 ) )
      indtau = 0
      inde = indtau + j
      DO 40 i = 1, j
         rwork( i+indtau ) = w( ( i-1 )*k+1 )
         rwork( i+inde ) = w( ( i-1 )*k+1 )
   40 CONTINUE
*
      CALL sgamn2d( desca( ctxt_ ), 'All', ' ', j, 1, rwork( 1+indtau ),
     $              j, 1, 1, -1, -1, 0 )
      CALL sgamx2d( desca( ctxt_ ), 'All', ' ', j, 1, rwork( 1+inde ),
     $              j, 1, 1, -1, -1, 0 )
*
      DO 50 i = 1, j
         IF( info.EQ.0 .AND. ( rwork( i+indtau )-rwork( i+inde ).NE.
     $       zero ) ) THEN
            info = n + 1
         END IF
   50 CONTINUE
      rwork( 1 ) = lrmin
*
      RETURN
*
*     End of PCHEEV
*
      END