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

Diff for /rpl/lapack/lapack/zgetc2.f between versions 1.7 and 1.8

version 1.7, 2010/12/21 13:53:44 version 1.8, 2011/11/21 20:43:10
Line 1 Line 1
   *> \brief \b ZGETC2
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at 
   *            http://www.netlib.org/lapack/explore-html/ 
   *
   *> \htmlonly
   *> Download ZGETC2 + dependencies 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgetc2.f"> 
   *> [TGZ]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgetc2.f"> 
   *> [ZIP]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgetc2.f"> 
   *> [TXT]</a>
   *> \endhtmlonly 
   *
   *  Definition:
   *  ===========
   *
   *       SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO )
   * 
   *       .. Scalar Arguments ..
   *       INTEGER            INFO, LDA, N
   *       ..
   *       .. Array Arguments ..
   *       INTEGER            IPIV( * ), JPIV( * )
   *       COMPLEX*16         A( LDA, * )
   *       ..
   *  
   *
   *> \par Purpose:
   *  =============
   *>
   *> \verbatim
   *>
   *> ZGETC2 computes an LU factorization, using complete pivoting, of the
   *> n-by-n matrix A. The factorization has the form A = P * L * U * Q,
   *> where P and Q are permutation matrices, L is lower triangular with
   *> unit diagonal elements and U is upper triangular.
   *>
   *> This is a level 1 BLAS version of the algorithm.
   *> \endverbatim
   *
   *  Arguments:
   *  ==========
   *
   *> \param[in] N
   *> \verbatim
   *>          N is INTEGER
   *>          The order of the matrix A. N >= 0.
   *> \endverbatim
   *>
   *> \param[in,out] A
   *> \verbatim
   *>          A is COMPLEX*16 array, dimension (LDA, N)
   *>          On entry, the n-by-n matrix to be factored.
   *>          On exit, the factors L and U from the factorization
   *>          A = P*L*U*Q; the unit diagonal elements of L are not stored.
   *>          If U(k, k) appears to be less than SMIN, U(k, k) is given the
   *>          value of SMIN, giving a nonsingular perturbed system.
   *> \endverbatim
   *>
   *> \param[in] LDA
   *> \verbatim
   *>          LDA is INTEGER
   *>          The leading dimension of the array A.  LDA >= max(1, N).
   *> \endverbatim
   *>
   *> \param[out] 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[out] 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
   *>
   *> \param[out] INFO
   *> \verbatim
   *>          INFO is INTEGER
   *>           = 0: successful exit
   *>           > 0: if INFO = k, U(k, k) is likely to produce overflow if
   *>                one tries to solve for x in Ax = b. So U is perturbed
   *>                to avoid the overflow.
   *> \endverbatim
   *
   *  Authors:
   *  ========
   *
   *> \author Univ. of Tennessee 
   *> \author Univ. of California Berkeley 
   *> \author Univ. of Colorado Denver 
   *> \author NAG Ltd. 
   *
   *> \date November 2011
   *
   *> \ingroup complex16GEauxiliary
   *
   *> \par Contributors:
   *  ==================
   *>
   *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
   *>     Umea University, S-901 87 Umea, Sweden.
   *
   *  =====================================================================
       SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO )        SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO )
 *  *
 *  -- LAPACK auxiliary routine (version 3.2) --  *  -- LAPACK auxiliary routine (version 3.4.0) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --  *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--  *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
 *     November 2006  *     November 2011
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       INTEGER            INFO, LDA, N        INTEGER            INFO, LDA, N
Line 13 Line 124
       COMPLEX*16         A( LDA, * )        COMPLEX*16         A( LDA, * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *  ZGETC2 computes an LU factorization, using complete pivoting, of the  
 *  n-by-n matrix A. The factorization has the form A = P * L * U * Q,  
 *  where P and Q are permutation matrices, L is lower triangular with  
 *  unit diagonal elements and U is upper triangular.  
 *  
 *  This is a level 1 BLAS version of the algorithm.  
 *  
 *  Arguments  
 *  =========  
 *  
 *  N       (input) INTEGER  
 *          The order of the matrix A. N >= 0.  
 *  
 *  A       (input/output) COMPLEX*16 array, dimension (LDA, N)  
 *          On entry, the n-by-n matrix to be factored.  
 *          On exit, the factors L and U from the factorization  
 *          A = P*L*U*Q; the unit diagonal elements of L are not stored.  
 *          If U(k, k) appears to be less than SMIN, U(k, k) is given the  
 *          value of SMIN, giving a nonsingular perturbed system.  
 *  
 *  LDA     (input) INTEGER  
 *          The leading dimension of the array A.  LDA >= max(1, N).  
 *  
 *  IPIV    (output) INTEGER array, dimension (N).  
 *          The pivot indices; for 1 <= i <= N, row i of the  
 *          matrix has been interchanged with row IPIV(i).  
 *  
 *  JPIV    (output) INTEGER array, dimension (N).  
 *          The pivot indices; for 1 <= j <= N, column j of the  
 *          matrix has been interchanged with column JPIV(j).  
 *  
 *  INFO    (output) INTEGER  
 *           = 0: successful exit  
 *           > 0: if INFO = k, U(k, k) is likely to produce overflow if  
 *                one tries to solve for x in Ax = b. So U is perturbed  
 *                to avoid the overflow.  
 *  
 *  Further Details  
 *  ===============  
 *  
 *  Based on contributions by  
 *     Bo Kagstrom and Peter Poromaa, Department of Computing Science,  
 *     Umea University, S-901 87 Umea, Sweden.  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Parameters ..  *     .. Parameters ..
Removed from v.1.7  
changed lines
  Added in v.1.8

CVSweb interface <joel.bertrand@systella.fr>