pzgetri()

subroutine pzgetri	(	integer	n,
		complex*16, dimension( * )	a,
		integer	ia,
		integer	ja,
		integer, dimension( * )	desca,
		integer, dimension( * )	ipiv,
		complex*16, dimension( * )	work,
		integer	lwork,
		integer, dimension( * )	iwork,
		integer	liwork,
		integer	info
	)

Definition at line 1 of file pzgetri.f.

*
*  -- ScaLAPACK routine (version 1.7.4) --
*     University of Tennessee, Knoxville, Oak Ridge National Laboratory,
*     and University of California, Berkeley.
*     v1.7.4: May 10, 2006 
*     v1.7:   May 1,  1997
*
*     .. Scalar Arguments ..
      INTEGER            IA, INFO, JA, LIWORK, LWORK, N
*     ..
*     .. Array Arguments ..
      INTEGER            DESCA( * ), IPIV( * ), IWORK( * )
      COMPLEX*16         A( * ), WORK( * )
*     ..
*
*  Purpose
*  =======
*
*  PZGETRI computes the inverse of a distributed matrix using the LU
*  factorization computed by PZGETRF. This method inverts U and then
*  computes the inverse of sub( A ) = A(IA:IA+N-1,JA:JA+N-1) denoted
*  InvA by solving the system InvA*L = inv(U) for InvA.
*
*  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
*  =========
*
*  N       (global input) INTEGER
*          The number of rows and columns to be operated on, i.e. the
*          order of the distributed submatrix sub( A ). N >= 0.
*
*  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, the local pieces of the L and U obtained by the
*          factorization sub( A ) = P*L*U computed by PZGETRF. On
*          exit, if INFO = 0, sub( A ) contains the inverse of the
*          original distributed matrix sub( A ).
*
*  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.
*
*  IPIV    (local input) INTEGER array, dimension LOCr(M_A)+MB_A
*          keeps track of the pivoting information. IPIV(i) is the
*          global row index the local row i was swapped with.  This
*          array is tied to the distributed matrix A.
*
*  WORK    (local workspace/local output) COMPLEX*16 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 = LOCr(N+MOD(IA-1,MB_A))*NB_A. WORK is used to keep a
*          copy of at most an entire column block of sub( A ).
*
*          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.
*
*  IWORK   (local workspace/local output) INTEGER array,
*                                                    dimension (LIWORK)
*          On exit, IWORK(1) returns the minimal and optimal LIWORK.
*
*  LIWORK  (local or global input) INTEGER
*          The dimension of the array IWORK used as workspace for
*          physically transposing the pivots.
*          LIWORK is local input and must be at least
*          if NPROW == NPCOL then
*            LIWORK = LOCc( N_A + MOD(JA-1, NB_A) ) + NB_A,
*          else
*            LIWORK =  LOCc( N_A + MOD(JA-1, NB_A) ) +
*                      MAX( CEIL(CEIL(LOCr(M_A)/MB_A)/(LCM/NPROW)),
*                           NB_A )
*              where LCM is the least common multiple of process
*              rows and columns (NPROW and NPCOL).
*          end if
*
*          If LIWORK = -1, then LIWORK 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    (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 = K, U(IA+K-1,IA+K-1) is exactly zero; the
*                  matrix is singular and its inverse could not be
*                  computed.
*
*  =====================================================================
*
*     .. 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*16         ZERO, ONE
      parameter( zero = 0.0d+0, one = 1.0d+0 )
*     ..
*     .. Local Scalars ..
      LOGICAL            LQUERY
      INTEGER            I, IACOL, IAROW, ICOFF, ICTXT, IROFF, IW, J,
     $                   JB, JN, LCM, LIWMIN, LWMIN, MP, MYCOL, MYROW,
     $                   NN, NP, NPCOL, NPROW, NQ
*     ..
*     .. Local Arrays ..
      INTEGER            DESCW( DLEN_ ), IDUM1( 2 ), IDUM2( 2 )
*     ..
*     .. External Subroutines ..
      EXTERNAL           blacs_gridinfo, chk1mat, descset, pchk1mat,
     $                   pzgemm, pzlacpy, pzlaset, pzlapiv,
     $                   pztrsm, pztrtri, pxerbla
*     ..
*     .. External Functions ..
      INTEGER            ICEIL, ILCM, INDXG2P, NUMROC
      EXTERNAL           iceil, ilcm, indxg2p, numroc
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          dble, max, min, mod
*     ..
*     .. 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 = -(500+ctxt_)
      ELSE
         CALL chk1mat( n, 1, n, 1, ia, ja, desca, 5, info )
         IF( info.EQ.0 ) THEN
            iroff = mod( ia-1, desca( mb_ ) )
            icoff = mod( ja-1, desca( nb_ ) )
            iarow = indxg2p( ia, desca( mb_ ), myrow, desca( rsrc_ ),
     $                       nprow )
            np = numroc( n+iroff, desca( mb_ ), myrow, iarow, nprow )
            lwmin = np * desca( nb_ )
*
            mp = numroc( desca( m_ ), desca( mb_ ), myrow,
     $                   desca( rsrc_ ), nprow )
            nq = numroc( desca( n_ ), desca( nb_ ), mycol,
     $                   desca( csrc_ ), npcol )
            IF( nprow.EQ.npcol ) THEN
               liwmin = nq + desca( nb_ )
            ELSE
*
* Use the formula for the workspace given in PxLAPIV
* to compute the minimum size LIWORK for IWORK
*
* The formula in PxLAPIV is
*   LDW = LOCc( M_P + MOD(IP-1, MB_P) ) +
*         MB_P * CEIL( CEIL(LOCr(M_P)/MB_P) / (LCM/NPROW) )
*
* where 
*   M_P     is the global length of the pivot vector
*           MP = DESCA( M_ ) + DESCA( MB_ ) * NPROW
*   I_P     is IA
*           I_P = IA
*   MB_P    is the block size use for the block cyclic distribution of the 
*           pivot vector
*           MB_P = DESCA (MB_ )
*   LOCc ( . ) 
*           NUMROC ( . , DESCA ( NB_ ), MYCOL, DESCA ( CSRC_ ), NPCOL )
*   LOCr ( . )
*           NUMROC ( . , DESCA ( MB_ ), MYROW, DESCA ( RSRC_ ), NPROW )
*   CEIL ( X / Y )
*           ICEIL( X, Y )
*   LCM 
*           LCM = ILCM( NPROW, NPCOL )
*
               lcm = ilcm( nprow, npcol )
               liwmin = numroc( desca( m_ ) + desca( mb_ ) * nprow
     $                  + mod( ia - 1, desca( mb_ ) ), desca( nb_ ),
     $                  mycol, desca( csrc_ ), npcol ) +
     $                  max( desca( mb_ ) * iceil( iceil(
     $                  numroc( desca( m_ ) + desca( mb_ ) * nprow,
     $                  desca( mb_ ), myrow, desca( rsrc_ ), nprow ),
     $                  desca( mb_ ) ), lcm / nprow ), desca( nb_ ) )
*
            END IF
*
            work( 1 ) = dble( lwmin )
            iwork( 1 ) = liwmin
            lquery = ( lwork.EQ.-1 .OR. liwork.EQ.-1 )
            IF( iroff.NE.icoff .OR. iroff.NE.0 ) THEN
               info = -4
            ELSE IF( desca( mb_ ).NE.desca( nb_ ) ) THEN
               info = -(500+nb_)
            ELSE IF( lwork.LT.lwmin .AND. .NOT.lquery ) THEN
               info = -8
            ELSE IF( liwork.LT.liwmin .AND. .NOT.lquery ) THEN
               info = -10
            END IF
         END IF
         IF( lwork.EQ.-1 ) THEN
            idum1( 1 ) = -1
         ELSE
            idum1( 1 ) = 1
         END IF
         idum2( 1 ) = 8
         IF( liwork.EQ.-1 ) THEN
            idum1( 2 ) = -1
         ELSE
            idum1( 2 ) = 1
         END IF
         idum2( 2 ) = 10
         CALL pchk1mat( n, 1, n, 1, ia, ja, desca, 5, 2, idum1, idum2,
     $                  info )
      END IF
*
      IF( info.NE.0 ) THEN
         CALL pxerbla( ictxt, 'PZGETRI', -info )
         RETURN
      ELSE IF( lquery ) THEN
         RETURN
      END IF
*
*     Quick return if possible
*
      IF( n.EQ.0 )
     $   RETURN
*
*     Form inv(U).  If INFO > 0 from PZTRTRI, then U is singular,
*     and the inverse is not computed.
*
      CALL pztrtri( 'Upper', 'Non-unit', n, a, ia, ja, desca, info )
      IF( info.GT.0 )
     $   RETURN
*
*     Define array descriptor for working array WORK
*
      jn = min( iceil( ja, desca( nb_ ) ) * desca( nb_ ), ja+n-1 )
      nn = ( ( ja+n-2 ) / desca( nb_ ) ) * desca( nb_ ) + 1
      iacol = indxg2p( nn, desca( nb_ ), mycol, desca( csrc_ ), npcol )
      CALL descset( descw, n+iroff, desca( nb_ ), desca( mb_ ),
     $              desca( nb_ ), iarow, iacol, ictxt, max( 1, np ) )
      iw = iroff + 1
*
*     Solve the equation inv(A)*L=inv(U) for inv(A) using blocked code.
*
      DO 10 j = nn, jn+1, -desca( nb_ )
         jb = min( desca( nb_ ), ja+n-j )
         i = ia + j - ja
*
*        Copy current block column of L to WORK and replace with zeros.
*
         CALL pzlacpy( 'Lower', ja+n-1-j, jb, a, i+1, j, desca,
     $                 work, iw+j-ja+1, 1, descw )
         CALL pzlaset( 'Lower', ja+n-1-j, jb, zero, zero, a, i+1, j,
     $                 desca )
*
*        Compute current block column of inv(A).
*
         IF( j+jb.LE.ja+n-1 )
     $      CALL pzgemm( 'No transpose', 'No transpose', n, jb,
     $                   ja+n-j-jb, -one, a, ia, j+jb, desca, work,
     $                   iw+j+jb-ja, 1, descw, one, a, ia, j, desca )
         CALL pztrsm( 'Right', 'Lower', 'No transpose', 'Unit', n, jb,
     $                one, work, iw+j-ja, 1, descw, a, ia, j, desca )
         descw( csrc_ ) = mod( descw( csrc_ ) + npcol - 1, npcol )
*
   10 CONTINUE
*
*     Handle the last block of columns separately
*
      jb = jn-ja+1
*
*     Copy current block column of L to WORK and replace with zeros.
*
      CALL pzlacpy( 'Lower', n-1, jb, a, ia+1, ja, desca, work, iw+1,
     $              1, descw )
      CALL pzlaset( 'Lower', n-1, jb, zero, zero, a, ia+1, ja, desca )
*
*     Compute current block column of inv(A).
*
      IF( ja+jb.LE.ja+n-1 )
     $   CALL pzgemm( 'No transpose', 'No transpose', n, jb,
     $                n-jb, -one, a, ia, ja+jb, desca, work, iw+jb, 1,
     $                descw, one, a, ia, ja, desca )
      CALL pztrsm( 'Right', 'Lower', 'No transpose', 'Unit', n, jb,
     $             one, work, iw, 1, descw, a, ia, ja, desca )
*
*     Use the row pivots and apply them to the columns of the global
*     matrix.
*
      CALL descset( descw, desca( m_ ) + desca( mb_ )*nprow, 1,
     $              desca( mb_ ), 1, desca( rsrc_ ), mycol, ictxt,
     $              mp+desca( mb_ ) )
      CALL pzlapiv( 'Backward', 'Columns', 'Column', n, n, a, ia,
     $              ja, desca, ipiv, ia, 1, descw, iwork )
*
      work( 1 ) = dble( lwmin )
      iwork( 1 ) = liwmin
*
      RETURN
*
*     End of PZGETRI
*

Here is the call graph for this function:

Here is the caller graph for this function: