ddrvpt()

subroutine ddrvpt	(	logical, dimension( * )	dotype,
		integer	nn,
		integer, dimension( * )	nval,
		integer	nrhs,
		double precision	thresh,
		logical	tsterr,
		double precision, dimension( * )	a,
		double precision, dimension( * )	d,
		double precision, dimension( * )	e,
		double precision, dimension( * )	b,
		double precision, dimension( * )	x,
		double precision, dimension( * )	xact,
		double precision, dimension( * )	work,
		double precision, dimension( * )	rwork,
		integer	nout )

DDRVPT

Purpose:

!>
!> DDRVPT tests DPTSV and -SVX.
!> 

Parameters

[in]	DOTYPE	!> 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. !>
[in]	NN	!> NN is INTEGER !> The number of values of N contained in the vector NVAL. !>
[in]	NVAL	!> NVAL is INTEGER array, dimension (NN) !> The values of the matrix dimension N. !>
[in]	NRHS	!> NRHS is INTEGER !> The number of right hand side vectors to be generated for !> each linear system. !>
[in]	THRESH	!> THRESH is DOUBLE PRECISION !> 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. !>
[in]	TSTERR	!> TSTERR is LOGICAL !> Flag that indicates whether error exits are to be tested. !>
[out]	A	!> A is DOUBLE PRECISION array, dimension (NMAX*2) !>
[out]	D	!> D is DOUBLE PRECISION array, dimension (NMAX*2) !>
[out]	E	!> E is DOUBLE PRECISION array, dimension (NMAX*2) !>
[out]	B	!> B is DOUBLE PRECISION array, dimension (NMAX*NRHS) !>
[out]	X	!> X is DOUBLE PRECISION array, dimension (NMAX*NRHS) !>
[out]	XACT	!> XACT is DOUBLE PRECISION array, dimension (NMAX*NRHS) !>
[out]	WORK	!> WORK is DOUBLE PRECISION array, dimension !> (NMAX*max(3,NRHS)) !>
[out]	RWORK	!> RWORK is DOUBLE PRECISION array, dimension !> (max(NMAX,2*NRHS)) !>
[in]	NOUT	!> NOUT is INTEGER !> The unit number for output. !>

Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

Definition at line 138 of file ddrvpt.f.

*
*  -- 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            NN, NOUT, NRHS
      DOUBLE PRECISION   THRESH
