clatmt.f

Go to the documentation of this file.

*> \brief \b CLATMT
*
*  =========== DOCUMENTATION ===========
*
* Online html documentation available at
*            http://www.netlib.org/lapack/explore-html/
*
*  Definition:
*  ===========
*
*       SUBROUTINE CLATMT( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX,
*                          RANK, KL, KU, PACK, A, LDA, WORK, INFO )
*
*       .. Scalar Arguments ..
*       REAL               COND, DMAX
*       INTEGER            INFO, KL, KU, LDA, M, MODE, N, RANK
*       CHARACTER          DIST, PACK, SYM
*       ..
*       .. Array Arguments ..
*       COMPLEX            A( LDA, * ), WORK( * )
*       REAL               D( * )
*       INTEGER            ISEED( 4 )
*       ..
*
*
*> \par Purpose:
*  =============
*>
*> \verbatim
*>
*>    CLATMT generates random matrices with specified singular values
*>    (or hermitian with specified eigenvalues)
*>    for testing LAPACK programs.
*>
*>    CLATMT operates by applying the following sequence of
*>    operations:
*>
*>      Set the diagonal to D, where D may be input or
*>         computed according to MODE, COND, DMAX, and SYM
*>         as described below.
*>
*>      Generate a matrix with the appropriate band structure, by one
*>         of two methods:
*>
*>      Method A:
*>          Generate a dense M x N matrix by multiplying D on the left
*>              and the right by random unitary matrices, then:
*>
*>          Reduce the bandwidth according to KL and KU, using
*>              Householder transformations.
*>
*>      Method B:
*>          Convert the bandwidth-0 (i.e., diagonal) matrix to a
*>              bandwidth-1 matrix using Givens rotations, "chasing"
*>              out-of-band elements back, much as in QR; then convert
*>              the bandwidth-1 to a bandwidth-2 matrix, etc.  Note
*>              that for reasonably small bandwidths (relative to M and
*>              N) this requires less storage, as a dense matrix is not
*>              generated.  Also, for hermitian or symmetric matrices,
*>              only one triangle is generated.
*>
*>      Method A is chosen if the bandwidth is a large fraction of the
*>          order of the matrix, and LDA is at least M (so a dense
*>          matrix can be stored.)  Method B is chosen if the bandwidth
*>          is small (< 1/2 N for hermitian or symmetric, < .3 N+M for
*>          non-symmetric), or LDA is less than M and not less than the
*>          bandwidth.
*>
*>      Pack the matrix if desired. Options specified by PACK are:
*>         no packing
*>         zero out upper half (if hermitian)
*>         zero out lower half (if hermitian)
*>         store the upper half columnwise (if hermitian or upper
*>               triangular)
*>         store the lower half columnwise (if hermitian or lower
*>               triangular)
*>         store the lower triangle in banded format (if hermitian or
*>               lower triangular)
*>         store the upper triangle in banded format (if hermitian or
*>               upper triangular)
*>         store the entire matrix in banded format
*>      If Method B is chosen, and band format is specified, then the
*>         matrix will be generated in the band format, so no repacking
*>         will be necessary.
*> \endverbatim
*
*  Arguments:
*  ==========
*
*> \param[in] M
*> \verbatim
*>          M is INTEGER
*>           The number of rows of A. Not modified.
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*>          N is INTEGER
*>           The number of columns of A. N must equal M if the matrix
*>           is symmetric or hermitian (i.e., if SYM is not 'N')
*>           Not modified.
*> \endverbatim
*>
*> \param[in] DIST
*> \verbatim
*>          DIST is CHARACTER*1
*>           On entry, DIST specifies the type of distribution to be used
*>           to generate the random eigen-/singular values.
*>           'U' => UNIFORM( 0, 1 )  ( 'U' for uniform )
*>           'S' => UNIFORM( -1, 1 ) ( 'S' for symmetric )
*>           'N' => NORMAL( 0, 1 )   ( 'N' for normal )
*>           Not modified.
*> \endverbatim
*>
*> \param[in,out] ISEED
*> \verbatim
*>          ISEED is INTEGER array, dimension ( 4 )
*>           On entry ISEED specifies the seed of the random number
*>           generator. They should lie between 0 and 4095 inclusive,
*>           and ISEED(4) should be odd. The random number generator
*>           uses a linear congruential sequence limited to small
*>           integers, and so should produce machine independent
*>           random numbers. The values of ISEED are changed on
*>           exit, and can be used in the next call to CLATMT
*>           to continue the same random number sequence.
*>           Changed on exit.
*> \endverbatim
*>
*> \param[in] SYM
*> \verbatim
*>          SYM is CHARACTER*1
*>           If SYM='H', the generated matrix is hermitian, with
*>             eigenvalues specified by D, COND, MODE, and DMAX; they
*>             may be positive, negative, or zero.
*>           If SYM='P', the generated matrix is hermitian, with
*>             eigenvalues (= singular values) specified by D, COND,
*>             MODE, and DMAX; they will not be negative.
*>           If SYM='N', the generated matrix is nonsymmetric, with
*>             singular values specified by D, COND, MODE, and DMAX;
*>             they will not be negative.
*>           If SYM='S', the generated matrix is (complex) symmetric,
*>             with singular values specified by D, COND, MODE, and
*>             DMAX; they will not be negative.
*>           Not modified.
*> \endverbatim
*>
*> \param[in,out] D
*> \verbatim
*>          D is REAL array, dimension ( MIN( M, N ) )
*>           This array is used to specify the singular values or
*>           eigenvalues of A (see SYM, above.)  If MODE=0, then D is
*>           assumed to contain the singular/eigenvalues, otherwise
*>           they will be computed according to MODE, COND, and DMAX,
*>           and placed in D.
*>           Modified if MODE is nonzero.
*> \endverbatim
*>
*> \param[in] MODE
*> \verbatim
*>          MODE is INTEGER
*>           On entry this describes how the singular/eigenvalues are to
*>           be specified:
*>           MODE = 0 means use D as input
*>           MODE = 1 sets D(1)=1 and D(2:RANK)=1.0/COND
*>           MODE = 2 sets D(1:RANK-1)=1 and D(RANK)=1.0/COND
*>           MODE = 3 sets D(I)=COND**(-(I-1)/(RANK-1))
*>           MODE = 4 sets D(i)=1 - (i-1)/(N-1)*(1 - 1/COND)
*>           MODE = 5 sets D to random numbers in the range
*>                    ( 1/COND , 1 ) such that their logarithms
*>                    are uniformly distributed.
*>           MODE = 6 set D to random numbers from same distribution
*>                    as the rest of the matrix.
*>           MODE < 0 has the same meaning as ABS(MODE), except that
*>              the order of the elements of D is reversed.
*>           Thus if MODE is positive, D has entries ranging from
*>              1 to 1/COND, if negative, from 1/COND to 1,
*>           If SYM='H', and MODE is neither 0, 6, nor -6, then
*>              the elements of D will also be multiplied by a random
*>              sign (i.e., +1 or -1.)
*>           Not modified.
*> \endverbatim
*>
*> \param[in] COND
*> \verbatim
*>          COND is REAL
*>           On entry, this is used as described under MODE above.
*>           If used, it must be >= 1. Not modified.
*> \endverbatim
*>
*> \param[in] DMAX
*> \verbatim
*>          DMAX is REAL
*>           If MODE is neither -6, 0 nor 6, the contents of D, as
*>           computed according to MODE and COND, will be scaled by
*>           DMAX / max(abs(D(i))); thus, the maximum absolute eigen- or
*>           singular value (which is to say the norm) will be abs(DMAX).
*>           Note that DMAX need not be positive: if DMAX is negative
*>           (or zero), D will be scaled by a negative number (or zero).
*>           Not modified.
*> \endverbatim
*>
*> \param[in] RANK
*> \verbatim
*>          RANK is INTEGER
*>           The rank of matrix to be generated for modes 1,2,3 only.
*>           D( RANK+1:N ) = 0.
*>           Not modified.
*> \endverbatim
*>
*> \param[in] KL
*> \verbatim
*>          KL is INTEGER
*>           This specifies the lower bandwidth of the  matrix. For
*>           example, KL=0 implies upper triangular, KL=1 implies upper
*>           Hessenberg, and KL being at least M-1 means that the matrix
*>           has full lower bandwidth.  KL must equal KU if the matrix
*>           is symmetric or hermitian.
*>           Not modified.
*> \endverbatim
*>
*> \param[in] KU
*> \verbatim
*>          KU is INTEGER
*>           This specifies the upper bandwidth of the  matrix. For
*>           example, KU=0 implies lower triangular, KU=1 implies lower
*>           Hessenberg, and KU being at least N-1 means that the matrix
*>           has full upper bandwidth.  KL must equal KU if the matrix
*>           is symmetric or hermitian.
*>           Not modified.
*> \endverbatim
*>
*> \param[in] PACK
*> \verbatim
*>          PACK is CHARACTER*1
*>           This specifies packing of matrix as follows:
*>           'N' => no packing
*>           'U' => zero out all subdiagonal entries (if symmetric
*>                  or hermitian)
*>           'L' => zero out all superdiagonal entries (if symmetric
*>                  or hermitian)
*>           'C' => store the upper triangle columnwise (only if the
*>                  matrix is symmetric, hermitian, or upper triangular)
*>           'R' => store the lower triangle columnwise (only if the
*>                  matrix is symmetric, hermitian, or lower triangular)
*>           'B' => store the lower triangle in band storage scheme
*>                  (only if the matrix is symmetric, hermitian, or
*>                  lower triangular)
*>           'Q' => store the upper triangle in band storage scheme
*>                  (only if the matrix is symmetric, hermitian, or
*>                  upper triangular)
*>           'Z' => store the entire matrix in band storage scheme
*>                      (pivoting can be provided for by using this
*>                      option to store A in the trailing rows of
*>                      the allocated storage)
*>
*>           Using these options, the various LAPACK packed and banded
*>           storage schemes can be obtained:
*>           GB                    - use 'Z'
*>           PB, SB, HB, or TB     - use 'B' or 'Q'
*>           PP, SP, HB, or TP     - use 'C' or 'R'
*>
*>           If two calls to CLATMT differ only in the PACK parameter,
*>           they will generate mathematically equivalent matrices.
*>           Not modified.
*> \endverbatim
*>
*> \param[in,out] A
*> \verbatim
*>          A is COMPLEX array, dimension ( LDA, N )
*>           On exit A is the desired test matrix.  A is first generated
*>           in full (unpacked) form, and then packed, if so specified
*>           by PACK.  Thus, the first M elements of the first N
*>           columns will always be modified.  If PACK specifies a
*>           packed or banded storage scheme, all LDA elements of the
*>           first N columns will be modified; the elements of the
*>           array which do not correspond to elements of the generated
*>           matrix are set to zero.
*>           Modified.
*> \endverbatim
*>
*> \param[in] LDA
*> \verbatim
*>          LDA is INTEGER
*>           LDA specifies the first dimension of A as declared in the
*>           calling program.  If PACK='N', 'U', 'L', 'C', or 'R', then
*>           LDA must be at least M.  If PACK='B' or 'Q', then LDA must
*>           be at least MIN( KL, M-1) (which is equal to MIN(KU,N-1)).
*>           If PACK='Z', LDA must be large enough to hold the packed
*>           array: MIN( KU, N-1) + MIN( KL, M-1) + 1.
*>           Not modified.
*> \endverbatim
*>
*> \param[out] WORK
*> \verbatim
*>          WORK is COMPLEX array, dimension ( 3*MAX( N, M ) )
*>           Workspace.
*>           Modified.
*> \endverbatim
*>
*> \param[out] INFO
*> \verbatim
*>          INFO is INTEGER
*>           Error code.  On exit, INFO will be set to one of the
*>           following values:
*>             0 => normal return
*>            -1 => M negative or unequal to N and SYM='S', 'H', or 'P'
*>            -2 => N negative
*>            -3 => DIST illegal string
*>            -5 => SYM illegal string
*>            -7 => MODE not in range -6 to 6
*>            -8 => COND less than 1.0, and MODE neither -6, 0 nor 6
*>           -10 => KL negative
*>           -11 => KU negative, or SYM is not 'N' and KU is not equal to
*>                  KL
*>           -12 => PACK illegal string, or PACK='U' or 'L', and SYM='N';
*>                  or PACK='C' or 'Q' and SYM='N' and KL is not zero;
*>                  or PACK='R' or 'B' and SYM='N' and KU is not zero;
*>                  or PACK='U', 'L', 'C', 'R', 'B', or 'Q', and M is not
*>                  N.
*>           -14 => LDA is less than M, or PACK='Z' and LDA is less than
*>                  MIN(KU,N-1) + MIN(KL,M-1) + 1.
*>            1  => Error return from SLATM7
*>            2  => Cannot scale to DMAX (max. sing. value is 0)
*>            3  => Error return from CLAGGE, CLAGHE or CLAGSY
*> \endverbatim
*
*  Authors:
*  ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \ingroup complex_matgen
*
*  =====================================================================
      SUBROUTINE clatmt( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX,
     $                   RANK, KL, KU, PACK, A, LDA, WORK, INFO )
