cchkgb.f

Go to the documentation of this file.

*> \brief \b CCHKGB
*
*  =========== DOCUMENTATION ===========
*
* Online html documentation available at
*            http://www.netlib.org/lapack/explore-html/
*
*  Definition:
*  ===========
*
*       SUBROUTINE CCHKGB( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS,
*                          NSVAL, THRESH, TSTERR, A, LA, AFAC, LAFAC, B,
*                          X, XACT, WORK, RWORK, IWORK, NOUT )
*
*       .. Scalar Arguments ..
*       LOGICAL            TSTERR
*       INTEGER            LA, LAFAC, NM, NN, NNB, NNS, NOUT
*       REAL               THRESH
*       ..
*       .. Array Arguments ..
*       LOGICAL            DOTYPE( * )
*       INTEGER            IWORK( * ), MVAL( * ), NBVAL( * ), NSVAL( * ),
*      $                   NVAL( * )
*       REAL               RWORK( * )
*       COMPLEX            A( * ), AFAC( * ), B( * ), WORK( * ), X( * ),
*      $                   XACT( * )
*       ..
*
*
*> \par Purpose:
*  =============
*>
*> \verbatim
*>
*> CCHKGB tests CGBTRF, -TRS, -RFS, and -CON
*> \endverbatim
*
*  Arguments:
*  ==========
*
*> \param[in] DOTYPE
*> \verbatim
*>          DOTYPE is LOGICAL array, dimension (NTYPES)
*>          The matrix types to be used for testing.  Matrices of type j
*>          (for 1 <= j <= NTYPES) are used for testing if DOTYPE(j) =
*>          .TRUE.; if DOTYPE(j) = .FALSE., then type j is not used.
*> \endverbatim
*>
*> \param[in] NM
*> \verbatim
*>          NM is INTEGER
*>          The number of values of M contained in the vector MVAL.
*> \endverbatim
*>
*> \param[in] MVAL
*> \verbatim
*>          MVAL is INTEGER array, dimension (NM)
*>          The values of the matrix row dimension M.
*> \endverbatim
*>
*> \param[in] NN
*> \verbatim
*>          NN is INTEGER
*>          The number of values of N contained in the vector NVAL.
*> \endverbatim
*>
*> \param[in] NVAL
*> \verbatim
*>          NVAL is INTEGER array, dimension (NN)
*>          The values of the matrix column dimension N.
*> \endverbatim
*>
*> \param[in] NNB
*> \verbatim
*>          NNB is INTEGER
*>          The number of values of NB contained in the vector NBVAL.
*> \endverbatim
*>
*> \param[in] NBVAL
*> \verbatim
*>          NBVAL is INTEGER array, dimension (NNB)
*>          The values of the blocksize NB.
*> \endverbatim
*>
*> \param[in] NNS
*> \verbatim
*>          NNS is INTEGER
*>          The number of values of NRHS contained in the vector NSVAL.
*> \endverbatim
*>
*> \param[in] NSVAL
*> \verbatim
*>          NSVAL is INTEGER array, dimension (NNS)
*>          The values of the number of right hand sides NRHS.
*> \endverbatim
*>
*> \param[in] THRESH
*> \verbatim
*>          THRESH is REAL
*>          The threshold value for the test ratios.  A result is
*>          included in the output file if RESULT >= THRESH.  To have
*>          every test ratio printed, use THRESH = 0.
*> \endverbatim
*>
*> \param[in] TSTERR
*> \verbatim
*>          TSTERR is LOGICAL
*>          Flag that indicates whether error exits are to be tested.
*> \endverbatim
*>
*> \param[out] A
*> \verbatim
*>          A is COMPLEX array, dimension (LA)
*> \endverbatim
*>
*> \param[in] LA
*> \verbatim
*>          LA is INTEGER
*>          The length of the array A.  LA >= (KLMAX+KUMAX+1)*NMAX
*>          where KLMAX is the largest entry in the local array KLVAL,
*>                KUMAX is the largest entry in the local array KUVAL and
*>                NMAX is the largest entry in the input array NVAL.
*> \endverbatim
*>
*> \param[out] AFAC
*> \verbatim
*>          AFAC is COMPLEX array, dimension (LAFAC)
*> \endverbatim
*>
*> \param[in] LAFAC
*> \verbatim
*>          LAFAC is INTEGER
*>          The length of the array AFAC. LAFAC >= (2*KLMAX+KUMAX+1)*NMAX
*>          where KLMAX is the largest entry in the local array KLVAL,
*>                KUMAX is the largest entry in the local array KUVAL and
*>                NMAX is the largest entry in the input array NVAL.
*> \endverbatim
*>
*> \param[out] B
*> \verbatim
*>          B is COMPLEX array, dimension (NMAX*NSMAX)
*> \endverbatim
*>
*> \param[out] X
*> \verbatim
*>          X is COMPLEX array, dimension (NMAX*NSMAX)
*> \endverbatim
*>
*> \param[out] XACT
*> \verbatim
*>          XACT is COMPLEX array, dimension (NMAX*NSMAX)
*> \endverbatim
*>
*> \param[out] WORK
*> \verbatim
*>          WORK is COMPLEX array, dimension
*>                      (NMAX*max(3,NSMAX,NMAX))
*> \endverbatim
*>
*> \param[out] RWORK
*> \verbatim
*>          RWORK is REAL array, dimension
*>                      (NMAX+2*NSMAX)
*> \endverbatim
*>
*> \param[out] IWORK
*> \verbatim
*>          IWORK is INTEGER array, dimension (NMAX)
*> \endverbatim
*>
*> \param[in] NOUT
*> \verbatim
*>          NOUT is 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.
*
*> \ingroup complex_lin
*
*  =====================================================================
      SUBROUTINE cchkgb( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS,
     $                   NSVAL, THRESH, TSTERR, A, LA, AFAC, LAFAC, B,
     $                   X, XACT, WORK, RWORK, IWORK, NOUT )
