dchkaa.f

Go to the documentation of this file.

*> \brief \b DCHKAA
*
*  =========== DOCUMENTATION ===========
*
* Online html documentation available at 
*            http://www.netlib.org/lapack/explore-html/ 
*
*  Definition:
*  ===========
*
*       PROGRAM DCHKAA
* 
*
*> \par Purpose:
*  =============
*>
*> \verbatim
*>
*> DCHKAA is the main test program for the DOUBLE PRECISION LAPACK
*> linear equation routines
*>
*> The program must be driven by a short data file. The first 15 records
*> (not including the first comment  line) specify problem dimensions
*> and program options using list-directed input. The remaining lines
*> specify the LAPACK test paths and the number of matrix types to use
*> in testing.  An annotated example of a data file can be obtained by
*> deleting the first 3 characters from the following 40 lines:
*> Data file for testing DOUBLE PRECISION LAPACK linear eqn. routines
*> 7                      Number of values of M
*> 0 1 2 3 5 10 16        Values of M (row dimension)
*> 7                      Number of values of N
*> 0 1 2 3 5 10 16        Values of N (column dimension)
*> 1                      Number of values of NRHS
*> 2                      Values of NRHS (number of right hand sides)
*> 5                      Number of values of NB
*> 1 3 3 3 20             Values of NB (the blocksize)
*> 1 0 5 9 1              Values of NX (crossover point)
*> 3                      Number of values of RANK
*> 30 50 90               Values of rank (as a % of N)
*> 20.0                   Threshold value of test ratio
*> T                      Put T to test the LAPACK routines
*> T                      Put T to test the driver routines
*> T                      Put T to test the error exits
*> DGE   11               List types on next line if 0 < NTYPES < 11
*> DGB    8               List types on next line if 0 < NTYPES <  8
*> DGT   12               List types on next line if 0 < NTYPES < 12
*> DPO    9               List types on next line if 0 < NTYPES <  9
*> DPS    9               List types on next line if 0 < NTYPES <  9
*> DPP    9               List types on next line if 0 < NTYPES <  9
*> DPB    8               List types on next line if 0 < NTYPES <  8
*> DPT   12               List types on next line if 0 < NTYPES < 12
*> DSY   10               List types on next line if 0 < NTYPES < 10
*> DSR   10               List types on next line if 0 < NTYPES < 10
*> DSP   10               List types on next line if 0 < NTYPES < 10
*> DTR   18               List types on next line if 0 < NTYPES < 18
*> DTP   18               List types on next line if 0 < NTYPES < 18
*> DTB   17               List types on next line if 0 < NTYPES < 17
*> DQR    8               List types on next line if 0 < NTYPES <  8
*> DRQ    8               List types on next line if 0 < NTYPES <  8
*> DLQ    8               List types on next line if 0 < NTYPES <  8
*> DQL    8               List types on next line if 0 < NTYPES <  8
*> DQP    6               List types on next line if 0 < NTYPES <  6
*> DTZ    3               List types on next line if 0 < NTYPES <  3
*> DLS    6               List types on next line if 0 < NTYPES <  6
*> DEQ
*> DQT
*> DQX
*> \endverbatim
*
*  Parameters:
*  ==========
*
*> \verbatim
*>  NMAX    INTEGER
*>          The maximum allowable value for M and N.
*>
*>  MAXIN   INTEGER
*>          The number of different values that can be used for each of
*>          M, N, NRHS, NB, NX and RANK
*>
*>  MAXRHS  INTEGER
*>          The maximum number of right hand sides
*>
*>  MATMAX  INTEGER
*>          The maximum number of matrix types to use for testing
*>
*>  NIN     INTEGER
*>          The unit number for input
*>
*>  NOUT    INTEGER
*>          The unit number for output
*> \endverbatim
*
*  Authors:
*  ========
*
*> \author Univ. of Tennessee 
*> \author Univ. of California Berkeley 
*> \author Univ. of Colorado Denver 
*> \author NAG Ltd. 
*
*> \date April 2012
*
*> \ingroup double_lin
*
*  =====================================================================
      PROGRAM dchkaa