*
*  -- LAPACK computational routine --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*
*     .. Scalar Arguments ..
      REAL               COND, DMAX
      INTEGER            INFO, KL, KU, LDA, M, MODE, N, RANK
      CHARACTER          DIST, PACK, SYM
*     ..
*     .. Array Arguments ..
      COMPLEX            A( LDA, * ), WORK( * )
      REAL               D( * )
      INTEGER            ISEED( 4 )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      REAL               ZERO
      parameter( zero = 0.0e+0 )
      REAL               ONE
      parameter( one = 1.0e+0 )
      COMPLEX            CZERO
      parameter( czero = ( 0.0e+0, 0.0e+0 ) )
      REAL               TWOPI
      parameter( twopi = 6.28318530717958647692528676655900576839e+0 )
*     ..
*     .. Local Scalars ..
      COMPLEX            C, CT, CTEMP, DUMMY, EXTRA, S, ST
      REAL               ALPHA, ANGLE, REALC, TEMP
      INTEGER            I, IC, ICOL, IDIST, IENDCH, IINFO, IL, ILDA,
     $                   ioffg, ioffst, ipack, ipackg, ir, ir1, ir2,
     $                   irow, irsign, iskew, isym, isympk, j, jc, jch,
     $                   jkl, jku, jr, k, llb, minlda, mnmin, mr, nc,
     $                   uub
      LOGICAL            CSYM, GIVENS, ILEXTR, ILTEMP, TOPDWN
