cchkqp.f

Go to the documentation of this file.

*> \brief \b CCHKQP
*
*  =========== DOCUMENTATION ===========
*
* Online html documentation available at 
*            http://www.netlib.org/lapack/explore-html/ 
*
*  Definition:
*  ===========
*
*       SUBROUTINE CCHKQP( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A,
*                          COPYA, S, TAU, WORK, RWORK, IWORK,
*                          NOUT )
* 
*       .. Scalar Arguments ..
*       LOGICAL            TSTERR
*       INTEGER            NM, NN, NOUT
*       REAL               THRESH
*       ..
*       .. Array Arguments ..
*       LOGICAL            DOTYPE( * )
*       INTEGER            IWORK( * ), MVAL( * ), NVAL( * )
*       REAL               S( * ), RWORK( * )
*       COMPLEX            A( * ), COPYA( * ), TAU( * ), WORK( * )
*       ..
*  
*
*> \par Purpose:
*  =============
*>
*> \verbatim
*>
*> CCHKQP tests CGEQPF.
*> \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] 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 (MMAX*NMAX)
*>          where MMAX is the maximum value of M in MVAL and NMAX is the
*>          maximum value of N in NVAL.
*> \endverbatim
*>
*> \param[out] COPYA
*> \verbatim
*>          COPYA is COMPLEX array, dimension (MMAX*NMAX)
*> \endverbatim
*>
*> \param[out] S
*> \verbatim
*>          S is REAL array, dimension
*>                      (min(MMAX,NMAX))
*> \endverbatim
*>
*> \param[out] TAU
*> \verbatim
*>          TAU is COMPLEX array, dimension (MMAX)
*> \endverbatim
*>
*> \param[out] WORK
*> \verbatim
*>          WORK is COMPLEX array, dimension
*>                      (max(M*max(M,N) + 4*min(M,N) + max(M,N)))
*> \endverbatim
*>
*> \param[out] RWORK
*> \verbatim
*>          RWORK is REAL array, dimension (4*NMAX)
*> \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. 
*
*> \date November 2011
*
*> \ingroup complex_lin
*
*  =====================================================================
      SUBROUTINE cchkqp( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A,
     $                   copya, s, tau, work, rwork, iwork,
     $                   nout )
*
*  -- LAPACK test routine (version 3.4.0) --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*     November 2011
*
*     .. Scalar Arguments ..
      LOGICAL            tsterr
      INTEGER            nm, nn, nout
      REAL               thresh