*
*  -- LAPACK test routine (version 3.6.0) --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*     April 2012
*
*  =====================================================================
*
*     .. Parameters ..
      INTEGER            NMAX
      parameter                ( nmax = 132 )
      INTEGER            MAXIN
      parameter                ( maxin = 12 )
      INTEGER            MAXRHS
      parameter                ( maxrhs = 16 )
      INTEGER            MATMAX
      parameter                ( matmax = 30 )
      INTEGER            NIN, NOUT
      parameter                ( nin = 5, nout = 6 )
      INTEGER            KDMAX
      parameter                ( kdmax = nmax+( nmax+1 ) / 4 )
*     ..
*     .. Local Scalars ..
      LOGICAL            FATAL, TSTCHK, TSTDRV, TSTERR
      CHARACTER          C1
      CHARACTER*2        C2
      CHARACTER*3        PATH
      CHARACTER*10       INTSTR
      CHARACTER*72       ALINE
      INTEGER            I, IC, J, K, LA, LAFAC, LDA, NB, NM, NMATS, NN,
     $                   nnb, nnb2, nns, nrhs, ntypes, nrank,
     $                   vers_major, vers_minor, vers_patch
      DOUBLE PRECISION   EPS, S1, S2, THREQ, THRESH
*     ..
*     .. Local Arrays ..
      LOGICAL            DOTYPE( matmax )
      INTEGER            IWORK( 25*nmax ), MVAL( maxin ),
     $                   nbval( maxin ), nbval2( maxin ),
     $                   nsval( maxin ), nval( maxin ), nxval( maxin ),
     $                   rankval( maxin ), piv( nmax )
      DOUBLE PRECISION   A( ( kdmax+1 )*nmax, 7 ), B( nmax*maxrhs, 4 ),
     $                   rwork( 5*nmax+2*maxrhs ), s( 2*nmax ),
     $                   work( nmax, nmax+maxrhs+30 )
*     ..
*     .. External Functions ..
      LOGICAL            LSAME, LSAMEN
      DOUBLE PRECISION   DLAMCH, DSECND
      EXTERNAL           lsame, lsamen, dlamch, dsecnd
*     ..
*     .. External Subroutines ..
      EXTERNAL           alareq, dchkeq, dchkgb, dchkge, dchkgt, dchklq,
     $                   dchkpb, dchkpo, dchkps, dchkpp, dchkpt, dchkq3,
     $                   dchkql, dchkqr, dchkrq, dchksp, dchksy,
     $                   dchksy_rook, dchktb, dchktp, dchktr, dchktz,
     $                   ddrvgb, ddrvge, ddrvgt, ddrvls, ddrvpb, ddrvpo,
     $                   ddrvpp, ddrvpt, ddrvsp, ddrvsy, ddrvsy_rook,
     $                   ilaver, dchkqrt, dchkqrtp
*     ..
*     .. Scalars in Common ..
      LOGICAL            LERR, OK
      CHARACTER*32       SRNAMT
      INTEGER            INFOT, NUNIT
*     ..
*     .. Arrays in Common ..
      INTEGER            IPARMS( 100 )
*     ..
*     .. Common blocks ..
      COMMON             / infoc / infot, nunit, ok, lerr
      COMMON             / srnamc / srnamt
      COMMON             / claenv / iparms
*     ..
*     .. Data statements ..
      DATA               threq / 2.0d0 / , intstr / '0123456789' /
*     ..
*     .. Executable Statements ..
*
      s1 = dsecnd( )
      lda = nmax
      fatal = .false.
*
*     Read a dummy line.
*
      READ( nin, fmt = * )
*
*     Report values of parameters.
*
      CALL ilaver( vers_major, vers_minor, vers_patch )
      WRITE( nout, fmt = 9994 ) vers_major, vers_minor, vers_patch
*
*     Read the values of M
*
      READ( nin, fmt = * )nm
      IF( nm.LT.1 ) THEN
         WRITE( nout, fmt = 9996 )' NM ', nm, 1
         nm = 0
         fatal = .true.
      ELSE IF( nm.GT.maxin ) THEN
         WRITE( nout, fmt = 9995 )' NM ', nm, maxin
         nm = 0
         fatal = .true.
      END IF
      READ( nin, fmt = * )( mval( i ), i = 1, nm )
      DO 10 i = 1, nm
         IF( mval( i ).LT.0 ) THEN
            WRITE( nout, fmt = 9996 )' M  ', mval( i ), 0
            fatal = .true.
         ELSE IF( mval( i ).GT.nmax ) THEN
            WRITE( nout, fmt = 9995 )' M  ', mval( i ), nmax
            fatal = .true.
         END IF
   10 CONTINUE
      IF( nm.GT.0 )
     $   WRITE( nout, fmt = 9993 )'M   ', ( mval( i ), i = 1, nm )