*     ..
*     .. External Functions ..
      COMPLEX            CLARND
      REAL               SLARND
      LOGICAL            LSAME
      EXTERNAL           clarnd, slarnd, lsame
*     ..
*     .. External Subroutines ..
      EXTERNAL           clagge, claghe, clagsy, clarot, clartg, claset,
     $                   slatm7, sscal, xerbla
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          abs, cmplx, conjg, cos, max, min, mod, real,
     $                   sin
*     ..
*     .. Executable Statements ..
*
*     1)      Decode and Test the input parameters.
*             Initialize flags & seed.
*
      info = 0
*
*     Quick return if possible
*
      IF( m.EQ.0 .OR. n.EQ.0 )
     $   RETURN
*
*     Decode DIST
*
      IF( lsame( dist, 'U' ) ) THEN
         idist = 1
      ELSE IF( lsame( dist, 'S' ) ) THEN
         idist = 2
      ELSE IF( lsame( dist, 'N' ) ) THEN
         idist = 3
      ELSE
         idist = -1
      END IF
*
*     Decode SYM
*
      IF( lsame( sym, 'N' ) ) THEN
         isym = 1
         irsign = 0
         csym = .false.
      ELSE IF( lsame( sym, 'P' ) ) THEN
         isym = 2
         irsign = 0
         csym = .false.
      ELSE IF( lsame( sym, 'S' ) ) THEN
         isym = 2
         irsign = 0
         csym = .true.
      ELSE IF( lsame( sym, 'H' ) ) THEN
         isym = 2
         irsign = 1
         csym = .false.
      ELSE
         isym = -1
      END IF
*
*     Decode PACK
*
      isympk = 0
      IF( lsame( pack, 'N' ) ) THEN
         ipack = 0
      ELSE IF( lsame( pack, 'U' ) ) THEN
         ipack = 1
         isympk = 1
      ELSE IF( lsame( pack, 'L' ) ) THEN
         ipack = 2
         isympk = 1
      ELSE IF( lsame( pack, 'C' ) ) THEN
         ipack = 3
         isympk = 2
      ELSE IF( lsame( pack, 'R' ) ) THEN
         ipack = 4
         isympk = 3
      ELSE IF( lsame( pack, 'B' ) ) THEN
         ipack = 5
         isympk = 3
      ELSE IF( lsame( pack, 'Q' ) ) THEN
         ipack = 6
         isympk = 2
      ELSE IF( lsame( pack, 'Z' ) ) THEN
         ipack = 7
      ELSE
         ipack = -1
      END IF
