zlahef.f

Go to the documentation of this file.

*> \brief \b ZLAHEF computes a partial factorization of a complex Hermitian indefinite matrix, using the diagonal pivoting method.
*
*  =========== DOCUMENTATION ===========
*
* Online html documentation available at 
*            http://www.netlib.org/lapack/explore-html/ 
*
*> \htmlonly
*> Download ZLAHEF + dependencies 
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlahef.f"> 
*> [TGZ]</a> 
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlahef.f"> 
*> [ZIP]</a> 
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlahef.f"> 
*> [TXT]</a>
*> \endhtmlonly 
*
*  Definition:
*  ===========
*
*       SUBROUTINE ZLAHEF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO )
* 
*       .. Scalar Arguments ..
*       CHARACTER          UPLO
*       INTEGER            INFO, KB, LDA, LDW, N, NB
*       ..
*       .. Array Arguments ..
*       INTEGER            IPIV( * )
*       COMPLEX*16         A( LDA, * ), W( LDW, * )
*       ..
*  
*
*> \par Purpose:
*  =============
*>
*> \verbatim
*>
*> ZLAHEF computes a partial factorization of a complex Hermitian
*> matrix A using the Bunch-Kaufman diagonal pivoting method. The
*> partial factorization has the form:
*>
*> A  =  ( I  U12 ) ( A11  0  ) (  I      0     )  if UPLO = 'U', or:
*>       ( 0  U22 ) (  0   D  ) ( U12**H U22**H )
*>
*> A  =  ( L11  0 ) (  D   0  ) ( L11**H L21**H )  if UPLO = 'L'
*>       ( L21  I ) (  0  A22 ) (  0      I     )
*>
*> where the order of D is at most NB. The actual order is returned in
*> the argument KB, and is either NB or NB-1, or N if N <= NB.
*> Note that U**H denotes the conjugate transpose of U.
*>
*> ZLAHEF is an auxiliary routine called by ZHETRF. It uses blocked code
*> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or
*> A22 (if UPLO = 'L').
*> \endverbatim
*
*  Arguments:
*  ==========
*
*> \param[in] UPLO
*> \verbatim
*>          UPLO is CHARACTER*1
*>          Specifies whether the upper or lower triangular part of the
*>          Hermitian matrix A is stored:
*>          = 'U':  Upper triangular
*>          = 'L':  Lower triangular
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*>          N is INTEGER
*>          The order of the matrix A.  N >= 0.
*> \endverbatim
*>
*> \param[in] NB
*> \verbatim
*>          NB is INTEGER
*>          The maximum number of columns of the matrix A that should be
*>          factored.  NB should be at least 2 to allow for 2-by-2 pivot
*>          blocks.
*> \endverbatim
*>
*> \param[out] KB
*> \verbatim
*>          KB is INTEGER
*>          The number of columns of A that were actually factored.
*>          KB is either NB-1 or NB, or N if N <= NB.
*> \endverbatim
*>
*> \param[in,out] A
*> \verbatim
*>          A is COMPLEX*16 array, dimension (LDA,N)
*>          On entry, the Hermitian matrix A.  If UPLO = 'U', the leading
*>          n-by-n upper triangular part of A contains the upper
*>          triangular part of the matrix A, and the strictly lower
*>          triangular part of A is not referenced.  If UPLO = 'L', the
*>          leading n-by-n lower triangular part of A contains the lower
*>          triangular part of the matrix A, and the strictly upper
*>          triangular part of A is not referenced.
*>          On exit, A contains details of the partial factorization.
*> \endverbatim
*>
*> \param[in] LDA
*> \verbatim
*>          LDA is INTEGER
*>          The leading dimension of the array A.  LDA >= max(1,N).
*> \endverbatim
*>
*> \param[out] IPIV
*> \verbatim
*>          IPIV is INTEGER array, dimension (N)
*>          Details of the interchanges and the block structure of D.
*>          If UPLO = 'U', only the last KB elements of IPIV are set;
*>          if UPLO = 'L', only the first KB elements are set.
*>
*>          If IPIV(k) > 0, then rows and columns k and IPIV(k) were
*>          interchanged and D(k,k) is a 1-by-1 diagonal block.
*>          If UPLO = 'U' and IPIV(k) = IPIV(k-1) < 0, then rows and
*>          columns k-1 and -IPIV(k) were interchanged and D(k-1:k,k-1:k)
*>          is a 2-by-2 diagonal block.  If UPLO = 'L' and IPIV(k) =
*>          IPIV(k+1) < 0, then rows and columns k+1 and -IPIV(k) were
*>          interchanged and D(k:k+1,k:k+1) is a 2-by-2 diagonal block.
*> \endverbatim
*>
*> \param[out] W
*> \verbatim
*>          W is COMPLEX*16 array, dimension (LDW,NB)
*> \endverbatim
*>
*> \param[in] LDW
*> \verbatim
*>          LDW is INTEGER
*>          The leading dimension of the array W.  LDW >= max(1,N).
*> \endverbatim
*>
*> \param[out] INFO
*> \verbatim
*>          INFO is INTEGER
*>          = 0: successful exit
*>          > 0: if INFO = k, D(k,k) is exactly zero.  The factorization
*>               has been completed, but the block diagonal matrix D is
*>               exactly singular.
*> \endverbatim
*
*  Authors:
*  ========
*
*> \author Univ. of Tennessee 
*> \author Univ. of California Berkeley 
*> \author Univ. of Colorado Denver 
*> \author NAG Ltd. 
*
*> \date September 2012
*
*> \ingroup complex16HEcomputational
*
*  =====================================================================
      SUBROUTINE zlahef( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO )
*
*  -- LAPACK computational routine (version 3.4.2) --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*     September 2012
*
*     .. Scalar Arguments ..
      CHARACTER          uplo
      INTEGER            info, kb, lda, ldw, n, nb
*     ..
*     .. Array Arguments ..
      INTEGER            ipiv( * )
      COMPLEX*16         a( lda, * ), w( ldw, * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      DOUBLE PRECISION   zero, one
      parameter( zero = 0.0d+0, one = 1.0d+0 )
      COMPLEX*16         cone
      parameter( cone = ( 1.0d+0, 0.0d+0 ) )
      DOUBLE PRECISION   eight, sevten
      parameter( eight = 8.0d+0, sevten = 17.0d+0 )
*     ..
*     .. Local Scalars ..
      INTEGER            imax, j, jb, jj, jmax, jp, k, kk, kkw, kp,
     $                   kstep, kw
      DOUBLE PRECISION   absakk, alpha, colmax, r1, rowmax, t
      COMPLEX*16         d11, d21, d22, z
*     ..
*     .. External Functions ..
      LOGICAL            lsame
      INTEGER            izamax
      EXTERNAL           lsame, izamax
*     ..
*     .. External Subroutines ..
      EXTERNAL           zcopy, zdscal, zgemm, zgemv, zlacgv, zswap
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          abs, dble, dconjg, dimag, max, min, sqrt
*     ..
*     .. Statement Functions ..
      DOUBLE PRECISION   cabs1
*     ..
*     .. Statement Function definitions ..
      cabs1( z ) = abs( dble( z ) ) + abs( dimag( z ) )
*     ..
*     .. Executable Statements ..
*
      info = 0
*
*     Initialize ALPHA for use in choosing pivot block size.
*
      alpha = ( one+sqrt( sevten ) ) / eight
*
      IF( lsame( uplo, 'U' ) ) THEN
*
*        Factorize the trailing columns of A using the upper triangle
*        of A and working backwards, and compute the matrix W = U12*D
*        for use in updating A11 (note that conjg(W) is actually stored)
*
*        K is the main loop index, decreasing from N in steps of 1 or 2
*
*        KW is the column of W which corresponds to column K of A
*
         k = n
   10    continue
         kw = nb + k - n
*
*        Exit from loop
*
         IF( ( k.LE.n-nb+1 .AND. nb.LT.n ) .OR. k.LT.1 )
     $      go to 30
*
*        Copy column K of A to column KW of W and update it
*
         CALL zcopy( k-1, a( 1, k ), 1, w( 1, kw ), 1 )
         w( k, kw ) = dble( a( k, k ) )
         IF( k.LT.n ) THEN
            CALL zgemv( 'No transpose', k, n-k, -cone, a( 1, k+1 ), lda,
     $                  w( k, kw+1 ), ldw, cone, w( 1, kw ), 1 )
            w( k, kw ) = dble( w( k, kw ) )
         END IF
*
         kstep = 1
*
*        Determine rows and columns to be interchanged and whether
*        a 1-by-1 or 2-by-2 pivot block will be used
*
         absakk = abs( dble( w( k, kw ) ) )
*
*        IMAX is the row-index of the largest off-diagonal element in
*        column K, and COLMAX is its absolute value
*
         IF( k.GT.1 ) THEN
            imax = izamax( k-1, w( 1, kw ), 1 )
            colmax = cabs1( w( imax, kw ) )
         ELSE
            colmax = zero
         END IF
*
         IF( max( absakk, colmax ).EQ.zero ) THEN
*
*           Column K is zero: set INFO and continue
*
            IF( info.EQ.0 )
     $         info = k
            kp = k
            a( k, k ) = dble( a( k, k ) )
         ELSE
            IF( absakk.GE.alpha*colmax ) THEN
*
*              no interchange, use 1-by-1 pivot block
*
               kp = k
            ELSE
*
*              Copy column IMAX to column KW-1 of W and update it
*
               CALL zcopy( imax-1, a( 1, imax ), 1, w( 1, kw-1 ), 1 )
               w( imax, kw-1 ) = dble( a( imax, imax ) )
               CALL zcopy( k-imax, a( imax, imax+1 ), lda,
     $                     w( imax+1, kw-1 ), 1 )
               CALL zlacgv( k-imax, w( imax+1, kw-1 ), 1 )
               IF( k.LT.n ) THEN
                  CALL zgemv( 'No transpose', k, n-k, -cone,
     $                        a( 1, k+1 ), lda, w( imax, kw+1 ), ldw,
     $                        cone, w( 1, kw-1 ), 1 )
                  w( imax, kw-1 ) = dble( w( imax, kw-1 ) )
               END IF
*
*              JMAX is the column-index of the largest off-diagonal
*              element in row IMAX, and ROWMAX is its absolute value
*
               jmax = imax + izamax( k-imax, w( imax+1, kw-1 ), 1 )
               rowmax = cabs1( w( jmax, kw-1 ) )
               IF( imax.GT.1 ) THEN
                  jmax = izamax( imax-1, w( 1, kw-1 ), 1 )
                  rowmax = max( rowmax, cabs1( w( jmax, kw-1 ) ) )
               END IF
*
               IF( absakk.GE.alpha*colmax*( colmax / rowmax ) ) THEN
*
*                 no interchange, use 1-by-1 pivot block
*
                  kp = k
               ELSE IF( abs( dble( w( imax, kw-1 ) ) ).GE.alpha*rowmax )
     $                   THEN
*
*                 interchange rows and columns K and IMAX, use 1-by-1
*                 pivot block
*
                  kp = imax
*
*                 copy column KW-1 of W to column KW
*
                  CALL zcopy( k, w( 1, kw-1 ), 1, w( 1, kw ), 1 )
               ELSE
*
*                 interchange rows and columns K-1 and IMAX, use 2-by-2
*                 pivot block
*
                  kp = imax
                  kstep = 2
               END IF
            END IF
*
            kk = k - kstep + 1
            kkw = nb + kk - n
*
*           Updated column KP is already stored in column KKW of W
*
            IF( kp.NE.kk ) THEN
*
*              Copy non-updated column KK to column KP
*
               a( kp, kp ) = dble( a( kk, kk ) )
               CALL zcopy( kk-1-kp, a( kp+1, kk ), 1, a( kp, kp+1 ),
     $                     lda )
               CALL zlacgv( kk-1-kp, a( kp, kp+1 ), lda )
               CALL zcopy( kp-1, a( 1, kk ), 1, a( 1, kp ), 1 )
*
*              Interchange rows KK and KP in last KK columns of A and W
*
               IF( kk.LT.n )
     $            CALL zswap( n-kk, a( kk, kk+1 ), lda, a( kp, kk+1 ),
     $                        lda )
               CALL zswap( n-kk+1, w( kk, kkw ), ldw, w( kp, kkw ),
     $                     ldw )
            END IF
*
            IF( kstep.EQ.1 ) THEN
*
*              1-by-1 pivot block D(k): column KW of W now holds
*
*              W(k) = U(k)*D(k)
*
*              where U(k) is the k-th column of U
*
*              Store U(k) in column k of A
*
               CALL zcopy( k, w( 1, kw ), 1, a( 1, k ), 1 )
               r1 = one / dble( a( k, k ) )
               CALL zdscal( k-1, r1, a( 1, k ), 1 )
*
*              Conjugate W(k)
*
               CALL zlacgv( k-1, w( 1, kw ), 1 )
            ELSE
*
*              2-by-2 pivot block D(k): columns KW and KW-1 of W now
*              hold
*
*              ( W(k-1) W(k) ) = ( U(k-1) U(k) )*D(k)
*
*              where U(k) and U(k-1) are the k-th and (k-1)-th columns
*              of U
*
               IF( k.GT.2 ) THEN
*
*                 Store U(k) and U(k-1) in columns k and k-1 of A
*
                  d21 = w( k-1, kw )
                  d11 = w( k, kw ) / dconjg( d21 )
                  d22 = w( k-1, kw-1 ) / d21
                  t = one / ( dble( d11*d22 )-one )
                  d21 = t / d21
                  DO 20 j = 1, k - 2
                     a( j, k-1 ) = d21*( d11*w( j, kw-1 )-w( j, kw ) )
                     a( j, k ) = dconjg( d21 )*
     $                           ( d22*w( j, kw )-w( j, kw-1 ) )
   20             continue
               END IF
*
*              Copy D(k) to A
*
               a( k-1, k-1 ) = w( k-1, kw-1 )
               a( k-1, k ) = w( k-1, kw )
               a( k, k ) = w( k, kw )
*
*              Conjugate W(k) and W(k-1)
*
               CALL zlacgv( k-1, w( 1, kw ), 1 )
               CALL zlacgv( k-2, w( 1, kw-1 ), 1 )
            END IF
         END IF
*
*        Store details of the interchanges in IPIV
*
         IF( kstep.EQ.1 ) THEN
            ipiv( k ) = kp
         ELSE
            ipiv( k ) = -kp
            ipiv( k-1 ) = -kp
         END IF
*
*        Decrease K and return to the start of the main loop
*
         k = k - kstep
         go to 10
*
   30    continue
*
*        Update the upper triangle of A11 (= A(1:k,1:k)) as
*
*        A11 := A11 - U12*D*U12**H = A11 - U12*W**H
*
*        computing blocks of NB columns at a time (note that conjg(W) is
*        actually stored)
*
         DO 50 j = ( ( k-1 ) / nb )*nb + 1, 1, -nb
            jb = min( nb, k-j+1 )
*
*           Update the upper triangle of the diagonal block
*
            DO 40 jj = j, j + jb - 1
               a( jj, jj ) = dble( a( jj, jj ) )
               CALL zgemv( 'No transpose', jj-j+1, n-k, -cone,
     $                     a( j, k+1 ), lda, w( jj, kw+1 ), ldw, cone,
     $                     a( j, jj ), 1 )
               a( jj, jj ) = dble( a( jj, jj ) )
   40       continue
*
*           Update the rectangular superdiagonal block
*
            CALL zgemm( 'No transpose', 'Transpose', j-1, jb, n-k,
     $                  -cone, a( 1, k+1 ), lda, w( j, kw+1 ), ldw,
     $                  cone, a( 1, j ), lda )
   50    continue
*
*        Put U12 in standard form by partially undoing the interchanges
*        in columns k+1:n
*
         j = k + 1
   60    continue
         jj = j
         jp = ipiv( j )
         IF( jp.LT.0 ) THEN
            jp = -jp
            j = j + 1
         END IF
         j = j + 1
         IF( jp.NE.jj .AND. j.LE.n )
     $      CALL zswap( n-j+1, a( jp, j ), lda, a( jj, j ), lda )
         IF( j.LE.n )
     $      go to 60
*
*        Set KB to the number of columns factorized
*
         kb = n - k
*
      ELSE
*
*        Factorize the leading columns of A using the lower triangle
*        of A and working forwards, and compute the matrix W = L21*D
*        for use in updating A22 (note that conjg(W) is actually stored)
*
*        K is the main loop index, increasing from 1 in steps of 1 or 2
*
         k = 1
   70    continue
*
*        Exit from loop
*
         IF( ( k.GE.nb .AND. nb.LT.n ) .OR. k.GT.n )
     $      go to 90
*
*        Copy column K of A to column K of W and update it
*
         w( k, k ) = dble( a( k, k ) )
         IF( k.LT.n )
     $      CALL zcopy( n-k, a( k+1, k ), 1, w( k+1, k ), 1 )
         CALL zgemv( 'No transpose', n-k+1, k-1, -cone, a( k, 1 ), lda,
     $               w( k, 1 ), ldw, cone, w( k, k ), 1 )
         w( k, k ) = dble( w( k, k ) )
*
         kstep = 1
*
*        Determine rows and columns to be interchanged and whether
*        a 1-by-1 or 2-by-2 pivot block will be used
*
         absakk = abs( dble( w( k, k ) ) )
*
*        IMAX is the row-index of the largest off-diagonal element in
*        column K, and COLMAX is its absolute value
*
         IF( k.LT.n ) THEN
            imax = k + izamax( n-k, w( k+1, k ), 1 )
            colmax = cabs1( w( imax, k ) )
         ELSE
            colmax = zero
         END IF
*
         IF( max( absakk, colmax ).EQ.zero ) THEN
*
*           Column K is zero: set INFO and continue
*
            IF( info.EQ.0 )
     $         info = k
            kp = k
            a( k, k ) = dble( a( k, k ) )
         ELSE
            IF( absakk.GE.alpha*colmax ) THEN
*
*              no interchange, use 1-by-1 pivot block
*
               kp = k
            ELSE
*
*              Copy column IMAX to column K+1 of W and update it
*
               CALL zcopy( imax-k, a( imax, k ), lda, w( k, k+1 ), 1 )
               CALL zlacgv( imax-k, w( k, k+1 ), 1 )
               w( imax, k+1 ) = dble( a( imax, imax ) )
               IF( imax.LT.n )
     $            CALL zcopy( n-imax, a( imax+1, imax ), 1,
     $                        w( imax+1, k+1 ), 1 )
               CALL zgemv( 'No transpose', n-k+1, k-1, -cone, a( k, 1 ),
     $                     lda, w( imax, 1 ), ldw, cone, w( k, k+1 ),
     $                     1 )
               w( imax, k+1 ) = dble( w( imax, k+1 ) )
*
*              JMAX is the column-index of the largest off-diagonal
*              element in row IMAX, and ROWMAX is its absolute value
*
               jmax = k - 1 + izamax( imax-k, w( k, k+1 ), 1 )
               rowmax = cabs1( w( jmax, k+1 ) )
               IF( imax.LT.n ) THEN
                  jmax = imax + izamax( n-imax, w( imax+1, k+1 ), 1 )
                  rowmax = max( rowmax, cabs1( w( jmax, k+1 ) ) )
               END IF
*
               IF( absakk.GE.alpha*colmax*( colmax / rowmax ) ) THEN
*
*                 no interchange, use 1-by-1 pivot block
*
                  kp = k
               ELSE IF( abs( dble( w( imax, k+1 ) ) ).GE.alpha*rowmax )
     $                   THEN
*
*                 interchange rows and columns K and IMAX, use 1-by-1
*                 pivot block
*
                  kp = imax
*
*                 copy column K+1 of W to column K
*
                  CALL zcopy( n-k+1, w( k, k+1 ), 1, w( k, k ), 1 )
               ELSE
*
*                 interchange rows and columns K+1 and IMAX, use 2-by-2
*                 pivot block
*
                  kp = imax
                  kstep = 2
               END IF
            END IF
*
            kk = k + kstep - 1
*
*           Updated column KP is already stored in column KK of W
*
            IF( kp.NE.kk ) THEN
*
*              Copy non-updated column KK to column KP
*
               a( kp, kp ) = dble( a( kk, kk ) )
               CALL zcopy( kp-kk-1, a( kk+1, kk ), 1, a( kp, kk+1 ),
     $                     lda )
               CALL zlacgv( kp-kk-1, a( kp, kk+1 ), lda )
               IF( kp.LT.n )
     $            CALL zcopy( n-kp, a( kp+1, kk ), 1, a( kp+1, kp ), 1 )
*
*              Interchange rows KK and KP in first KK columns of A and W
*
               CALL zswap( kk-1, a( kk, 1 ), lda, a( kp, 1 ), lda )
               CALL zswap( kk, w( kk, 1 ), ldw, w( kp, 1 ), ldw )
            END IF
*
            IF( kstep.EQ.1 ) THEN
*
*              1-by-1 pivot block D(k): column k of W now holds
*
*              W(k) = L(k)*D(k)
*
*              where L(k) is the k-th column of L
*
*              Store L(k) in column k of A
*
               CALL zcopy( n-k+1, w( k, k ), 1, a( k, k ), 1 )
               IF( k.LT.n ) THEN
                  r1 = one / dble( a( k, k ) )
                  CALL zdscal( n-k, r1, a( k+1, k ), 1 )
*
*                 Conjugate W(k)
*
                  CALL zlacgv( n-k, w( k+1, k ), 1 )
               END IF
            ELSE
*
*              2-by-2 pivot block D(k): columns k and k+1 of W now hold
*
*              ( W(k) W(k+1) ) = ( L(k) L(k+1) )*D(k)
*
*              where L(k) and L(k+1) are the k-th and (k+1)-th columns
*              of L
*
               IF( k.LT.n-1 ) THEN
*
*                 Store L(k) and L(k+1) in columns k and k+1 of A
*
                  d21 = w( k+1, k )
                  d11 = w( k+1, k+1 ) / d21
                  d22 = w( k, k ) / dconjg( d21 )
                  t = one / ( dble( d11*d22 )-one )
                  d21 = t / d21
                  DO 80 j = k + 2, n
                     a( j, k ) = dconjg( d21 )*
     $                           ( d11*w( j, k )-w( j, k+1 ) )
                     a( j, k+1 ) = d21*( d22*w( j, k+1 )-w( j, k ) )
   80             continue
               END IF
*
*              Copy D(k) to A
*
               a( k, k ) = w( k, k )
               a( k+1, k ) = w( k+1, k )
               a( k+1, k+1 ) = w( k+1, k+1 )
*
*              Conjugate W(k) and W(k+1)
*
               CALL zlacgv( n-k, w( k+1, k ), 1 )
               CALL zlacgv( n-k-1, w( k+2, k+1 ), 1 )
            END IF
         END IF
*
*        Store details of the interchanges in IPIV
*
         IF( kstep.EQ.1 ) THEN
            ipiv( k ) = kp
         ELSE
            ipiv( k ) = -kp
            ipiv( k+1 ) = -kp
         END IF
*
*        Increase K and return to the start of the main loop
*
         k = k + kstep
         go to 70
*
   90    continue
*
*        Update the lower triangle of A22 (= A(k:n,k:n)) as
*
*        A22 := A22 - L21*D*L21**H = A22 - L21*W**H
*
*        computing blocks of NB columns at a time (note that conjg(W) is
*        actually stored)
*
         DO 110 j = k, n, nb
            jb = min( nb, n-j+1 )
*
*           Update the lower triangle of the diagonal block
*
            DO 100 jj = j, j + jb - 1
               a( jj, jj ) = dble( a( jj, jj ) )
               CALL zgemv( 'No transpose', j+jb-jj, k-1, -cone,
     $                     a( jj, 1 ), lda, w( jj, 1 ), ldw, cone,
     $                     a( jj, jj ), 1 )
               a( jj, jj ) = dble( a( jj, jj ) )
  100       continue
*
*           Update the rectangular subdiagonal block
*
            IF( j+jb.LE.n )
     $         CALL zgemm( 'No transpose', 'Transpose', n-j-jb+1, jb,
     $                     k-1, -cone, a( j+jb, 1 ), lda, w( j, 1 ),
     $                     ldw, cone, a( j+jb, j ), lda )
  110    continue
*
*        Put L21 in standard form by partially undoing the interchanges
*        in columns 1:k-1
*
         j = k - 1
  120    continue
         jj = j
         jp = ipiv( j )
         IF( jp.LT.0 ) THEN
            jp = -jp
            j = j - 1
         END IF
         j = j - 1
         IF( jp.NE.jj .AND. j.GE.1 )
     $      CALL zswap( j, a( jp, 1 ), lda, a( jj, 1 ), lda )
         IF( j.GE.1 )
     $      go to 120
*
*        Set KB to the number of columns factorized
*
         kb = k - 1
*
      END IF
      return
*
*     End of ZLAHEF
*
      END