*
*     Read the values of N
*
      READ( nin, fmt = * )nn
      IF( nn.LT.1 ) THEN
         WRITE( nout, fmt = 9996 )' NN ', nn, 1
         nn = 0
         fatal = .true.
      ELSE IF( nn.GT.maxin ) THEN
         WRITE( nout, fmt = 9995 )' NN ', nn, maxin
         nn = 0
         fatal = .true.
      END IF
      READ( nin, fmt = * )( nval( i ), i = 1, nn )
      DO 20 i = 1, nn
         IF( nval( i ).LT.0 ) THEN
            WRITE( nout, fmt = 9996 )' N  ', nval( i ), 0
            fatal = .true.
         ELSE IF( nval( i ).GT.nmax ) THEN
            WRITE( nout, fmt = 9995 )' N  ', nval( i ), nmax
            fatal = .true.
         END IF
   20 CONTINUE
      IF( nn.GT.0 )
     $   WRITE( nout, fmt = 9993 )'N   ', ( nval( i ), i = 1, nn )
*
*     Read the values of NRHS
*
      READ( nin, fmt = * )nns
      IF( nns.LT.1 ) THEN
         WRITE( nout, fmt = 9996 )' NNS', nns, 1
         nns = 0
         fatal = .true.
      ELSE IF( nns.GT.maxin ) THEN
         WRITE( nout, fmt = 9995 )' NNS', nns, maxin
         nns = 0
         fatal = .true.
      END IF
      READ( nin, fmt = * )( nsval( i ), i = 1, nns )
      DO 30 i = 1, nns
         IF( nsval( i ).LT.0 ) THEN
            WRITE( nout, fmt = 9996 )'NRHS', nsval( i ), 0
            fatal = .true.
         ELSE IF( nsval( i ).GT.maxrhs ) THEN
            WRITE( nout, fmt = 9995 )'NRHS', nsval( i ), maxrhs
            fatal = .true.
         END IF
   30 CONTINUE
      IF( nns.GT.0 )
     $   WRITE( nout, fmt = 9993 )'NRHS', ( nsval( i ), i = 1, nns )
*
*     Read the values of NB
*
      READ( nin, fmt = * )nnb
      IF( nnb.LT.1 ) THEN
         WRITE( nout, fmt = 9996 )'NNB ', nnb, 1
         nnb = 0
         fatal = .true.
      ELSE IF( nnb.GT.maxin ) THEN
         WRITE( nout, fmt = 9995 )'NNB ', nnb, maxin
         nnb = 0
         fatal = .true.
      END IF
      READ( nin, fmt = * )( nbval( i ), i = 1, nnb )
      DO 40 i = 1, nnb
         IF( nbval( i ).LT.0 ) THEN
            WRITE( nout, fmt = 9996 )' NB ', nbval( i ), 0
            fatal = .true.
         END IF
   40 CONTINUE
      IF( nnb.GT.0 )
     $   WRITE( nout, fmt = 9993 )'NB  ', ( nbval( i ), i = 1, nnb )
*
*     Set NBVAL2 to be the set of unique values of NB
*
      nnb2 = 0
      DO 60 i = 1, nnb
         nb = nbval( i )
         DO 50 j = 1, nnb2
            IF( nb.EQ.nbval2( j ) )
     $         GO TO 60
   50    CONTINUE
         nnb2 = nnb2 + 1
         nbval2( nnb2 ) = nb
   60 CONTINUE
*
*     Read the values of NX
*
      READ( nin, fmt = * )( nxval( i ), i = 1, nnb )
      DO 70 i = 1, nnb
         IF( nxval( i ).LT.0 ) THEN
            WRITE( nout, fmt = 9996 )' NX ', nxval( i ), 0
            fatal = .true.
         END IF
   70 CONTINUE
      IF( nnb.GT.0 )
     $   WRITE( nout, fmt = 9993 )'NX  ', ( nxval( i ), i = 1, nnb )