*
*     Set certain internal parameters
*
      mnmin = min( m, n )
      llb = min( kl, m-1 )
      uub = min( ku, n-1 )
      mr = min( m, n+llb )
      nc = min( n, m+uub )
*
      IF( ipack.EQ.5 .OR. ipack.EQ.6 ) THEN
         minlda = uub + 1
      ELSE IF( ipack.EQ.7 ) THEN
         minlda = llb + uub + 1
      ELSE
         minlda = m
      END IF
*
*     Use Givens rotation method if bandwidth small enough,
*     or if LDA is too small to store the matrix unpacked.
*
      givens = .false.
      IF( isym.EQ.1 ) THEN
         IF( real( llb+uub ).LT.0.3*real( max( 1, mr+nc ) ) )
     $      givens = .true.
      ELSE
         IF( 2*llb.LT.m )
     $      givens = .true.
      END IF
      IF( lda.LT.m .AND. lda.GE.minlda )
     $   givens = .true.
*
*     Set INFO if an error
*
      IF( m.LT.0 ) THEN
         info = -1
      ELSE IF( m.NE.n .AND. isym.NE.1 ) THEN
         info = -1
      ELSE IF( n.LT.0 ) THEN
         info = -2
      ELSE IF( idist.EQ.-1 ) THEN
         info = -3
      ELSE IF( isym.EQ.-1 ) THEN
         info = -5
      ELSE IF( abs( mode ).GT.6 ) THEN
         info = -7
      ELSE IF( ( mode.NE.0 .AND. abs( mode ).NE.6 ) .AND. cond.LT.one )
     $         THEN
         info = -8
      ELSE IF( kl.LT.0 ) THEN
         info = -10
      ELSE IF( ku.LT.0 .OR. ( isym.NE.1 .AND. kl.NE.ku ) ) THEN
         info = -11
      ELSE IF( ipack.EQ.-1 .OR. ( isympk.EQ.1 .AND. isym.EQ.1 ) .OR.
     $         ( isympk.EQ.2 .AND. isym.EQ.1 .AND. kl.GT.0 ) .OR.
     $         ( isympk.EQ.3 .AND. isym.EQ.1 .AND. ku.GT.0 ) .OR.
     $         ( isympk.NE.0 .AND. m.NE.n ) ) THEN
         info = -12
      ELSE IF( lda.LT.max( 1, minlda ) ) THEN
         info = -14
      END IF
*
      IF( info.NE.0 ) THEN
         CALL xerbla( 'CLATMT', -info )
         RETURN
      END IF
*
*     Initialize random number generator
*
      DO 100 i = 1, 4
         iseed( i ) = mod( abs( iseed( i ) ), 4096 )
  100 CONTINUE
*
      IF( mod( iseed( 4 ), 2 ).NE.1 )
     $   iseed( 4 ) = iseed( 4 ) + 1
*
*     2)      Set up D  if indicated.
*
*             Compute D according to COND and MODE
*
      CALL slatm7( mode, cond, irsign, idist, iseed, d, mnmin, rank,
     $             iinfo )
      IF( iinfo.NE.0 ) THEN
         info = 1
         RETURN
      END IF
*
*     Choose Top-Down if D is (apparently) increasing,
*     Bottom-Up if D is (apparently) decreasing.
*
      IF( abs( d( 1 ) ).LE.abs( d( rank ) ) ) THEN
         topdwn = .true.
      ELSE
         topdwn = .false.
      END IF
*
      IF( mode.NE.0 .AND. abs( mode ).NE.6 ) THEN
*
*        Scale by DMAX
*
         temp = abs( d( 1 ) )
         DO 110 i = 2, rank
            temp = max( temp, abs( d( i ) ) )
  110    CONTINUE
*
         IF( temp.GT.zero ) THEN
            alpha = dmax / temp
         ELSE
            info = 2
            RETURN
         END IF
*
         CALL sscal( rank, alpha, d, 1 )
*
      END IF
*
      CALL claset( 'Full', lda, n, czero, czero, a, lda )
*
*     3)      Generate Banded Matrix using Givens rotations.
*             Also the special case of UUB=LLB=0
*
*               Compute Addressing constants to cover all
*               storage formats.  Whether GE, HE, SY, GB, HB, or SB,
*               upper or lower triangle or both,
*               the (i,j)-th element is in
*               A( i - ISKEW*j + IOFFST, j )
*
      IF( ipack.GT.4 ) THEN
         ilda = lda - 1
         iskew = 1
         IF( ipack.GT.5 ) THEN
            ioffst = uub + 1
         ELSE
            ioffst = 1
         END IF
      ELSE
         ilda = lda
         iskew = 0
         ioffst = 0
      END IF
*
*     IPACKG is the format that the matrix is generated in. If this is
*     different from IPACK, then the matrix must be repacked at the
*     end.  It also signals how to compute the norm, for scaling.
*
      ipackg = 0
*
*     Diagonal Matrix -- We are done, unless it
*     is to be stored HP/SP/PP/TP (PACK='R' or 'C')
*
      IF( llb.EQ.0 .AND. uub.EQ.0 ) THEN
         DO 120 j = 1, mnmin
            a( ( 1-iskew )*j+ioffst, j ) = cmplx( d( j ) )
  120    CONTINUE
*
         IF( ipack.LE.2 .OR. ipack.GE.5 )
     $      ipackg = ipack
*
      ELSE IF( givens ) THEN
*
*        Check whether to use Givens rotations,
*        Householder transformations, or nothing.
*
         IF( isym.EQ.1 ) THEN