*
*  -- LAPACK test routine --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*
*     .. Scalar Arguments ..
      LOGICAL            TSTERR
      INTEGER            LA, LAFAC, NM, NN, NNB, NNS, NOUT
      REAL               THRESH
*     ..
*     .. Array Arguments ..
      LOGICAL            DOTYPE( * )
      INTEGER            IWORK( * ), MVAL( * ), NBVAL( * ), NSVAL( * ),
     $                   nval( * )
      REAL               RWORK( * )
      COMPLEX            A( * ), AFAC( * ), B( * ), WORK( * ), X( * ),
     $                   xact( * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      REAL               ONE, ZERO
      PARAMETER          ( ONE = 1.0e+0, zero = 0.0e+0 )
      INTEGER            NTYPES, NTESTS
      parameter( ntypes = 8, ntests = 7 )
      INTEGER            NBW, NTRAN
      parameter( nbw = 4, ntran = 3 )
*     ..
*     .. Local Scalars ..
      LOGICAL            TRFCON, ZEROT
      CHARACTER          DIST, NORM, TRANS, TYPE, XTYPE
      CHARACTER*3        PATH
      INTEGER            I, I1, I2, IKL, IKU, IM, IMAT, IN, INB, INFO,
     $                   ioff, irhs, itran, izero, j, k, kl, koff, ku,
     $                   lda, ldafac, ldb, m, mode, n, nb, nerrs, nfail,
     $                   nimat, nkl, nku, nrhs, nrun
      REAL               AINVNM, ANORM, ANORMI, ANORMO, CNDNUM, RCOND,
     $                   RCONDC, RCONDI, RCONDO
*     ..
*     .. Local Arrays ..
      CHARACTER          TRANSS( NTRAN )
      INTEGER            ISEED( 4 ), ISEEDY( 4 ), KLVAL( NBW ),
     $                   kuval( nbw )
      REAL               RESULT( NTESTS )
*     ..
*     .. External Functions ..
      REAL               CLANGB, CLANGE, SGET06
      EXTERNAL           CLANGB, CLANGE, SGET06
*     ..
*     .. External Subroutines ..
      EXTERNAL           alaerh, alahd, alasum, ccopy, cerrge, cgbcon,
     $                   cgbrfs, cgbt01, cgbt02, cgbt05, cgbtrf, cgbtrs,
     $                   cget04, clacpy, clarhs, claset, clatb4, clatms,
     $                   xlaenv
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          cmplx, max, min
*     ..
*     .. Scalars in Common ..
      LOGICAL            LERR, OK
      CHARACTER*32       SRNAMT
      INTEGER            INFOT, NUNIT
*     ..
*     .. Common blocks ..
      COMMON             / infoc / infot, nunit, ok, lerr
      COMMON             / srnamc / srnamt
*     ..
*     .. Data statements ..
      DATA               iseedy / 1988, 1989, 1990, 1991 / ,
     $                   transs / 'N', 'T', 'C' /
*     ..
*     .. Executable Statements ..
*
*     Initialize constants and the random number seed.
*
      path( 1: 1 ) = 'Complex precision'
      path( 2: 3 ) = 'GB'
      nrun = 0
      nfail = 0
      nerrs = 0
      DO 10 i = 1, 4
         iseed( i ) = iseedy( i )
   10 CONTINUE
*
*     Test the error exits
*
      IF( tsterr )
     $   CALL cerrge( path, nout )
      infot = 0
*
*     Initialize the first value for the lower and upper bandwidths.
*
      klval( 1 ) = 0
      kuval( 1 ) = 0
*
*     Do for each value of M in MVAL
*
      DO 160 im = 1, nm
         m = mval( im )
*
*        Set values to use for the lower bandwidth.
*
         klval( 2 ) = m + ( m+1 ) / 4
*
*        KLVAL( 2 ) = MAX( M-1, 0 )
*
         klval( 3 ) = ( 3*m-1 ) / 4
         klval( 4 ) = ( m+1 ) / 4
*
*        Do for each value of N in NVAL
*
         DO 150 in = 1, nn
            n = nval( in )
            xtype = 'N'
*
*           Set values to use for the upper bandwidth.
*
            kuval( 2 ) = n + ( n+1 ) / 4
*
*           KUVAL( 2 ) = MAX( N-1, 0 )
*
            kuval( 3 ) = ( 3*n-1 ) / 4
            kuval( 4 ) = ( n+1 ) / 4
*
*           Set limits on the number of loop iterations.
*
            nkl = min( m+1, 4 )
            IF( n.EQ.0 )
     $         nkl = 2
            nku = min( n+1, 4 )
            IF( m.EQ.0 )
     $         nku = 2
            nimat = ntypes
            IF( m.LE.0 .OR. n.LE.0 )
     $         nimat = 1
*
            DO 140 ikl = 1, nkl
*
*              Do for KL = 0, (5*M+1)/4, (3M-1)/4, and (M+1)/4. This
*              order makes it easier to skip redundant values for small
*              values of M.
*
               kl = klval( ikl )
               DO 130 iku = 1, nku
*
*                 Do for KU = 0, (5*N+1)/4, (3N-1)/4, and (N+1)/4. This
*                 order makes it easier to skip redundant values for
*                 small values of N.
*
                  ku = kuval( iku )
*
*                 Check that A and AFAC are big enough to generate this
*                 matrix.
*
                  lda = kl + ku + 1
                  ldafac = 2*kl + ku + 1
                  IF( ( lda*n ).GT.la .OR. ( ldafac*n ).GT.lafac ) THEN
                     IF( nfail.EQ.0 .AND. nerrs.EQ.0 )
     $                  CALL alahd( nout, path )
                     IF( n*( kl+ku+1 ).GT.la ) THEN
                        WRITE( nout, fmt = 9999 )la, m, n, kl, ku,
     $                     n*( kl+ku+1 )
                        nerrs = nerrs + 1
                     END IF
                     IF( n*( 2*kl+ku+1 ).GT.lafac ) THEN
                        WRITE( nout, fmt = 9998 )lafac, m, n, kl, ku,
     $                     n*( 2*kl+ku+1 )
                        nerrs = nerrs + 1
                     END IF
                     GO TO 130
                  END IF
*
                  DO 120 imat = 1, nimat
*
*                    Do the tests only if DOTYPE( IMAT ) is true.
*
                     IF( .NOT.dotype( imat ) )
     $                  GO TO 120
*
*                    Skip types 2, 3, or 4 if the matrix size is too
*                    small.
*
                     zerot = imat.GE.2 .AND. imat.LE.4
                     IF( zerot .AND. n.LT.imat-1 )
     $                  GO TO 120
*
                     IF( .NOT.zerot .OR. .NOT.dotype( 1 ) ) THEN
*
*                       Set up parameters with CLATB4 and generate a
*                       test matrix with CLATMS.
*
                        CALL clatb4( path, imat, m, n, TYPE, kl, ku,
     $                               anorm, mode, cndnum, dist )
*
                        koff = max( 1, ku+2-n )
                        DO 20 i = 1, koff - 1
                           a( i ) = zero
   20                   CONTINUE
                        srnamt = 'CLATMS'
                        CALL clatms( m, n, dist, iseed, TYPE, rwork,
     $                               mode, cndnum, anorm, kl, ku, 'Z',
     $                               a( koff ), lda, work, info )
*
*                       Check the error code from CLATMS.
*
                        IF( info.NE.0 ) THEN
                           CALL alaerh( path, 'CLATMS', info, 0, ' ', m,
     $                                  n, kl, ku, -1, imat, nfail,
     $                                  nerrs, nout )
                           GO TO 120
                        END IF
                     ELSE IF( izero.GT.0 ) THEN
*
*                       Use the same matrix for types 3 and 4 as for
*                       type 2 by copying back the zeroed out column.
*
                        CALL ccopy( i2-i1+1, b, 1, a( ioff+i1 ), 1 )
                     END IF
*
*                    For types 2, 3, and 4, zero one or more columns of
*                    the matrix to test that INFO is returned correctly.
*
                     izero = 0
                     IF( zerot ) THEN
                        IF( imat.EQ.2 ) THEN
                           izero = 1
                        ELSE IF( imat.EQ.3 ) THEN
                           izero = min( m, n )
                        ELSE
                           izero = min( m, n ) / 2 + 1
                        END IF
                        ioff = ( izero-1 )*lda
                        IF( imat.LT.4 ) THEN
*
*                          Store the column to be zeroed out in B.
*
                           i1 = max( 1, ku+2-izero )
                           i2 = min( kl+ku+1, ku+1+( m-izero ) )
                           CALL ccopy( i2-i1+1, a( ioff+i1 ), 1, b, 1 )
*
                           DO 30 i = i1, i2
                              a( ioff+i ) = zero
   30                      CONTINUE
                        ELSE
                           DO 50 j = izero, n
                              DO 40 i = max( 1, ku+2-j ),
     $                                min( kl+ku+1, ku+1+( m-j ) )
                                 a( ioff+i ) = zero
   40                         CONTINUE
                              ioff = ioff + lda
   50                      CONTINUE
                        END IF
                     END IF
*
*                    These lines, if used in place of the calls in the
*                    loop over INB, cause the code to bomb on a Sun
*                    SPARCstation.
*
*                     ANORMO = CLANGB( 'O', N, KL, KU, A, LDA, RWORK )
*                     ANORMI = CLANGB( 'I', N, KL, KU, A, LDA, RWORK )
*
*                    Do for each blocksize in NBVAL
*
                     DO 110 inb = 1, nnb
                        nb = nbval( inb )
                        CALL xlaenv( 1, nb )
*
*                       Compute the LU factorization of the band matrix.
*
                        IF( m.GT.0 .AND. n.GT.0 )
     $                     CALL clacpy( 'Full', kl+ku+1, n, a, lda,
     $                                  afac( kl+1 ), ldafac )
                        srnamt = 'CGBTRF'
                        CALL cgbtrf( m, n, kl, ku, afac, ldafac, iwork,
     $                               info )
*
*                       Check error code from CGBTRF.
*
                        IF( info.NE.izero )
     $                     CALL alaerh( path, 'CGBTRF', info, izero,
     $                                  ' ', m, n, kl, ku, nb, imat,
     $                                  nfail, nerrs, nout )
                        trfcon = .false.
*
*+    TEST 1
*                       Reconstruct matrix from factors and compute
*                       residual.
*
                        CALL cgbt01( m, n, kl, ku, a, lda, afac, ldafac,
     $                               iwork, work, result( 1 ) )
*
*                       Print information about the tests so far that
*                       did not pass the threshold.
*
                        IF( result( 1 ).GE.thresh ) THEN
                           IF( nfail.EQ.0 .AND. nerrs.EQ.0 )
     $                        CALL alahd( nout, path )
                           WRITE( nout, fmt = 9997 )m, n, kl, ku, nb,
     $                        imat, 1, result( 1 )
                           nfail = nfail + 1
                        END IF
                        nrun = nrun + 1
*
*                       Skip the remaining tests if this is not the
*                       first block size or if M .ne. N.
*
                        IF( inb.GT.1 .OR. m.NE.n )
     $                     GO TO 110
*
                        anormo = clangb( 'O', n, kl, ku, a, lda, rwork )
                        anormi = clangb( 'I', n, kl, ku, a, lda, rwork )
*
                        IF( info.EQ.0 ) THEN
*
*                          Form the inverse of A so we can get a good
*                          estimate of CNDNUM = norm(A) * norm(inv(A)).
*
                           ldb = max( 1, n )
                           CALL claset( 'Full', n, n, cmplx( zero ),
     $                                  cmplx( one ), work, ldb )
                           srnamt = 'CGBTRS'
                           CALL cgbtrs( 'No transpose', n, kl, ku, n,
     $                                  afac, ldafac, iwork, work, ldb,
     $                                  info )
*
*                          Compute the 1-norm condition number of A.
*
                           ainvnm = clange( 'O', n, n, work, ldb,
     $                              rwork )
                           IF( anormo.LE.zero .OR. ainvnm.LE.zero ) THEN
                              rcondo = one
                           ELSE
                              rcondo = ( one / anormo ) / ainvnm
                           END IF
*
*                          Compute the infinity-norm condition number of
*                          A.
*
                           ainvnm = clange( 'I', n, n, work, ldb,
     $                              rwork )
                           IF( anormi.LE.zero .OR. ainvnm.LE.zero ) THEN
                              rcondi = one
                           ELSE
                              rcondi = ( one / anormi ) / ainvnm
                           END IF
                        ELSE
*
*                          Do only the condition estimate if INFO.NE.0.
*
                           trfcon = .true.
                           rcondo = zero
                           rcondi = zero
                        END IF
*
*                       Skip the solve tests if the matrix is singular.
*
                        IF( trfcon )
     $                     GO TO 90
*
                        DO 80 irhs = 1, nns
                           nrhs = nsval( irhs )
                           xtype = 'N'
*
                           DO 70 itran = 1, ntran
                              trans = transs( itran )
                              IF( itran.EQ.1 ) THEN
                                 rcondc = rcondo
                                 norm = 'O'
                              ELSE
                                 rcondc = rcondi
                                 norm = 'I'
                              END IF
*
*+    TEST 2:
*                             Solve and compute residual for op(A) * X = B.
*
                              srnamt = 'CLARHS'
                              CALL clarhs( path, xtype, ' ', trans, n,
     $                                     n, kl, ku, nrhs, a, lda,
     $                                     xact, ldb, b, ldb, iseed,
     $                                     info )
                              xtype = 'C'
                              CALL clacpy( 'Full', n, nrhs, b, ldb, x,
     $                                     ldb )
*
                              srnamt = 'CGBTRS'
                              CALL cgbtrs( trans, n, kl, ku, nrhs, afac,
     $                                     ldafac, iwork, x, ldb, info )
*
*                             Check error code from CGBTRS.
*
                              IF( info.NE.0 )
     $                           CALL alaerh( path, 'CGBTRS', info, 0,
     $                                        trans, n, n, kl, ku, -1,
     $                                        imat, nfail, nerrs, nout )
*
                              CALL clacpy( 'Full', n, nrhs, b, ldb,
     $                                     work, ldb )
                              CALL cgbt02( trans, m, n, kl, ku, nrhs, a,
     $                                     lda, x, ldb, work, ldb,
     $                                     rwork, result( 2 ) )
*
*+    TEST 3:
*                             Check solution from generated exact
*                             solution.
*
                              CALL cget04( n, nrhs, x, ldb, xact, ldb,
     $                                     rcondc, result( 3 ) )
*
*+    TESTS 4, 5, 6:
*                             Use iterative refinement to improve the
*                             solution.
*
                              srnamt = 'CGBRFS'
                              CALL cgbrfs( trans, n, kl, ku, nrhs, a,
     $                                     lda, afac, ldafac, iwork, b,
     $                                     ldb, x, ldb, rwork,
     $                                     rwork( nrhs+1 ), work,
     $                                     rwork( 2*nrhs+1 ), info )
*
*                             Check error code from CGBRFS.
*
                              IF( info.NE.0 )
     $                           CALL alaerh( path, 'CGBRFS', info, 0,
     $                                        trans, n, n, kl, ku, nrhs,
     $                                        imat, nfail, nerrs, nout )
*
                              CALL cget04( n, nrhs, x, ldb, xact, ldb,
     $                                     rcondc, result( 4 ) )
                              CALL cgbt05( trans, n, kl, ku, nrhs, a,
     $                                     lda, b, ldb, x, ldb, xact,
     $                                     ldb, rwork, rwork( nrhs+1 ),
     $                                     result( 5 ) )
*
*                             Print information about the tests that did
*                             not pass the threshold.
*
                              DO 60 k = 2, 6
                                 IF( result( k ).GE.thresh ) THEN
                                    IF( nfail.EQ.0 .AND. nerrs.EQ.0 )
     $                                 CALL alahd( nout, path )
                                    WRITE( nout, fmt = 9996 )trans, n,
     $                                 kl, ku, nrhs, imat, k,
     $                                 result( k )
                                    nfail = nfail + 1
                                 END IF
   60                         CONTINUE
                              nrun = nrun + 5
   70                      CONTINUE
   80                   CONTINUE
*
*+    TEST 7:
*                          Get an estimate of RCOND = 1/CNDNUM.
*
   90                   CONTINUE
                        DO 100 itran = 1, 2
                           IF( itran.EQ.1 ) THEN
                              anorm = anormo
                              rcondc = rcondo
                              norm = 'O'
                           ELSE
                              anorm = anormi
                              rcondc = rcondi
                              norm = 'I'
                           END IF
                           srnamt = 'CGBCON'
                           CALL cgbcon( norm, n, kl, ku, afac, ldafac,
     $                                  iwork, anorm, rcond, work,
     $                                  rwork, info )
*
*                             Check error code from CGBCON.
*
                           IF( info.NE.0 )
     $                        CALL alaerh( path, 'CGBCON', info, 0,
     $                                     norm, n, n, kl, ku, -1, imat,
     $                                     nfail, nerrs, nout )
*
                           result( 7 ) = sget06( rcond, rcondc )
*
*                          Print information about the tests that did
*                          not pass the threshold.
*
                           IF( result( 7 ).GE.thresh ) THEN
                              IF( nfail.EQ.0 .AND. nerrs.EQ.0 )
     $                           CALL alahd( nout, path )
                              WRITE( nout, fmt = 9995 )norm, n, kl, ku,
     $                           imat, 7, result( 7 )
                              nfail = nfail + 1
                           END IF
                           nrun = nrun + 1
  100                   CONTINUE
  110                CONTINUE
  120             CONTINUE
  130          CONTINUE
  140       CONTINUE
  150    CONTINUE
  160 CONTINUE
*
*     Print a summary of the results.
*
      CALL alasum( path, nout, nfail, nrun, nerrs )
*
 9999 FORMAT( ' *** In CCHKGB, LA=', i5, ' is too small for M=', i5,
     $      ', N=', i5, ', KL=', i4, ', KU=', i4,
     $      / ' ==> Increase LA to at least ', i5 )
 9998 FORMAT( ' *** In CCHKGB, LAFAC=', i5, ' is too small for M=', i5,
     $      ', N=', i5, ', KL=', i4, ', KU=', i4,
     $      / ' ==> Increase LAFAC to at least ', i5 )
 9997 FORMAT( ' M =', i5, ', N =', i5, ', KL=', i5, ', KU=', i5,
     $      ', NB =', i4, ', type ', i1, ', test(', i1, ')=', g12.5 )
 9996 FORMAT( ' TRANS=''', a1, ''', N=', i5, ', KL=', i5, ', KU=', i5,
     $      ', NRHS=', i3, ', type ', i1, ', test(', i1, ')=', g12.5 )
 9995 FORMAT( ' NORM =''', a1, ''', N=', i5, ', KL=', i5, ', KU=', i5,
     $      ',', 10x, ' type ', i1, ', test(', i1, ')=', g12.5 )
*
      RETURN
*
*     End of CCHKGB
*
      END