*
*     Read the values of RANKVAL
*
      READ( nin, fmt = * )nrank
      IF( nn.LT.1 ) THEN
         WRITE( nout, fmt = 9996 )' NRANK ', nrank, 1
         nrank = 0
         fatal = .true.
      ELSE IF( nn.GT.maxin ) THEN
         WRITE( nout, fmt = 9995 )' NRANK ', nrank, maxin
         nrank = 0
         fatal = .true.
      END IF
      READ( nin, fmt = * )( rankval( i ), i = 1, nrank )
      DO i = 1, nrank
         IF( rankval( i ).LT.0 ) THEN
            WRITE( nout, fmt = 9996 )' RANK  ', rankval( i ), 0
            fatal = .true.
         ELSE IF( rankval( i ).GT.100 ) THEN
            WRITE( nout, fmt = 9995 )' RANK  ', rankval( i ), 100
            fatal = .true.
         END IF
      END DO
      IF( nrank.GT.0 )
     $   WRITE( nout, fmt = 9993 )'RANK % OF N',
     $   ( rankval( i ), i = 1, nrank )
*
*     Read the threshold value for the test ratios.
*
      READ( nin, fmt = * )thresh
      WRITE( nout, fmt = 9992 )thresh
*
*     Read the flag that indicates whether to test the LAPACK routines.
*
      READ( nin, fmt = * )tstchk
*
*     Read the flag that indicates whether to test the driver routines.
*
      READ( nin, fmt = * )tstdrv
*
*     Read the flag that indicates whether to test the error exits.
*
      READ( nin, fmt = * )tsterr
*
      IF( fatal ) THEN
         WRITE( nout, fmt = 9999 )
         stop
      END IF
*
*     Calculate and print the machine dependent constants.
*
      eps = dlamch( 'Underflow threshold' )
      WRITE( nout, fmt = 9991 )'underflow', eps
      eps = dlamch( 'Overflow threshold' )
      WRITE( nout, fmt = 9991 )'overflow ', eps
      eps = dlamch( 'Epsilon' )
      WRITE( nout, fmt = 9991 )'precision', eps
      WRITE( nout, fmt = * )
*
   80 CONTINUE
*
*     Read a test path and the number of matrix types to use.
*
      READ( nin, fmt = '(A72)', end = 140 )aline
      path = aline( 1: 3 )
      nmats = matmax
      i = 3
   90 CONTINUE
      i = i + 1
      IF( i.GT.72 ) THEN
         nmats = matmax
         GO TO 130
      END IF
      IF( aline( i: i ).EQ.' ' )
     $   GO TO 90
      nmats = 0
  100 CONTINUE
      c1 = aline( i: i )
      DO 110 k = 1, 10
         IF( c1.EQ.intstr( k: k ) ) THEN
            ic = k - 1
            GO TO 120
         END IF
  110 CONTINUE
      GO TO 130
  120 CONTINUE
      nmats = nmats*10 + ic
      i = i + 1
      IF( i.GT.72 )
     $   GO TO 130
      GO TO 100
  130 CONTINUE
      c1 = path( 1: 1 )
      c2 = path( 2: 3 )
      nrhs = nsval( 1 )
*
*     Check first character for correct precision.
*
      IF( .NOT.lsame( c1, 'Double precision' ) ) THEN
         WRITE( nout, fmt = 9990 )path
*
      ELSE IF( nmats.LE.0 ) THEN
*
*        Check for a positive number of tests requested.
*
         WRITE( nout, fmt = 9989 )path
*
      ELSE IF( lsamen( 2, c2, 'GE' ) ) THEN
*
*        GE:  general matrices
*
         ntypes = 11
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkge( dotype, nm, mval, nn, nval, nnb2, nbval2, nns,
     $                   nsval, thresh, tsterr, lda, a( 1, 1 ),
     $                   a( 1, 2 ), a( 1, 3 ), b( 1, 1 ), b( 1, 2 ),
     $                   b( 1, 3 ), work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvge( dotype, nn, nval, nrhs, thresh, tsterr, lda,
     $                   a( 1, 1 ), a( 1, 2 ), a( 1, 3 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), b( 1, 4 ), s, work,
     $                   rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'GB' ) ) THEN