*
*           Non-symmetric -- A = U D V
*
            IF( ipack.GT.4 ) THEN
               ipackg = ipack
            ELSE
               ipackg = 0
            END IF
*
            DO 130 j = 1, mnmin
               a( ( 1-iskew )*j+ioffst, j ) = cmplx( d( j ) )
  130       CONTINUE
*
            IF( topdwn ) THEN
               jkl = 0
               DO 160 jku = 1, uub
*
*                 Transform from bandwidth JKL, JKU-1 to JKL, JKU
*
*                 Last row actually rotated is M
*                 Last column actually rotated is MIN( M+JKU, N )
*
                  DO 150 jr = 1, min( m+jku, n ) + jkl - 1
                     extra = czero
                     angle = twopi*slarnd( 1, iseed )
                     c = cos( angle )*clarnd( 5, iseed )
                     s = sin( angle )*clarnd( 5, iseed )
                     icol = max( 1, jr-jkl )
                     IF( jr.LT.m ) THEN
                        il = min( n, jr+jku ) + 1 - icol
                        CALL clarot( .true., jr.GT.jkl, .false., il, c,
     $                               s, a( jr-iskew*icol+ioffst, icol ),
     $                               ilda, extra, dummy )
                     END IF
*
*                    Chase "EXTRA" back up
*
                     ir = jr
                     ic = icol
                     DO 140 jch = jr - jkl, 1, -jkl - jku
                        IF( ir.LT.m ) THEN
                           CALL clartg( a( ir+1-iskew*( ic+1 )+ioffst,
     $                                  ic+1 ), extra, realc, s, dummy )
                           dummy = clarnd( 5, iseed )
                           c = conjg( realc*dummy )
                           s = conjg( -s*dummy )
                        END IF
                        irow = max( 1, jch-jku )
                        il = ir + 2 - irow
                        ctemp = czero
                        iltemp = jch.GT.jku
                        CALL clarot( .false., iltemp, .true., il, c, s,
     $                               a( irow-iskew*ic+ioffst, ic ),
     $                               ilda, ctemp, extra )
                        IF( iltemp ) THEN
                           CALL clartg( a( irow+1-iskew*( ic+1 )+ioffst,
     $                                  ic+1 ), ctemp, realc, s, dummy )
                           dummy = clarnd( 5, iseed )
                           c = conjg( realc*dummy )
                           s = conjg( -s*dummy )
*
                           icol = max( 1, jch-jku-jkl )
                           il = ic + 2 - icol
                           extra = czero
                           CALL clarot( .true., jch.GT.jku+jkl, .true.,
     $                                  il, c, s, a( irow-iskew*icol+
     $                                  ioffst, icol ), ilda, extra,
     $                                  ctemp )
                           ic = icol
                           ir = irow
                        END IF
  140                CONTINUE
  150             CONTINUE
  160          CONTINUE
*
               jku = uub
               DO 190 jkl = 1, llb
*
*                 Transform from bandwidth JKL-1, JKU to JKL, JKU
*
                  DO 180 jc = 1, min( n+jkl, m ) + jku - 1
                     extra = czero
                     angle = twopi*slarnd( 1, iseed )
                     c = cos( angle )*clarnd( 5, iseed )
                     s = sin( angle )*clarnd( 5, iseed )
                     irow = max( 1, jc-jku )
                     IF( jc.LT.n ) THEN
                        il = min( m, jc+jkl ) + 1 - irow
                        CALL clarot( .false., jc.GT.jku, .false., il, c,
     $                               s, a( irow-iskew*jc+ioffst, jc ),
     $                               ilda, extra, dummy )
                     END IF
*
*                    Chase "EXTRA" back up
*
                     ic = jc
                     ir = irow
                     DO 170 jch = jc - jku, 1, -jkl - jku
                        IF( ic.LT.n ) THEN
                           CALL clartg( a( ir+1-iskew*( ic+1 )+ioffst,
     $                                  ic+1 ), extra, realc, s, dummy )
                           dummy = clarnd( 5, iseed )
                           c = conjg( realc*dummy )
                           s = conjg( -s*dummy )
                        END IF
                        icol = max( 1, jch-jkl )
                        il = ic + 2 - icol
                        ctemp = czero
                        iltemp = jch.GT.jkl
                        CALL clarot( .true., iltemp, .true., il, c, s,
     $                               a( ir-iskew*icol+ioffst, icol ),
     $                               ilda, ctemp, extra )
                        IF( iltemp ) THEN
                           CALL clartg( a( ir+1-iskew*( icol+1 )+ioffst,
     $                                  icol+1 ), ctemp, realc, s,
     $                                  dummy )
                           dummy = clarnd( 5, iseed )
                           c = conjg( realc*dummy )
                           s = conjg( -s*dummy )
                           irow = max( 1, jch-jkl-jku )
                           il = ir + 2 - irow
                           extra = czero
                           CALL clarot( .false., jch.GT.jkl+jku, .true.,
     $                                  il, c, s, a( irow-iskew*icol+
     $                                  ioffst, icol ), ilda, extra,
     $                                  ctemp )
                           ic = icol
                           ir = irow
                        END IF
  170                CONTINUE
  180             CONTINUE
  190          CONTINUE
*
            ELSE
*
*              Bottom-Up -- Start at the bottom right.
*
               jkl = 0
               DO 220 jku = 1, uub
