dlatdf.f

Go to the documentation of this file.

*> \brief \b DLATDF uses the LU factorization of the n-by-n matrix computed by sgetc2 and computes a contribution to the reciprocal Dif-estimate.
*
*  =========== DOCUMENTATION ===========
*
* Online html documentation available at 
*            http://www.netlib.org/lapack/explore-html/ 
*
*> \htmlonly
*> Download DLATDF + dependencies 
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlatdf.f"> 
*> [TGZ]</a> 
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlatdf.f"> 
*> [ZIP]</a> 
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlatdf.f"> 
*> [TXT]</a>
*> \endhtmlonly 
*
*  Definition:
*  ===========
*
*       SUBROUTINE DLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
*                          JPIV )
* 
*       .. Scalar Arguments ..
*       INTEGER            IJOB, LDZ, N
*       DOUBLE PRECISION   RDSCAL, RDSUM
*       ..
*       .. Array Arguments ..
*       INTEGER            IPIV( * ), JPIV( * )
*       DOUBLE PRECISION   RHS( * ), Z( LDZ, * )
*       ..
*  
*
*> \par Purpose:
*  =============
*>
*> \verbatim
*>
*> DLATDF uses the LU factorization of the n-by-n matrix Z computed by
*> DGETC2 and computes a contribution to the reciprocal Dif-estimate
*> by solving Z * x = b for x, and choosing the r.h.s. b such that
*> the norm of x is as large as possible. On entry RHS = b holds the
*> contribution from earlier solved sub-systems, and on return RHS = x.
*>
*> The factorization of Z returned by DGETC2 has the form Z = P*L*U*Q,
*> where P and Q are permutation matrices. L is lower triangular with
*> unit diagonal elements and U is upper triangular.
*> \endverbatim
*
*  Arguments:
*  ==========
*
*> \param[in] IJOB
*> \verbatim
*>          IJOB is INTEGER
*>          IJOB = 2: First compute an approximative null-vector e
*>              of Z using DGECON, e is normalized and solve for
*>              Zx = +-e - f with the sign giving the greater value
*>              of 2-norm(x). About 5 times as expensive as Default.
*>          IJOB .ne. 2: Local look ahead strategy where all entries of
*>              the r.h.s. b is choosen as either +1 or -1 (Default).
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*>          N is INTEGER
*>          The number of columns of the matrix Z.
*> \endverbatim
*>
*> \param[in] Z
*> \verbatim
*>          Z is DOUBLE PRECISION array, dimension (LDZ, N)
*>          On entry, the LU part of the factorization of the n-by-n
*>          matrix Z computed by DGETC2:  Z = P * L * U * Q
*> \endverbatim
*>
*> \param[in] LDZ
*> \verbatim
*>          LDZ is INTEGER
*>          The leading dimension of the array Z.  LDA >= max(1, N).
*> \endverbatim
*>
*> \param[in,out] RHS
*> \verbatim
*>          RHS is DOUBLE PRECISION array, dimension (N)
*>          On entry, RHS contains contributions from other subsystems.
*>          On exit, RHS contains the solution of the subsystem with
*>          entries acoording to the value of IJOB (see above).
*> \endverbatim
*>
*> \param[in,out] RDSUM
*> \verbatim
*>          RDSUM is DOUBLE PRECISION
*>          On entry, the sum of squares of computed contributions to
*>          the Dif-estimate under computation by DTGSYL, where the
*>          scaling factor RDSCAL (see below) has been factored out.
*>          On exit, the corresponding sum of squares updated with the
*>          contributions from the current sub-system.
*>          If TRANS = 'T' RDSUM is not touched.
*>          NOTE: RDSUM only makes sense when DTGSY2 is called by STGSYL.
*> \endverbatim
*>
*> \param[in,out] RDSCAL
*> \verbatim
*>          RDSCAL is DOUBLE PRECISION
*>          On entry, scaling factor used to prevent overflow in RDSUM.
*>          On exit, RDSCAL is updated w.r.t. the current contributions
*>          in RDSUM.
*>          If TRANS = 'T', RDSCAL is not touched.
*>          NOTE: RDSCAL only makes sense when DTGSY2 is called by
*>                DTGSYL.
*> \endverbatim
*>
*> \param[in] IPIV
*> \verbatim
*>          IPIV is INTEGER array, dimension (N).
*>          The pivot indices; for 1 <= i <= N, row i of the
*>          matrix has been interchanged with row IPIV(i).
*> \endverbatim
*>
*> \param[in] JPIV
*> \verbatim
*>          JPIV is INTEGER array, dimension (N).
*>          The pivot indices; for 1 <= j <= N, column j of the
*>          matrix has been interchanged with column JPIV(j).
*> \endverbatim
*
*  Authors:
*  ========
*
*> \author Univ. of Tennessee 
*> \author Univ. of California Berkeley 
*> \author Univ. of Colorado Denver 
*> \author NAG Ltd. 
*
*> \date September 2012
*
*> \ingroup doubleOTHERauxiliary
*
*> \par Further Details:
*  =====================
*>
*>  This routine is a further developed implementation of algorithm
*>  BSOLVE in [1] using complete pivoting in the LU factorization.
*
*> \par Contributors:
*  ==================
*>
*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
*>     Umea University, S-901 87 Umea, Sweden.
*
*> \par References:
*  ================
*>
*> \verbatim
*>
*>
*>  [1] Bo Kagstrom and Lars Westin,
*>      Generalized Schur Methods with Condition Estimators for
*>      Solving the Generalized Sylvester Equation, IEEE Transactions
*>      on Automatic Control, Vol. 34, No. 7, July 1989, pp 745-751.
*>
*>  [2] Peter Poromaa,
*>      On Efficient and Robust Estimators for the Separation
*>      between two Regular Matrix Pairs with Applications in
*>      Condition Estimation. Report IMINF-95.05, Departement of
*>      Computing Science, Umea University, S-901 87 Umea, Sweden, 1995.
*> \endverbatim
*>
*  =====================================================================
      SUBROUTINE dlatdf( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
     $                   jpiv )