*     ..
*     .. Array Arguments ..
      LOGICAL            dotype( * )
      INTEGER            iwork( * ), mval( * ), nval( * )
      REAL               s( * ), rwork( * )
      COMPLEX            a( * ), copya( * ), tau( * ), work( * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      INTEGER            ntypes
      parameter( ntypes = 6 )
      INTEGER            ntests
      parameter( ntests = 3 )
      REAL               one, zero
      parameter( one = 1.0e0, zero = 0.0e0 )
*     ..
*     .. Local Scalars ..
      CHARACTER*3        path
      INTEGER            i, ihigh, ilow, im, imode, in, info, istep, k,
     $                   lda, lwork, m, mnmin, mode, n, nerrs, nfail,
     $                   nrun
      REAL               eps
*     ..
*     .. Local Arrays ..
      INTEGER            iseed( 4 ), iseedy( 4 )
      REAL               result( ntests )
*     ..
*     .. External Functions ..
      REAL               cqpt01, cqrt11, cqrt12, slamch
      EXTERNAL           cqpt01, cqrt11, cqrt12, slamch
*     ..
*     .. External Subroutines ..
      EXTERNAL           alahd, alasum, cerrqp, cgeqpf, clacpy, claset,
     $                   clatms, slaord
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          cmplx, max, min
*     ..
*     .. Scalars in Common ..
      LOGICAL            lerr, ok
      CHARACTER*32       srnamt
      INTEGER            infot, iounit
*     ..
*     .. Common blocks ..
      common             / infoc / infot, iounit, ok, lerr
      common             / srnamc / srnamt
*     ..
*     .. Data statements ..
      DATA               iseedy / 1988, 1989, 1990, 1991 /
*     ..
*     .. Executable Statements ..
*
*     Initialize constants and the random number seed.
*
      path( 1: 1 ) = 'Complex precision'
      path( 2: 3 ) = 'QP'
      nrun = 0
      nfail = 0
      nerrs = 0
      DO 10 i = 1, 4
         iseed( i ) = iseedy( i )
   10 continue
      eps = slamch( 'Epsilon' )
*
*     Test the error exits
*
      IF( tsterr )
     $   CALL cerrqp( path, nout )
      infot = 0
*
      DO 80 im = 1, nm
*
*        Do for each value of M in MVAL.
*
         m = mval( im )
         lda = max( 1, m )
*
         DO 70 in = 1, nn
*
*           Do for each value of N in NVAL.
*
            n = nval( in )
            mnmin = min( m, n )
            lwork = max( 1, m*max( m, n )+4*mnmin+max( m, n ) )
*
            DO 60 imode = 1, ntypes
               IF( .NOT.dotype( imode ) )
     $            go to 60
*
*              Do for each type of matrix
*                 1:  zero matrix
*                 2:  one small singular value
*                 3:  geometric distribution of singular values
*                 4:  first n/2 columns fixed
*                 5:  last n/2 columns fixed
*                 6:  every second column fixed
*
               mode = imode
               IF( imode.GT.3 )
     $            mode = 1
*
*              Generate test matrix of size m by n using
*              singular value distribution indicated by `mode'.
*
               DO 20 i = 1, n
                  iwork( i ) = 0
   20          continue
               IF( imode.EQ.1 ) THEN
                  CALL claset( 'Full', m, n, cmplx( zero ),
     $                         cmplx( zero ), copya, lda )
                  DO 30 i = 1, mnmin
                     s( i ) = zero
   30             continue
               ELSE
                  CALL clatms( m, n, 'Uniform', iseed, 'Nonsymm', s,
     $                         mode, one / eps, one, m, n, 'No packing',
     $                         copya, lda, work, info )
                  IF( imode.GE.4 ) THEN
                     IF( imode.EQ.4 ) THEN
                        ilow = 1
                        istep = 1
                        ihigh = max( 1, n / 2 )
                     ELSE IF( imode.EQ.5 ) THEN
                        ilow = max( 1, n / 2 )
                        istep = 1
                        ihigh = n
                     ELSE IF( imode.EQ.6 ) THEN
                        ilow = 1
                        istep = 2
                        ihigh = n
                     END IF
                     DO 40 i = ilow, ihigh, istep
                        iwork( i ) = 1
   40                continue
                  END IF
                  CALL slaord( 'Decreasing', mnmin, s, 1 )
               END IF
*
*              Save A and its singular values
*
               CALL clacpy( 'All', m, n, copya, lda, a, lda )
*
*              Compute the QR factorization with pivoting of A
*
               srnamt = 'CGEQPF'
               CALL cgeqpf( m, n, a, lda, iwork, tau, work, rwork,
     $                      info )
*
*              Compute norm(svd(a) - svd(r))
*
               result( 1 ) = cqrt12( m, n, a, lda, s, work, lwork,
     $                       rwork )
*
*              Compute norm( A*P - Q*R )
*
               result( 2 ) = cqpt01( m, n, mnmin, copya, a, lda, tau,
     $                       iwork, work, lwork )
*
*              Compute Q'*Q
*
               result( 3 ) = cqrt11( m, mnmin, a, lda, tau, work,
     $                       lwork )
*
*              Print information about the tests that did not pass
*              the threshold.
*
               DO 50 k = 1, 3
                  IF( result( k ).GE.thresh ) THEN
                     IF( nfail.EQ.0 .AND. nerrs.EQ.0 )
     $                  CALL alahd( nout, path )
                     WRITE( nout, fmt = 9999 )m, n, imode, k,
     $                  result( k )
                     nfail = nfail + 1
                  END IF
   50          continue
               nrun = nrun + 3
   60       continue
   70    continue
   80 continue
*
*     Print a summary of the results.
*
      CALL alasum( path, nout, nfail, nrun, nerrs )
*
 9999 format( ' M =', i5, ', N =', i5, ', type ', i2, ', test ', i2,
     $      ', ratio =', g12.5 )
*
*     End of CCHKQP
*
      END