*
*                 Transform from bandwidth JKL, JKU-1 to JKL, JKU
*
*                 First row actually rotated is M
*                 First column actually rotated is MIN( M+JKU, N )
*
                  iendch = min( m, n+jkl ) - 1
                  DO 210 jc = min( m+jku, n ) - 1, 1 - jkl, -1
                     extra = czero
                     angle = twopi*slarnd( 1, iseed )
                     c = cos( angle )*clarnd( 5, iseed )
                     s = sin( angle )*clarnd( 5, iseed )
                     irow = max( 1, jc-jku+1 )
                     IF( jc.GT.0 ) THEN
                        il = min( m, jc+jkl+1 ) + 1 - irow
                        CALL clarot( .false., .false., jc+jkl.LT.m, il,
     $                               c, s, a( irow-iskew*jc+ioffst,
     $                               jc ), ilda, dummy, extra )
                     END IF
*
*                    Chase "EXTRA" back down
*
                     ic = jc
                     DO 200 jch = jc + jkl, iendch, jkl + jku
                        ilextr = ic.GT.0
                        IF( ilextr ) THEN
                           CALL clartg( a( jch-iskew*ic+ioffst, ic ),
     $                                  extra, realc, s, dummy )
                           dummy = clarnd( 5, iseed )
                           c = realc*dummy
                           s = s*dummy
                        END IF
                        ic = max( 1, ic )
                        icol = min( n-1, jch+jku )
                        iltemp = jch + jku.LT.n
                        ctemp = czero
                        CALL clarot( .true., ilextr, iltemp, icol+2-ic,
     $                               c, s, a( jch-iskew*ic+ioffst, ic ),
     $                               ilda, extra, ctemp )
                        IF( iltemp ) THEN
                           CALL clartg( a( jch-iskew*icol+ioffst,
     $                                  icol ), ctemp, realc, s, dummy )
                           dummy = clarnd( 5, iseed )
                           c = realc*dummy
                           s = s*dummy
                           il = min( iendch, jch+jkl+jku ) + 2 - jch
                           extra = czero
                           CALL clarot( .false., .true.,
     $                                  jch+jkl+jku.LE.iendch, il, c, s,
     $                                  a( jch-iskew*icol+ioffst,
     $                                  icol ), ilda, ctemp, extra )
                           ic = icol
                        END IF
  200                CONTINUE
  210             CONTINUE
  220          CONTINUE
*
               jku = uub
               DO 250 jkl = 1, llb
*
*                 Transform from bandwidth JKL-1, JKU to JKL, JKU
*
*                 First row actually rotated is MIN( N+JKL, M )
*                 First column actually rotated is N
*
                  iendch = min( n, m+jku ) - 1
                  DO 240 jr = min( n+jkl, m ) - 1, 1 - jku, -1
                     extra = czero
                     angle = twopi*slarnd( 1, iseed )
                     c = cos( angle )*clarnd( 5, iseed )
                     s = sin( angle )*clarnd( 5, iseed )
                     icol = max( 1, jr-jkl+1 )
                     IF( jr.GT.0 ) THEN
                        il = min( n, jr+jku+1 ) + 1 - icol
                        CALL clarot( .true., .false., jr+jku.LT.n, il,
     $                               c, s, a( jr-iskew*icol+ioffst,
     $                               icol ), ilda, dummy, extra )
                     END IF
*
*                    Chase "EXTRA" back down
*
                     ir = jr
                     DO 230 jch = jr + jku, iendch, jkl + jku
                        ilextr = ir.GT.0
                        IF( ilextr ) THEN
                           CALL clartg( a( ir-iskew*jch+ioffst, jch ),
     $                                  extra, realc, s, dummy )
                           dummy = clarnd( 5, iseed )
                           c = realc*dummy
                           s = s*dummy
                        END IF
                        ir = max( 1, ir )
                        irow = min( m-1, jch+jkl )
                        iltemp = jch + jkl.LT.m
                        ctemp = czero
                        CALL clarot( .false., ilextr, iltemp, irow+2-ir,
     $                               c, s, a( ir-iskew*jch+ioffst,
     $                               jch ), ilda, extra, ctemp )
                        IF( iltemp ) THEN
                           CALL clartg( a( irow-iskew*jch+ioffst, jch ),
     $                                  ctemp, realc, s, dummy )
                           dummy = clarnd( 5, iseed )
                           c = realc*dummy
                           s = s*dummy
                           il = min( iendch, jch+jkl+jku ) + 2 - jch
                           extra = czero
                           CALL clarot( .true., .true.,
     $                                  jch+jkl+jku.LE.iendch, il, c, s,
     $                                  a( irow-iskew*jch+ioffst, jch ),
     $                                  ilda, ctemp, extra )
                           ir = irow
                        END IF
  230                CONTINUE
  240             CONTINUE
  250          CONTINUE
*
            END IF
*
         ELSE
*
*           Symmetric -- A = U D U'
*           Hermitian -- A = U D U*
*
            ipackg = ipack
            ioffg = ioffst
*
            IF( topdwn ) THEN
*
*              Top-Down -- Generate Upper triangle only
*
               IF( ipack.GE.5 ) THEN
                  ipackg = 6
                  ioffg = uub + 1
               ELSE
                  ipackg = 1
               END IF
*
               DO 260 j = 1, mnmin
                  a( ( 1-iskew )*j+ioffg, j ) = cmplx( d( j ) )
  260          CONTINUE
*
               DO 290 k = 1, uub
                  DO 280 jc = 1, n - 1
                     irow = max( 1, jc-k )
                     il = min( jc+1, k+2 )
                     extra = czero
                     ctemp = a( jc-iskew*( jc+1 )+ioffg, jc+1 )
                     angle = twopi*slarnd( 1, iseed )
                     c = cos( angle )*clarnd( 5, iseed )
                     s = sin( angle )*clarnd( 5, iseed )
                     IF( csym ) THEN
                        ct = c
                        st = s
                     ELSE
                        ctemp = conjg( ctemp )
                        ct = conjg( c )
                        st = conjg( s )
                     END IF
                     CALL clarot( .false., jc.GT.k, .true., il, c, s,
     $                            a( irow-iskew*jc+ioffg, jc ), ilda,
     $                            extra, ctemp )
                     CALL clarot( .true., .true., .false.,
     $                            min( k, n-jc )+1, ct, st,
     $                            a( ( 1-iskew )*jc+ioffg, jc ), ilda,
     $                            ctemp, dummy )
*
*                    Chase EXTRA back up the matrix
*
                     icol = jc
                     DO 270 jch = jc - k, 1, -k
                        CALL clartg( a( jch+1-iskew*( icol+1 )+ioffg,
     $                               icol+1 ), extra, realc, s, dummy )
                        dummy = clarnd( 5, iseed )
                        c = conjg( realc*dummy )
                        s = conjg( -s*dummy )
                        ctemp = a( jch-iskew*( jch+1 )+ioffg, jch+1 )
                        IF( csym ) THEN
                           ct = c
                           st = s
                        ELSE
                           ctemp = conjg( ctemp )
                           ct = conjg( c )
                           st = conjg( s )
                        END IF
                        CALL clarot( .true., .true., .true., k+2, c, s,
     $                               a( ( 1-iskew )*jch+ioffg, jch ),
     $                               ilda, ctemp, extra )
                        irow = max( 1, jch-k )
                        il = min( jch+1, k+2 )
                        extra = czero
                        CALL clarot( .false., jch.GT.k, .true., il, ct,
     $                               st, a( irow-iskew*jch+ioffg, jch ),
     $                               ilda, extra, ctemp )
                        icol = jch
  270                CONTINUE
  280             CONTINUE
  290          CONTINUE
*
*              If we need lower triangle, copy from upper. Note that
*              the order of copying is chosen to work for 'q' -> 'b'
*
               IF( ipack.NE.ipackg .AND. ipack.NE.3 ) THEN
                  DO 320 jc = 1, n
                     irow = ioffst - iskew*jc
                     IF( csym ) THEN
                        DO 300 jr = jc, min( n, jc+uub )
                           a( jr+irow, jc ) = a( jc-iskew*jr+ioffg, jr )
  300                   CONTINUE
                     ELSE
                        DO 310 jr = jc, min( n, jc+uub )
                           a( jr+irow, jc ) = conjg( a( jc-iskew*jr+
     $                                        ioffg, jr ) )
  310                   CONTINUE
                     END IF
  320             CONTINUE
                  IF( ipack.EQ.5 ) THEN
                     DO 340 jc = n - uub + 1, n
                        DO 330 jr = n + 2 - jc, uub + 1
                           a( jr, jc ) = czero
  330                   CONTINUE
  340                CONTINUE
                  END IF
                  IF( ipackg.EQ.6 ) THEN
                     ipackg = ipack
                  ELSE
                     ipackg = 0
                  END IF
               END IF
            ELSE
*
*              Bottom-Up -- Generate Lower triangle only
*
               IF( ipack.GE.5 ) THEN
                  ipackg = 5
                  IF( ipack.EQ.6 )
     $               ioffg = 1
               ELSE
                  ipackg = 2
               END IF
*
               DO 350 j = 1, mnmin
                  a( ( 1-iskew )*j+ioffg, j ) = cmplx( d( j ) )
  350          CONTINUE
*
               DO 380 k = 1, uub
                  DO 370 jc = n - 1, 1, -1
                     il = min( n+1-jc, k+2 )
                     extra = czero
                     ctemp = a( 1+( 1-iskew )*jc+ioffg, jc )
                     angle = twopi*slarnd( 1, iseed )
                     c = cos( angle )*clarnd( 5, iseed )
                     s = sin( angle )*clarnd( 5, iseed )
                     IF( csym ) THEN
                        ct = c
                        st = s
                     ELSE
                        ctemp = conjg( ctemp )
                        ct = conjg( c )
                        st = conjg( s )
                     END IF
                     CALL clarot( .false., .true., n-jc.GT.k, il, c, s,
     $                            a( ( 1-iskew )*jc+ioffg, jc ), ilda,
     $                            ctemp, extra )
                     icol = max( 1, jc-k+1 )
                     CALL clarot( .true., .false., .true., jc+2-icol,
     $                            ct, st, a( jc-iskew*icol+ioffg,
     $                            icol ), ilda, dummy, ctemp )
*
*                    Chase EXTRA back down the matrix
*
                     icol = jc
                     DO 360 jch = jc + k, n - 1, k
                        CALL clartg( a( jch-iskew*icol+ioffg, icol ),
     $                               extra, realc, s, dummy )
                        dummy = clarnd( 5, iseed )
                        c = realc*dummy
                        s = s*dummy
                        ctemp = a( 1+( 1-iskew )*jch+ioffg, jch )
                        IF( csym ) THEN
                           ct = c
                           st = s
                        ELSE
                           ctemp = conjg( ctemp )
                           ct = conjg( c )
                           st = conjg( s )
                        END IF
                        CALL clarot( .true., .true., .true., k+2, c, s,
     $                               a( jch-iskew*icol+ioffg, icol ),
     $                               ilda, extra, ctemp )
                        il = min( n+1-jch, k+2 )
                        extra = czero
                        CALL clarot( .false., .true., n-jch.GT.k, il,
     $                               ct, st, a( ( 1-iskew )*jch+ioffg,
     $                               jch ), ilda, ctemp, extra )
                        icol = jch
  360                CONTINUE
  370             CONTINUE
  380          CONTINUE
