[BACK]Return to zla_gercond_c.f CVS log [TXT] [DIR] Up to [local] / rpl / lapack / lapack

Diff for /rpl/lapack/lapack/zla_gercond_c.f between versions 1.5 and 1.6

version 1.5, 2011/07/22 07:38:16 version 1.6, 2011/11/21 20:43:13
Line 1 Line 1
   *> \brief \b ZLA_GERCOND_C
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at 
   *            http://www.netlib.org/lapack/explore-html/ 
   *
   *> \htmlonly
   *> Download ZLA_GERCOND_C + dependencies 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zla_gercond_c.f"> 
   *> [TGZ]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zla_gercond_c.f"> 
   *> [ZIP]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zla_gercond_c.f"> 
   *> [TXT]</a>
   *> \endhtmlonly 
   *
   *  Definition:
   *  ===========
   *
   *       DOUBLE PRECISION FUNCTION ZLA_GERCOND_C( TRANS, N, A, LDA, AF, 
   *                                                LDAF, IPIV, C, CAPPLY,
   *                                                INFO, WORK, RWORK )
   * 
   *       .. Scalar Aguments ..
   *       CHARACTER          TRANS
   *       LOGICAL            CAPPLY
   *       INTEGER            N, LDA, LDAF, INFO
   *       ..
   *       .. Array Arguments ..
   *       INTEGER            IPIV( * )
   *       COMPLEX*16         A( LDA, * ), AF( LDAF, * ), WORK( * )
   *       DOUBLE PRECISION   C( * ), RWORK( * )
   *       ..
   *  
   *
   *> \par Purpose:
   *  =============
   *>
   *> \verbatim
   *>
   *>    ZLA_GERCOND_C computes the infinity norm condition number of
   *>    op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector.
   *> \endverbatim
   *
   *  Arguments:
   *  ==========
   *
   *> \param[in] TRANS
   *> \verbatim
   *>          TRANS is CHARACTER*1
   *>     Specifies the form of the system of equations:
   *>       = 'N':  A * X = B     (No transpose)
   *>       = 'T':  A**T * X = B  (Transpose)
   *>       = 'C':  A**H * X = B  (Conjugate Transpose = Transpose)
   *> \endverbatim
   *>
   *> \param[in] N
   *> \verbatim
   *>          N is INTEGER
   *>     The number of linear equations, i.e., the order of the
   *>     matrix A.  N >= 0.
   *> \endverbatim
   *>
   *> \param[in] A
   *> \verbatim
   *>          A is COMPLEX*16 array, dimension (LDA,N)
   *>     On entry, the N-by-N matrix A
   *> \endverbatim
   *>
   *> \param[in] LDA
   *> \verbatim
   *>          LDA is INTEGER
   *>     The leading dimension of the array A.  LDA >= max(1,N).
   *> \endverbatim
   *>
   *> \param[in] AF
   *> \verbatim
   *>          AF is COMPLEX*16 array, dimension (LDAF,N)
   *>     The factors L and U from the factorization
   *>     A = P*L*U as computed by ZGETRF.
   *> \endverbatim
   *>
   *> \param[in] LDAF
   *> \verbatim
   *>          LDAF is INTEGER
   *>     The leading dimension of the array AF.  LDAF >= max(1,N).
   *> \endverbatim
   *>
   *> \param[in] IPIV
   *> \verbatim
   *>          IPIV is INTEGER array, dimension (N)
   *>     The pivot indices from the factorization A = P*L*U
   *>     as computed by ZGETRF; row i of the matrix was interchanged
   *>     with row IPIV(i).
   *> \endverbatim
   *>
   *> \param[in] C
   *> \verbatim
   *>          C is DOUBLE PRECISION array, dimension (N)
   *>     The vector C in the formula op(A) * inv(diag(C)).
   *> \endverbatim
   *>
   *> \param[in] CAPPLY
   *> \verbatim
   *>          CAPPLY is LOGICAL
   *>     If .TRUE. then access the vector C in the formula above.
   *> \endverbatim
   *>
   *> \param[out] INFO
   *> \verbatim
   *>          INFO is INTEGER
   *>       = 0:  Successful exit.
   *>     i > 0:  The ith argument is invalid.
   *> \endverbatim
   *>
   *> \param[in] WORK
   *> \verbatim
   *>          WORK is COMPLEX*16 array, dimension (2*N).
   *>     Workspace.
   *> \endverbatim
   *>
   *> \param[in] RWORK
   *> \verbatim
   *>          RWORK is DOUBLE PRECISION array, dimension (N).
   *>     Workspace.
   *> \endverbatim
   *
   *  Authors:
   *  ========
   *
   *> \author Univ. of Tennessee 
   *> \author Univ. of California Berkeley 
   *> \author Univ. of Colorado Denver 
   *> \author NAG Ltd. 
   *
   *> \date November 2011
   *
   *> \ingroup complex16GEcomputational
   *
   *  =====================================================================
       DOUBLE PRECISION FUNCTION ZLA_GERCOND_C( TRANS, N, A, LDA, AF,         DOUBLE PRECISION FUNCTION ZLA_GERCOND_C( TRANS, N, A, LDA, AF, 
      $                                         LDAF, IPIV, C, CAPPLY,       $                                         LDAF, IPIV, C, CAPPLY,
      $                                         INFO, WORK, RWORK )       $                                         INFO, WORK, RWORK )
 *  *
 *     -- LAPACK routine (version 3.2.1)                                 --  *  -- LAPACK computational routine (version 3.4.0) --
 *     -- Contributed by James Demmel, Deaglan Halligan, Yozo Hida and --  *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *     -- Jason Riedy of Univ. of California Berkeley.                 --  *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
 *     -- April 2009                                                   --  *     November 2011
 *  
 *     -- LAPACK is a software package provided by Univ. of Tennessee, --  
 *     -- Univ. of California Berkeley and NAG Ltd.                    --  
 *  *
       IMPLICIT NONE  
 *     ..  
 *     .. Scalar Aguments ..  *     .. Scalar Aguments ..
       CHARACTER          TRANS        CHARACTER          TRANS
       LOGICAL            CAPPLY        LOGICAL            CAPPLY
Line 23 Line 159
       DOUBLE PRECISION   C( * ), RWORK( * )        DOUBLE PRECISION   C( * ), RWORK( * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *     ZLA_GERCOND_C computes the infinity norm condition number of  
 *     op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector.  
 *  
 *  Arguments  
 *  =========  
 *  
 *     TRANS   (input) CHARACTER*1  
 *     Specifies the form of the system of equations:  
 *       = 'N':  A * X = B     (No transpose)  
 *       = 'T':  A**T * X = B  (Transpose)  
 *       = 'C':  A**H * X = B  (Conjugate Transpose = Transpose)  
 *  
 *     N       (input) INTEGER  
 *     The number of linear equations, i.e., the order of the  
 *     matrix A.  N >= 0.  
 *  
 *     A       (input) COMPLEX*16 array, dimension (LDA,N)  
 *     On entry, the N-by-N matrix A  
 *  
 *     LDA     (input) INTEGER  
 *     The leading dimension of the array A.  LDA >= max(1,N).  
 *  
 *     AF      (input) COMPLEX*16 array, dimension (LDAF,N)  
 *     The factors L and U from the factorization  
 *     A = P*L*U as computed by ZGETRF.  
 *  
 *     LDAF    (input) INTEGER  
 *     The leading dimension of the array AF.  LDAF >= max(1,N).  
 *  
 *     IPIV    (input) INTEGER array, dimension (N)  
 *     The pivot indices from the factorization A = P*L*U  
 *     as computed by ZGETRF; row i of the matrix was interchanged  
 *     with row IPIV(i).  
 *  
 *     C       (input) DOUBLE PRECISION array, dimension (N)  
 *     The vector C in the formula op(A) * inv(diag(C)).  
 *  
 *     CAPPLY  (input) LOGICAL  
 *     If .TRUE. then access the vector C in the formula above.  
 *  
 *     INFO    (output) INTEGER  
 *       = 0:  Successful exit.  
 *     i > 0:  The ith argument is invalid.  
 *  
 *     WORK    (input) COMPLEX*16 array, dimension (2*N).  
 *     Workspace.  
 *  
 *     RWORK   (input) DOUBLE PRECISION array, dimension (N).  
 *     Workspace.  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Local Scalars ..  *     .. Local Scalars ..
Removed from v.1.5  
changed lines
  Added in v.1.6

CVSweb interface <joel.bertrand@systella.fr>