*
*  -- LAPACK auxiliary routine (version 3.4.2) --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*     September 2012
*
*     .. Scalar Arguments ..
      INTEGER            ijob, ldz, n
      DOUBLE PRECISION   rdscal, rdsum
*     ..
*     .. Array Arguments ..
      INTEGER            ipiv( * ), jpiv( * )
      DOUBLE PRECISION   rhs( * ), z( ldz, * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      INTEGER            maxdim
      parameter( maxdim = 8 )
      DOUBLE PRECISION   zero, one
      parameter( zero = 0.0d+0, one = 1.0d+0 )
*     ..
*     .. Local Scalars ..
      INTEGER            i, info, j, k
      DOUBLE PRECISION   bm, bp, pmone, sminu, splus, temp
*     ..
*     .. Local Arrays ..
      INTEGER            iwork( maxdim )
      DOUBLE PRECISION   work( 4*maxdim ), xm( maxdim ), xp( maxdim )
*     ..
*     .. External Subroutines ..
      EXTERNAL           daxpy, dcopy, dgecon, dgesc2, dlassq, dlaswp,
     $                   dscal
*     ..
*     .. External Functions ..
      DOUBLE PRECISION   dasum, ddot
      EXTERNAL           dasum, ddot
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          abs, sqrt
*     ..
*     .. Executable Statements ..
*
      IF( ijob.NE.2 ) THEN
*
*        Apply permutations IPIV to RHS
*
         CALL dlaswp( 1, rhs, ldz, 1, n-1, ipiv, 1 )
*
*        Solve for L-part choosing RHS either to +1 or -1.
*
         pmone = -one
*
         DO 10 j = 1, n - 1
            bp = rhs( j ) + one
            bm = rhs( j ) - one
            splus = one
*
*           Look-ahead for L-part RHS(1:N-1) = + or -1, SPLUS and
*           SMIN computed more efficiently than in BSOLVE [1].
*
            splus = splus + ddot( n-j, z( j+1, j ), 1, z( j+1, j ), 1 )
            sminu = ddot( n-j, z( j+1, j ), 1, rhs( j+1 ), 1 )
            splus = splus*rhs( j )
            IF( splus.GT.sminu ) THEN
               rhs( j ) = bp
            ELSE IF( sminu.GT.splus ) THEN
               rhs( j ) = bm
            ELSE
*
*              In this case the updating sums are equal and we can
*              choose RHS(J) +1 or -1. The first time this happens
*              we choose -1, thereafter +1. This is a simple way to
*              get good estimates of matrices like Byers well-known
*              example (see [1]). (Not done in BSOLVE.)
*
               rhs( j ) = rhs( j ) + pmone
               pmone = one
            END IF
*
*           Compute the remaining r.h.s.
*
            temp = -rhs( j )
            CALL daxpy( n-j, temp, z( j+1, j ), 1, rhs( j+1 ), 1 )
*
   10    continue
*
*        Solve for U-part, look-ahead for RHS(N) = +-1. This is not done
*        in BSOLVE and will hopefully give us a better estimate because
*        any ill-conditioning of the original matrix is transfered to U
*        and not to L. U(N, N) is an approximation to sigma_min(LU).
*
         CALL dcopy( n-1, rhs, 1, xp, 1 )
         xp( n ) = rhs( n ) + one
         rhs( n ) = rhs( n ) - one
         splus = zero
         sminu = zero
         DO 30 i = n, 1, -1
            temp = one / z( i, i )
            xp( i ) = xp( i )*temp
            rhs( i ) = rhs( i )*temp
            DO 20 k = i + 1, n
               xp( i ) = xp( i ) - xp( k )*( z( i, k )*temp )
               rhs( i ) = rhs( i ) - rhs( k )*( z( i, k )*temp )
   20       continue
            splus = splus + abs( xp( i ) )
            sminu = sminu + abs( rhs( i ) )
   30    continue
         IF( splus.GT.sminu )
     $      CALL dcopy( n, xp, 1, rhs, 1 )
*
*        Apply the permutations JPIV to the computed solution (RHS)
*
         CALL dlaswp( 1, rhs, ldz, 1, n-1, jpiv, -1 )
*
*        Compute the sum of squares
*
         CALL dlassq( n, rhs, 1, rdscal, rdsum )
*
      ELSE
*
*        IJOB = 2, Compute approximate nullvector XM of Z
*
         CALL dgecon( 'I', n, z, ldz, one, temp, work, iwork, info )
         CALL dcopy( n, work( n+1 ), 1, xm, 1 )
*
*        Compute RHS
*
         CALL dlaswp( 1, xm, ldz, 1, n-1, ipiv, -1 )
         temp = one / sqrt( ddot( n, xm, 1, xm, 1 ) )
         CALL dscal( n, temp, xm, 1 )
         CALL dcopy( n, xm, 1, xp, 1 )
         CALL daxpy( n, one, rhs, 1, xp, 1 )
         CALL daxpy( n, -one, xm, 1, rhs, 1 )
         CALL dgesc2( n, z, ldz, rhs, ipiv, jpiv, temp )
         CALL dgesc2( n, z, ldz, xp, ipiv, jpiv, temp )
         IF( dasum( n, xp, 1 ).GT.dasum( n, rhs, 1 ) )
     $      CALL dcopy( n, xp, 1, rhs, 1 )
*
*        Compute the sum of squares
*
         CALL dlassq( n, rhs, 1, rdscal, rdsum )
*
      END IF
*
      return
*
*     End of DLATDF
*
      END