*
*        GB:  general banded matrices
*
         la = ( 2*kdmax+1 )*nmax
         lafac = ( 3*kdmax+1 )*nmax
         ntypes = 8
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkgb( dotype, nm, mval, nn, nval, nnb2, nbval2, nns,
     $                   nsval, thresh, tsterr, a( 1, 1 ), la,
     $                   a( 1, 3 ), lafac, b( 1, 1 ), b( 1, 2 ),
     $                   b( 1, 3 ), work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvgb( dotype, nn, nval, nrhs, thresh, tsterr,
     $                   a( 1, 1 ), la, a( 1, 3 ), lafac, a( 1, 6 ),
     $                   b( 1, 1 ), b( 1, 2 ), b( 1, 3 ), b( 1, 4 ), s,
     $                   work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'GT' ) ) THEN
*
*        GT:  general tridiagonal matrices
*
         ntypes = 12
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkgt( dotype, nn, nval, nns, nsval, thresh, tsterr,
     $                   a( 1, 1 ), a( 1, 2 ), b( 1, 1 ), b( 1, 2 ),
     $                   b( 1, 3 ), work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvgt( dotype, nn, nval, nrhs, thresh, tsterr,
     $                   a( 1, 1 ), a( 1, 2 ), b( 1, 1 ), b( 1, 2 ),
     $                   b( 1, 3 ), work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'PO' ) ) THEN
*
*        PO:  positive definite matrices
*
         ntypes = 9
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkpo( dotype, nn, nval, nnb2, nbval2, nns, nsval,
     $                   thresh, tsterr, lda, a( 1, 1 ), a( 1, 2 ),
     $                   a( 1, 3 ), b( 1, 1 ), b( 1, 2 ), b( 1, 3 ),
     $                   work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvpo( dotype, nn, nval, nrhs, thresh, tsterr, lda,
     $                   a( 1, 1 ), a( 1, 2 ), a( 1, 3 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), b( 1, 4 ), s, work,
     $                   rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'PS' ) ) THEN
*
*        PS:  positive semi-definite matrices
*
         ntypes = 9
*
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkps( dotype, nn, nval, nnb2, nbval2, nrank,
     $                   rankval, thresh, tsterr, lda, a( 1, 1 ),
     $                   a( 1, 2 ), a( 1, 3 ), piv, work, rwork,
     $                   nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'PP' ) ) THEN
*
*        PP:  positive definite packed matrices
*
         ntypes = 9
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkpp( dotype, nn, nval, nns, nsval, thresh, tsterr,
     $                   lda, a( 1, 1 ), a( 1, 2 ), a( 1, 3 ),
     $                   b( 1, 1 ), b( 1, 2 ), b( 1, 3 ), work, rwork,
     $                   iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvpp( dotype, nn, nval, nrhs, thresh, tsterr, lda,
     $                   a( 1, 1 ), a( 1, 2 ), a( 1, 3 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), b( 1, 4 ), s, work,
     $                   rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'PB' ) ) THEN
*
*        PB:  positive definite banded matrices
*
         ntypes = 8
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkpb( dotype, nn, nval, nnb2, nbval2, nns, nsval,
     $                   thresh, tsterr, lda, a( 1, 1 ), a( 1, 2 ),
     $                   a( 1, 3 ), b( 1, 1 ), b( 1, 2 ), b( 1, 3 ),
     $                   work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvpb( dotype, nn, nval, nrhs, thresh, tsterr, lda,
     $                   a( 1, 1 ), a( 1, 2 ), a( 1, 3 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), b( 1, 4 ), s, work,
     $                   rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'PT' ) ) THEN
*
*        PT:  positive definite tridiagonal matrices
*
         ntypes = 12
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkpt( dotype, nn, nval, nns, nsval, thresh, tsterr,
     $                   a( 1, 1 ), a( 1, 2 ), a( 1, 3 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), work, rwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvpt( dotype, nn, nval, nrhs, thresh, tsterr,
     $                   a( 1, 1 ), a( 1, 2 ), a( 1, 3 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), work, rwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'SY' ) ) THEN
*
*        SY:  symmetric indefinite matrices,
*             with partial (Bunch-Kaufman) pivoting algorithm
*
         ntypes = 10
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchksy( dotype, nn, nval, nnb2, nbval2, nns, nsval,
     $                   thresh, tsterr, lda, a( 1, 1 ), a( 1, 2 ),
     $                   a( 1, 3 ), b( 1, 1 ), b( 1, 2 ), b( 1, 3 ),
     $                   work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvsy( dotype, nn, nval, nrhs, thresh, tsterr, lda,
     $                   a( 1, 1 ), a( 1, 2 ), a( 1, 3 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), work, rwork, iwork,
     $                   nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'SR' ) ) THEN