*     ..
*     .. Array Arguments ..
      LOGICAL            DOTYPE( * )
      INTEGER            NVAL( * )
      DOUBLE PRECISION   A( * ), B( * ), D( * ), E( * ), RWORK( * ),
     $                   WORK( * ), X( * ), XACT( * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      DOUBLE PRECISION   ONE, ZERO
      parameter( one = 1.0d+0, zero = 0.0d+0 )
      INTEGER            NTYPES
      parameter( ntypes = 12 )
      INTEGER            NTESTS
      parameter( ntests = 6 )
*     ..
*     .. Local Scalars ..
      LOGICAL            ZEROT
      CHARACTER          DIST, FACT, TYPE
      CHARACTER*3        PATH
      INTEGER            I, IA, IFACT, IMAT, IN, INFO, IX, IZERO, J, K,
     $                   K1, KL, KU, LDA, MODE, N, NERRS, NFAIL, NIMAT,
     $                   NRUN, NT
      DOUBLE PRECISION   AINVNM, ANORM, COND, DMAX, RCOND, RCONDC
*     ..
*     .. Local Arrays ..
      INTEGER            ISEED( 4 ), ISEEDY( 4 )
      DOUBLE PRECISION   RESULT( NTESTS ), Z( 3 )
*     ..
*     .. External Functions ..
      INTEGER            IDAMAX
      DOUBLE PRECISION   DASUM, DGET06, DLANST
      EXTERNAL           idamax, dasum, dget06, dlanst
*     ..
*     .. External Subroutines ..
      EXTERNAL           aladhd, alaerh, alasvm, dcopy, derrvx, dget04,
     $                   dlacpy, dlaptm, dlarnv, dlaset, dlatb4, dlatms,
     $                   dptsv, dptsvx, dptt01, dptt02, dptt05, dpttrf,
     $                   dpttrs, dscal
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          abs, max
*     ..
*     .. 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 / 0, 0, 0, 1 /
*     ..
*     .. Executable Statements ..
*
      path( 1: 1 ) = 'Double precision'
      path( 2: 3 ) = 'PT'
      nrun = 0
      nfail = 0
      nerrs = 0
      DO 10 i = 1, 4
         iseed( i ) = iseedy( i )
   10 CONTINUE
*
*     Test the error exits
*
      IF( tsterr )
     $   CALL derrvx( path, nout )
      infot = 0
*
      DO 120 in = 1, nn
*
*        Do for each value of N in NVAL.
*
         n = nval( in )
         lda = max( 1, n )
         nimat = ntypes
         IF( n.LE.0 )
     $      nimat = 1
*
         DO 110 imat = 1, nimat
*
*           Do the tests only if DOTYPE( IMAT ) is true.
*
            IF( n.GT.0 .AND. .NOT.dotype( imat ) )
     $         GO TO 110
*
*           Set up parameters with DLATB4.
*
            CALL dlatb4( path, imat, n, n, TYPE, KL, KU, ANORM, MODE,
     $                   COND, DIST )
*
            zerot = imat.GE.8 .AND. imat.LE.10
            IF( imat.LE.6 ) THEN
*
*              Type 1-6:  generate a symmetric tridiagonal matrix of
*              known condition number in lower triangular band storage.
*
               srnamt = 'DLATMS'
               CALL dlatms( n, n, dist, iseed, TYPE, RWORK, MODE, COND,
     $                      ANORM, KL, KU, 'B', A, 2, WORK, INFO )
*
*              Check the error code from DLATMS.
*
               IF( info.NE.0 ) THEN
                  CALL alaerh( path, 'DLATMS', info, 0, ' ', n, n, kl,
     $                         ku, -1, imat, nfail, nerrs, nout )
                  GO TO 110
               END IF
               izero = 0
*
*              Copy the matrix to D and E.
*
               ia = 1
               DO 20 i = 1, n - 1
                  d( i ) = a( ia )
                  e( i ) = a( ia+1 )
                  ia = ia + 2
   20          CONTINUE
               IF( n.GT.0 )
     $            d( n ) = a( ia )
            ELSE
*
*              Type 7-12:  generate a diagonally dominant matrix with
*              unknown condition number in the vectors D and E.
*
               IF( .NOT.zerot .OR. .NOT.dotype( 7 ) ) THEN
*
*                 Let D and E have values from [-1,1].
*
                  CALL dlarnv( 2, iseed, n, d )
                  CALL dlarnv( 2, iseed, n-1, e )
*
*                 Make the tridiagonal matrix diagonally dominant.
*
                  IF( n.EQ.1 ) THEN
                     d( 1 ) = abs( d( 1 ) )
                  ELSE
                     d( 1 ) = abs( d( 1 ) ) + abs( e( 1 ) )
                     d( n ) = abs( d( n ) ) + abs( e( n-1 ) )
                     DO 30 i = 2, n - 1
                        d( i ) = abs( d( i ) ) + abs( e( i ) ) +
     $                           abs( e( i-1 ) )
   30                CONTINUE
                  END IF
*
*                 Scale D and E so the maximum element is ANORM.
*
                  ix = idamax( n, d, 1 )
                  dmax = d( ix )
                  CALL dscal( n, anorm / dmax, d, 1 )
                  IF( n.GT.1 )
     $               CALL dscal( n-1, anorm / dmax, e, 1 )
*
               ELSE IF( izero.GT.0 ) THEN
*
*                 Reuse the last matrix by copying back the zeroed out
*                 elements.
*
                  IF( izero.EQ.1 ) THEN
                     d( 1 ) = z( 2 )
                     IF( n.GT.1 )
     $                  e( 1 ) = z( 3 )
                  ELSE IF( izero.EQ.n ) THEN
                     e( n-1 ) = z( 1 )
                     d( n ) = z( 2 )
                  ELSE
                     e( izero-1 ) = z( 1 )
                     d( izero ) = z( 2 )
                     e( izero ) = z( 3 )
                  END IF
               END IF
*
*              For types 8-10, set one row and column of the matrix to
*              zero.
*
               izero = 0
               IF( imat.EQ.8 ) THEN
                  izero = 1
                  z( 2 ) = d( 1 )
                  d( 1 ) = zero
                  IF( n.GT.1 ) THEN
                     z( 3 ) = e( 1 )
                     e( 1 ) = zero
                  END IF
               ELSE IF( imat.EQ.9 ) THEN
                  izero = n
                  IF( n.GT.1 ) THEN
                     z( 1 ) = e( n-1 )
                     e( n-1 ) = zero
                  END IF
                  z( 2 ) = d( n )
                  d( n ) = zero
               ELSE IF( imat.EQ.10 ) THEN
                  izero = ( n+1 ) / 2
                  IF( izero.GT.1 ) THEN
                     z( 1 ) = e( izero-1 )
                     z( 3 ) = e( izero )
                     e( izero-1 ) = zero
                     e( izero ) = zero
                  END IF
                  z( 2 ) = d( izero )
                  d( izero ) = zero
               END IF
            END IF
*
*           Generate NRHS random solution vectors.
*
            ix = 1
            DO 40 j = 1, nrhs
               CALL dlarnv( 2, iseed, n, xact( ix ) )
               ix = ix + lda
   40       CONTINUE
*
*           Set the right hand side.
*
            CALL dlaptm( n, nrhs, one, d, e, xact, lda, zero, b, lda )
*
            DO 100 ifact = 1, 2
               IF( ifact.EQ.1 ) THEN
                  fact = 'F'
               ELSE
                  fact = 'N'
               END IF
*
*              Compute the condition number for comparison with
*              the value returned by DPTSVX.
*
               IF( zerot ) THEN
                  IF( ifact.EQ.1 )
     $               GO TO 100
                  rcondc = zero
*
               ELSE IF( ifact.EQ.1 ) THEN
*
*                 Compute the 1-norm of A.
*
                  anorm = dlanst( '1', n, d, e )
*
                  CALL dcopy( n, d, 1, d( n+1 ), 1 )
                  IF( n.GT.1 )
     $               CALL dcopy( n-1, e, 1, e( n+1 ), 1 )
*
*                 Factor the matrix A.
*
                  CALL dpttrf( n, d( n+1 ), e( n+1 ), info )
*
*                 Use DPTTRS to solve for one column at a time of
*                 inv(A), computing the maximum column sum as we go.
*
                  ainvnm = zero
                  DO 60 i = 1, n
                     DO 50 j = 1, n
                        x( j ) = zero
   50                CONTINUE
                     x( i ) = one
                     CALL dpttrs( n, 1, d( n+1 ), e( n+1 ), x, lda,
     $                            info )
                     ainvnm = max( ainvnm, dasum( n, x, 1 ) )
   60             CONTINUE
*
*                 Compute the 1-norm condition number of A.
*
                  IF( anorm.LE.zero .OR. ainvnm.LE.zero ) THEN
                     rcondc = one
                  ELSE
                     rcondc = ( one / anorm ) / ainvnm
                  END IF
               END IF
*
               IF( ifact.EQ.2 ) THEN
*
*                 --- Test DPTSV --
*
                  CALL dcopy( n, d, 1, d( n+1 ), 1 )
                  IF( n.GT.1 )
     $               CALL dcopy( n-1, e, 1, e( n+1 ), 1 )
                  CALL dlacpy( 'Full', n, nrhs, b, lda, x, lda )
*
*                 Factor A as L*D*L' and solve the system A*X = B.
*
                  srnamt = 'DPTSV '
                  CALL dptsv( n, nrhs, d( n+1 ), e( n+1 ), x, lda,
     $                        info )
*
*                 Check error code from DPTSV .
*
                  IF( info.NE.izero )
     $               CALL alaerh( path, 'DPTSV ', info, izero, ' ', n,
     $                            n, 1, 1, nrhs, imat, nfail, nerrs,
     $                            nout )
                  nt = 0
                  IF( izero.EQ.0 ) THEN
*
*                    Check the factorization by computing the ratio
*                       norm(L*D*L' - A) / (n * norm(A) * EPS )
*
                     CALL dptt01( n, d, e, d( n+1 ), e( n+1 ), work,
     $                            result( 1 ) )
*
*                    Compute the residual in the solution.
*
                     CALL dlacpy( 'Full', n, nrhs, b, lda, work, lda )
                     CALL dptt02( n, nrhs, d, e, x, lda, work, lda,
     $                            result( 2 ) )
*
*                    Check solution from generated exact solution.
*
                     CALL dget04( n, nrhs, x, lda, xact, lda, rcondc,
     $                            result( 3 ) )
                     nt = 3
                  END IF
*
*                 Print information about the tests that did not pass
*                 the threshold.
*
                  DO 70 k = 1, nt
                     IF( result( k ).GE.thresh ) THEN
                        IF( nfail.EQ.0 .AND. nerrs.EQ.0 )
     $                     CALL aladhd( nout, path )
                        WRITE( nout, fmt = 9999 )'DPTSV ', n, imat, k,
     $                     result( k )
                        nfail = nfail + 1
                     END IF
   70             CONTINUE
                  nrun = nrun + nt
               END IF
*
*              --- Test DPTSVX ---
*
               IF( ifact.GT.1 ) THEN
*
*                 Initialize D( N+1:2*N ) and E( N+1:2*N ) to zero.
*
                  DO 80 i = 1, n - 1
                     d( n+i ) = zero
                     e( n+i ) = zero
   80             CONTINUE
                  IF( n.GT.0 )
     $               d( n+n ) = zero
               END IF
*
               CALL dlaset( 'Full', n, nrhs, zero, zero, x, lda )
*
*              Solve the system and compute the condition number and
*              error bounds using DPTSVX.
*
               srnamt = 'DPTSVX'
               CALL dptsvx( fact, n, nrhs, d, e, d( n+1 ), e( n+1 ), b,
     $                      lda, x, lda, rcond, rwork, rwork( nrhs+1 ),
     $                      work, info )
*
*              Check the error code from DPTSVX.
*
               IF( info.NE.izero )
     $            CALL alaerh( path, 'DPTSVX', info, izero, fact, n, n,
     $                         1, 1, nrhs, imat, nfail, nerrs, nout )
               IF( izero.EQ.0 ) THEN
                  IF( ifact.EQ.2 ) THEN
*
*                    Check the factorization by computing the ratio
*                       norm(L*D*L' - A) / (n * norm(A) * EPS )
*
                     k1 = 1
                     CALL dptt01( n, d, e, d( n+1 ), e( n+1 ), work,
     $                            result( 1 ) )
                  ELSE
                     k1 = 2
                  END IF
*
*                 Compute the residual in the solution.
*
                  CALL dlacpy( 'Full', n, nrhs, b, lda, work, lda )
                  CALL dptt02( n, nrhs, d, e, x, lda, work, lda,
     $                         result( 2 ) )
*
*                 Check solution from generated exact solution.
*
                  CALL dget04( n, nrhs, x, lda, xact, lda, rcondc,
     $                         result( 3 ) )
*
*                 Check error bounds from iterative refinement.
*
                  CALL dptt05( n, nrhs, d, e, b, lda, x, lda, xact, lda,
     $                         rwork, rwork( nrhs+1 ), result( 4 ) )
               ELSE
                  k1 = 6
               END IF
*
*              Check the reciprocal of the condition number.
*
               result( 6 ) = dget06( rcond, rcondc )
*
*              Print information about the tests that did not pass
*              the threshold.
*
               DO 90 k = k1, 6
                  IF( result( k ).GE.thresh ) THEN
                     IF( nfail.EQ.0 .AND. nerrs.EQ.0 )
     $                  CALL aladhd( nout, path )
                     WRITE( nout, fmt = 9998 )'DPTSVX', fact, n, imat,
     $                  k, result( k )
                     nfail = nfail + 1
                  END IF
   90          CONTINUE
               nrun = nrun + 7 - k1
  100       CONTINUE
  110    CONTINUE
  120 CONTINUE
*
*     Print a summary of the results.
*
      CALL alasvm( path, nout, nfail, nrun, nerrs )
*
 9999 FORMAT( 1x, a, ', N =', i5, ', type ', i2, ', test ', i2,
     $      ', ratio = ', g12.5 )
 9998 FORMAT( 1x, a, ', FACT=''', a1, ''', N =', i5, ', type ', i2,
     $      ', test ', i2, ', ratio = ', g12.5 )
      RETURN
*
*     End of DDRVPT
*

Here is the call graph for this function:

Here is the caller graph for this function: