cgtt01.f

Go to the documentation of this file.

*> \brief \b CGTT01
*
*  =========== DOCUMENTATION ===========
*
* Online html documentation available at 
*            http://www.netlib.org/lapack/explore-html/ 
*
*  Definition:
*  ===========
*
*       SUBROUTINE CGTT01( N, DL, D, DU, DLF, DF, DUF, DU2, IPIV, WORK,
*                          LDWORK, RWORK, RESID )
* 
*       .. Scalar Arguments ..
*       INTEGER            LDWORK, N
*       REAL               RESID
*       ..
*       .. Array Arguments ..
*       INTEGER            IPIV( * )
*       REAL               RWORK( * )
*       COMPLEX            D( * ), DF( * ), DL( * ), DLF( * ), DU( * ),
*      $                   DU2( * ), DUF( * ), WORK( LDWORK, * )
*       ..
*  
*
*> \par Purpose:
*  =============
*>
*> \verbatim
*>
*> CGTT01 reconstructs a tridiagonal matrix A from its LU factorization
*> and computes the residual
*>    norm(L*U - A) / ( norm(A) * EPS ),
*> where EPS is the machine epsilon.
*> \endverbatim
*
*  Arguments:
*  ==========
*
*> \param[in] N
*> \verbatim
*>          N is INTEGTER
*>          The order of the matrix A.  N >= 0.
*> \endverbatim
*>
*> \param[in] DL
*> \verbatim
*>          DL is COMPLEX array, dimension (N-1)
*>          The (n-1) sub-diagonal elements of A.
*> \endverbatim
*>
*> \param[in] D
*> \verbatim
*>          D is COMPLEX array, dimension (N)
*>          The diagonal elements of A.
*> \endverbatim
*>
*> \param[in] DU
*> \verbatim
*>          DU is COMPLEX array, dimension (N-1)
*>          The (n-1) super-diagonal elements of A.
*> \endverbatim
*>
*> \param[in] DLF
*> \verbatim
*>          DLF is COMPLEX array, dimension (N-1)
*>          The (n-1) multipliers that define the matrix L from the
*>          LU factorization of A.
*> \endverbatim
*>
*> \param[in] DF
*> \verbatim
*>          DF is COMPLEX array, dimension (N)
*>          The n diagonal elements of the upper triangular matrix U from
*>          the LU factorization of A.
*> \endverbatim
*>
*> \param[in] DUF
*> \verbatim
*>          DUF is COMPLEX array, dimension (N-1)
*>          The (n-1) elements of the first super-diagonal of U.
*> \endverbatim
*>
*> \param[in] DU2
*> \verbatim
*>          DU2 is COMPLEX array, dimension (N-2)
*>          The (n-2) elements of the second super-diagonal of U.
*> \endverbatim
*>
*> \param[in] IPIV
*> \verbatim
*>          IPIV is INTEGER array, dimension (N)
*>          The pivot indices; for 1 <= i <= n, row i of the matrix was
*>          interchanged with row IPIV(i).  IPIV(i) will always be either
*>          i or i+1; IPIV(i) = i indicates a row interchange was not
*>          required.
*> \endverbatim
*>
*> \param[out] WORK
*> \verbatim
*>          WORK is COMPLEX array, dimension (LDWORK,N)
*> \endverbatim
*>
*> \param[in] LDWORK
*> \verbatim
*>          LDWORK is INTEGER
*>          The leading dimension of the array WORK.  LDWORK >= max(1,N).
*> \endverbatim
*>
*> \param[out] RWORK
*> \verbatim
*>          RWORK is REAL array, dimension (N)
*> \endverbatim
*>
*> \param[out] RESID
*> \verbatim
*>          RESID is REAL
*>          The scaled residual:  norm(L*U - A) / (norm(A) * EPS)
*> \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 cgtt01( N, DL, D, DU, DLF, DF, DUF, DU2, IPIV, WORK,
     $                   ldwork, rwork, resid )
*
*  -- 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 ..
      INTEGER            LDWORK, N
      REAL               RESID
*     ..
*     .. Array Arguments ..
      INTEGER            IPIV( * )
      REAL               RWORK( * )
      COMPLEX            D( * ), DF( * ), DL( * ), DLF( * ), DU( * ),
     $                   du2( * ), duf( * ), work( ldwork, * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      REAL               ONE, ZERO
      parameter                ( one = 1.0e+0, zero = 0.0e+0 )
*     ..
*     .. Local Scalars ..
      INTEGER            I, IP, J, LASTJ
      REAL               ANORM, EPS
      COMPLEX            LI
*     ..
*     .. External Functions ..
      REAL               CLANGT, CLANHS, SLAMCH
      EXTERNAL           clangt, clanhs, slamch
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          min
*     ..
*     .. External Subroutines ..
      EXTERNAL           caxpy, cswap
*     ..
*     .. Executable Statements ..
*
*     Quick return if possible
*
      IF( n.LE.0 ) THEN
         resid = zero
         RETURN
      END IF
*
      eps = slamch( 'Epsilon' )
*
*     Copy the matrix U to WORK.
*
      DO 20 j = 1, n
         DO 10 i = 1, n
            work( i, j ) = zero
   10    CONTINUE
   20 CONTINUE
      DO 30 i = 1, n
         IF( i.EQ.1 ) THEN
            work( i, i ) = df( i )
            IF( n.GE.2 )
     $         work( i, i+1 ) = duf( i )
            IF( n.GE.3 )
     $         work( i, i+2 ) = du2( i )
         ELSE IF( i.EQ.n ) THEN
            work( i, i ) = df( i )
         ELSE
            work( i, i ) = df( i )
            work( i, i+1 ) = duf( i )
            IF( i.LT.n-1 )
     $         work( i, i+2 ) = du2( i )
         END IF
   30 CONTINUE
*
*     Multiply on the left by L.
*
      lastj = n
      DO 40 i = n - 1, 1, -1
         li = dlf( i )
         CALL caxpy( lastj-i+1, li, work( i, i ), ldwork,
     $               work( i+1, i ), ldwork )
         ip = ipiv( i )
         IF( ip.EQ.i ) THEN
            lastj = min( i+2, n )
         ELSE
            CALL cswap( lastj-i+1, work( i, i ), ldwork, work( i+1, i ),
     $                  ldwork )
         END IF
   40 CONTINUE
*
*     Subtract the matrix A.
*
      work( 1, 1 ) = work( 1, 1 ) - d( 1 )
      IF( n.GT.1 ) THEN
         work( 1, 2 ) = work( 1, 2 ) - du( 1 )
         work( n, n-1 ) = work( n, n-1 ) - dl( n-1 )
         work( n, n ) = work( n, n ) - d( n )
         DO 50 i = 2, n - 1
            work( i, i-1 ) = work( i, i-1 ) - dl( i-1 )
            work( i, i ) = work( i, i ) - d( i )
            work( i, i+1 ) = work( i, i+1 ) - du( i )
   50    CONTINUE
      END IF
*
*     Compute the 1-norm of the tridiagonal matrix A.
*
      anorm = clangt( '1', n, dl, d, du )
*
*     Compute the 1-norm of WORK, which is only guaranteed to be
*     upper Hessenberg.
*
      resid = clanhs( '1', n, work, ldwork, rwork )
*
*     Compute norm(L*U - A) / (norm(A) * EPS)
*
      IF( anorm.LE.zero ) THEN
         IF( resid.NE.zero )
     $      resid = one / eps
      ELSE
         resid = ( resid / anorm ) / eps
      END IF
*
      RETURN
*
*     End of CGTT01
*
      END