*
*        SR:  symmetric indefinite matrices with Rook pivoting,
*             with rook (bounded Bunch-Kaufman) pivoting algorithm
*
         ntypes = 10
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchksy_rook(dotype, nn, nval, nnb2, nbval2, nns, nsval,
     $                       thresh, tsterr, lda, a( 1, 1 ), a( 1, 2 ),
     $                       a( 1, 3 ), b( 1, 1 ), b( 1, 2 ), b( 1, 3 ),
     $                       work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvsy_rook( dotype, nn, nval, nrhs, thresh, tsterr,
     $                        lda, a( 1, 1 ), a( 1, 2 ), a( 1, 3 ),
     $                        b( 1, 1 ), b( 1, 2 ), b( 1, 3 ),
     $                        work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'SP' ) ) THEN
*
*        SP:  symmetric indefinite packed matrices,
*             with partial (Bunch-Kaufman) pivoting algorithm
*
         ntypes = 10
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchksp( dotype, nn, nval, nns, nsval, thresh, tsterr,
     $                   lda, a( 1, 1 ), a( 1, 2 ), a( 1, 3 ),
     $                   b( 1, 1 ), b( 1, 2 ), b( 1, 3 ), work, rwork,
     $                   iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
         IF( tstdrv ) THEN
            CALL ddrvsp( dotype, nn, nval, nrhs, thresh, tsterr, lda,
     $                   a( 1, 1 ), a( 1, 2 ), a( 1, 3 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), work, rwork, iwork,
     $                   nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'TR' ) ) THEN
*
*        TR:  triangular matrices
*
         ntypes = 18
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchktr( dotype, nn, nval, nnb2, nbval2, nns, nsval,
     $                   thresh, tsterr, lda, a( 1, 1 ), a( 1, 2 ),
     $                   b( 1, 1 ), b( 1, 2 ), b( 1, 3 ), work, rwork,
     $                   iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'TP' ) ) THEN
*
*        TP:  triangular packed matrices
*
         ntypes = 18
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchktp( dotype, nn, nval, nns, nsval, thresh, tsterr,
     $                   lda, a( 1, 1 ), a( 1, 2 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), work, rwork, iwork,
     $                   nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'TB' ) ) THEN
*
*        TB:  triangular banded matrices
*
         ntypes = 17
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchktb( dotype, nn, nval, nns, nsval, thresh, tsterr,
     $                   lda, a( 1, 1 ), a( 1, 2 ), b( 1, 1 ),
     $                   b( 1, 2 ), b( 1, 3 ), work, rwork, iwork,
     $                   nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'QR' ) ) THEN
*
*        QR:  QR factorization
*
         ntypes = 8
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkqr( dotype, nm, mval, nn, nval, nnb, nbval, nxval,
     $                   nrhs, thresh, tsterr, nmax, a( 1, 1 ),
     $                   a( 1, 2 ), a( 1, 3 ), a( 1, 4 ), a( 1, 5 ),
     $                   b( 1, 1 ), b( 1, 2 ), b( 1, 3 ), b( 1, 4 ),
     $                   work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'LQ' ) ) THEN
*
*        LQ:  LQ factorization
*
         ntypes = 8
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchklq( dotype, nm, mval, nn, nval, nnb, nbval, nxval,
     $                   nrhs, thresh, tsterr, nmax, a( 1, 1 ),
     $                   a( 1, 2 ), a( 1, 3 ), a( 1, 4 ), a( 1, 5 ),
     $                   b( 1, 1 ), b( 1, 2 ), b( 1, 3 ), b( 1, 4 ),
     $                   work, rwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'QL' ) ) THEN
*
*        QL:  QL factorization
*
         ntypes = 8
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkql( dotype, nm, mval, nn, nval, nnb, nbval, nxval,
     $                   nrhs, thresh, tsterr, nmax, a( 1, 1 ),
     $                   a( 1, 2 ), a( 1, 3 ), a( 1, 4 ), a( 1, 5 ),
     $                   b( 1, 1 ), b( 1, 2 ), b( 1, 3 ), b( 1, 4 ),
     $                   work, rwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'RQ' ) ) THEN