*
*              If we need upper triangle, copy from lower. Note that
*              the order of copying is chosen to work for 'b' -> 'q'
*
               IF( ipack.NE.ipackg .AND. ipack.NE.4 ) THEN
                  DO 410 jc = n, 1, -1
                     irow = ioffst - iskew*jc
                     IF( csym ) THEN
                        DO 390 jr = jc, max( 1, jc-uub ), -1
                           a( jr+irow, jc ) = a( jc-iskew*jr+ioffg, jr )
  390                   CONTINUE
                     ELSE
                        DO 400 jr = jc, max( 1, jc-uub ), -1
                           a( jr+irow, jc ) = conjg( a( jc-iskew*jr+
     $                                        ioffg, jr ) )
  400                   CONTINUE
                     END IF
  410             CONTINUE
                  IF( ipack.EQ.6 ) THEN
                     DO 430 jc = 1, uub
                        DO 420 jr = 1, uub + 1 - jc
                           a( jr, jc ) = czero
  420                   CONTINUE
  430                CONTINUE
                  END IF
                  IF( ipackg.EQ.5 ) THEN
                     ipackg = ipack
                  ELSE
                     ipackg = 0
                  END IF
               END IF
            END IF
*
*           Ensure that the diagonal is real if Hermitian
*
            IF( .NOT.csym ) THEN
               DO 440 jc = 1, n
                  irow = ioffst + ( 1-iskew )*jc
                  a( irow, jc ) = cmplx( real( a( irow, jc ) ) )
  440          CONTINUE
            END IF
*
         END IF
*
      ELSE
*
*        4)      Generate Banded Matrix by first
*                Rotating by random Unitary matrices,
*                then reducing the bandwidth using Householder
*                transformations.
*
*                Note: we should get here only if LDA .ge. N
*
         IF( isym.EQ.1 ) THEN
*
*           Non-symmetric -- A = U D V
*
            CALL clagge( mr, nc, llb, uub, d, a, lda, iseed, work,
     $                   iinfo )
         ELSE
*
*           Symmetric -- A = U D U' or
*           Hermitian -- A = U D U*
*
            IF( csym ) THEN
               CALL clagsy( m, llb, d, a, lda, iseed, work, iinfo )
            ELSE
               CALL claghe( m, llb, d, a, lda, iseed, work, iinfo )
            END IF
         END IF
*
         IF( iinfo.NE.0 ) THEN
            info = 3
            RETURN
         END IF
      END IF
*
*     5)      Pack the matrix
*
      IF( ipack.NE.ipackg ) THEN
         IF( ipack.EQ.1 ) THEN
*
*           'U' -- Upper triangular, not packed
*
            DO 460 j = 1, m
               DO 450 i = j + 1, m
                  a( i, j ) = czero
  450          CONTINUE
  460       CONTINUE
*
         ELSE IF( ipack.EQ.2 ) THEN
*
*           'L' -- Lower triangular, not packed
*
            DO 480 j = 2, m
               DO 470 i = 1, j - 1
                  a( i, j ) = czero
  470          CONTINUE
  480       CONTINUE
*
         ELSE IF( ipack.EQ.3 ) THEN
*
*           'C' -- Upper triangle packed Columnwise.
*
            icol = 1
            irow = 0
            DO 500 j = 1, m
               DO 490 i = 1, j
                  irow = irow + 1
                  IF( irow.GT.lda ) THEN
                     irow = 1
                     icol = icol + 1
                  END IF
                  a( irow, icol ) = a( i, j )
  490          CONTINUE
  500       CONTINUE
*
         ELSE IF( ipack.EQ.4 ) THEN
*
*           'R' -- Lower triangle packed Columnwise.
*
            icol = 1
            irow = 0
            DO 520 j = 1, m
               DO 510 i = j, m
                  irow = irow + 1
                  IF( irow.GT.lda ) THEN
                     irow = 1
                     icol = icol + 1
                  END IF
                  a( irow, icol ) = a( i, j )
  510          CONTINUE
  520       CONTINUE
*
         ELSE IF( ipack.GE.5 ) THEN
*
*           'B' -- The lower triangle is packed as a band matrix.
*           'Q' -- The upper triangle is packed as a band matrix.
*           'Z' -- The whole matrix is packed as a band matrix.
*
            IF( ipack.EQ.5 )
     $         uub = 0
            IF( ipack.EQ.6 )
     $         llb = 0
*
            DO 540 j = 1, uub
               DO 530 i = min( j+llb, m ), 1, -1
                  a( i-j+uub+1, j ) = a( i, j )
  530          CONTINUE
  540       CONTINUE
*
            DO 560 j = uub + 2, n
               DO 550 i = j - uub, min( j+llb, m )
                  a( i-j+uub+1, j ) = a( i, j )
  550          CONTINUE
  560       CONTINUE
         END IF
*
*        If packed, zero out extraneous elements.
*
*        Symmetric/Triangular Packed --
*        zero out everything after A(IROW,ICOL)
*
         IF( ipack.EQ.3 .OR. ipack.EQ.4 ) THEN
            DO 580 jc = icol, m
               DO 570 jr = irow + 1, lda
                  a( jr, jc ) = czero
  570          CONTINUE
               irow = 0
  580       CONTINUE
*
         ELSE IF( ipack.GE.5 ) THEN
*
*           Packed Band --
*              1st row is now in A( UUB+2-j, j), zero above it
*              m-th row is now in A( M+UUB-j,j), zero below it
*              last non-zero diagonal is now in A( UUB+LLB+1,j ),
*                 zero below it, too.
*
            ir1 = uub + llb + 2
            ir2 = uub + m + 2
            DO 610 jc = 1, n
               DO 590 jr = 1, uub + 1 - jc
                  a( jr, jc ) = czero
  590          CONTINUE
               DO 600 jr = max( 1, min( ir1, ir2-jc ) ), lda
                  a( jr, jc ) = czero
  600          CONTINUE
  610       CONTINUE
         END IF
      END IF
*
      RETURN
*
*     End of CLATMT
*
      END