*
*        RQ:  RQ factorization
*
         ntypes = 8
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkrq( dotype, nm, mval, nn, nval, nnb, nbval, nxval,
     $                   nrhs, thresh, tsterr, nmax, a( 1, 1 ),
     $                   a( 1, 2 ), a( 1, 3 ), a( 1, 4 ), a( 1, 5 ),
     $                   b( 1, 1 ), b( 1, 2 ), b( 1, 3 ), b( 1, 4 ),
     $                   work, rwork, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'QP' ) ) THEN
*
*        QP:  QR factorization with pivoting
*
         ntypes = 6
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchkq3( dotype, nm, mval, nn, nval, nnb, nbval, nxval,
     $                   thresh, a( 1, 1 ), a( 1, 2 ), b( 1, 1 ),
     $                   b( 1, 3 ), work, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'TZ' ) ) THEN
*
*        TZ:  Trapezoidal matrix
*
         ntypes = 3
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstchk ) THEN
            CALL dchktz( dotype, nm, mval, nn, nval, thresh, tsterr,
     $                   a( 1, 1 ), a( 1, 2 ), b( 1, 1 ),
     $                   b( 1, 3 ), work, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'LS' ) ) THEN
*
*        LS:  Least squares drivers
*
         ntypes = 6
         CALL alareq( path, nmats, dotype, ntypes, nin, nout )
*
         IF( tstdrv ) THEN
            CALL ddrvls( dotype, nm, mval, nn, nval, nns, nsval, nnb,
     $                   nbval, nxval, thresh, tsterr, a( 1, 1 ),
     $                   a( 1, 2 ), b( 1, 1 ), b( 1, 2 ), b( 1, 3 ),
     $                   rwork, rwork( nmax+1 ), work, iwork, nout )
         ELSE
            WRITE( nout, fmt = 9988 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'EQ' ) ) THEN
*
*        EQ:  Equilibration routines for general and positive definite
*             matrices (THREQ should be between 2 and 10)
*
         IF( tstchk ) THEN
            CALL dchkeq( threq, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*         
      ELSE IF( lsamen( 2, c2, 'QT' ) ) THEN
*
*        QT:  QRT routines for general matrices
*
         IF( tstchk ) THEN
            CALL dchkqrt( thresh, tsterr, nm, mval, nn, nval, nnb, 
     $                    nbval, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE IF( lsamen( 2, c2, 'QX' ) ) THEN
*
*        QX:  QRT routines for triangular-pentagonal matrices
*
         IF( tstchk ) THEN
            CALL dchkqrtp( thresh, tsterr, nm, mval, nn, nval, nnb, 
     $                     nbval, nout )
         ELSE
            WRITE( nout, fmt = 9989 )path
         END IF
*
      ELSE
*
         WRITE( nout, fmt = 9990 )path
      END IF
*
*     Go back to get another input line.
*
      GO TO 80
*
*     Branch to this line when the last record is read.
*
  140 CONTINUE
      CLOSE ( nin )
      s2 = dsecnd( )
      WRITE( nout, fmt = 9998 )
      WRITE( nout, fmt = 9997 )s2 - s1
*
 9999 FORMAT( / ' Execution not attempted due to input errors' )
 9998 FORMAT( / ' End of tests' )
 9997 FORMAT( ' Total time used = ', f12.2, ' seconds', / )
 9996 FORMAT( ' Invalid input value: ', a4, '=', i6, '; must be >=',
     $      i6 )
 9995 FORMAT( ' Invalid input value: ', a4, '=', i6, '; must be <=',
     $      i6 )
 9994 FORMAT( ' Tests of the DOUBLE PRECISION LAPACK routines ',
     $      / ' LAPACK VERSION ', i1, '.', i1, '.', i1,
     $      / / ' The following parameter values will be used:' )
 9993 FORMAT( 4x, a4, ':  ', 10i6, / 11x, 10i6 )
 9992 FORMAT( / ' Routines pass computational tests if test ratio is ',
     $      'less than', f8.2, / )
 9991 FORMAT( ' Relative machine ', a, ' is taken to be', d16.6 )
 9990 FORMAT( / 1x, a3, ':  Unrecognized path name' )
 9989 FORMAT( / 1x, a3, ' routines were not tested' )
 9988 FORMAT( / 1x, a3, ' driver routines were not tested' )
*
*     End of DCHKAA
*
      END