rpl/lapack/lapack/dgetf2.f - diff

Return to dgetf2.f CVS log

Up to [local] / rpl / lapack / lapack

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

-version 1.7, 2010/12/21 13:53:26
+version 1.8, 2011/11/21 20:42:52
  Line 1
+ *> \brief \b DGETF2
+ *
+ *  =========== DOCUMENTATION ===========
+ *
+ * Online html documentation available at
+ *            http://www.netlib.org/lapack/explore-html/
+ *
+ *> \htmlonly
+ *> Download DGETF2 + dependencies
+ *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dgetf2.f">
+ *> [TGZ]</a>
+ *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dgetf2.f">
+ *> [ZIP]</a>
+ *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dgetf2.f">
+ *> [TXT]</a>
+ *> \endhtmlonly
+ *
+ *  Definition:
+ *  ===========
+ *
+ *       SUBROUTINE DGETF2( M, N, A, LDA, IPIV, INFO )
+ *
+ *       .. Scalar Arguments ..
+ *       INTEGER            INFO, LDA, M, N
+ *       ..
+ *       .. Array Arguments ..
+ *       INTEGER            IPIV( * )
+ *       DOUBLE PRECISION   A( LDA, * )
+ *       ..
+ *
+ *
+ *> \par Purpose:
+ *  =============
+ *>
+ *> \verbatim
+ *>
+ *> DGETF2 computes an LU factorization of a general m-by-n matrix A
+ *> using partial pivoting with row interchanges.
+ *>
+ *> The factorization has the form
+ *>    A = P * L * U
+ *> where P is a permutation matrix, L is lower triangular with unit
+ *> diagonal elements (lower trapezoidal if m > n), and U is upper
+ *> triangular (upper trapezoidal if m < n).
+ *>
+ *> This is the right-looking Level 2 BLAS version of the algorithm.
+ *> \endverbatim
+ *
+ *  Arguments:
+ *  ==========
+ *
+ *> \param[in] M
+ *> \verbatim
+ *>          M is INTEGER
+ *>          The number of rows of the matrix A.  M >= 0.
+ *> \endverbatim
+ *>
+ *> \param[in] N
+ *> \verbatim
+ *>          N is INTEGER
+ *>          The number of columns of the matrix A.  N >= 0.
+ *> \endverbatim
+ *>
+ *> \param[in,out] A
+ *> \verbatim
+ *>          A is DOUBLE PRECISION array, dimension (LDA,N)
+ *>          On entry, the m by n matrix to be factored.
+ *>          On exit, the factors L and U from the factorization
+ *>          A = P*L*U; the unit diagonal elements of L are not stored.
+ *> \endverbatim
+ *>
+ *> \param[in] LDA
+ *> \verbatim
+ *>          LDA is INTEGER
+ *>          The leading dimension of the array A.  LDA >= max(1,M).
+ *> \endverbatim
+ *>
+ *> \param[out] IPIV
+ *> \verbatim
+ *>          IPIV is INTEGER array, dimension (min(M,N))
+ *>          The pivot indices; for 1 <= i <= min(M,N), row i of the
+ *>          matrix was interchanged with row IPIV(i).
+ *> \endverbatim
+ *>
+ *> \param[out] INFO
+ *> \verbatim
+ *>          INFO is INTEGER
+ *>          = 0: successful exit
+ *>          < 0: if INFO = -k, the k-th argument had an illegal value
+ *>          > 0: if INFO = k, U(k,k) is exactly zero. The factorization
+ *>               has been completed, but the factor U is exactly
+ *>               singular, and division by zero will occur if it is used
+ *>               to solve a system of equations.
+ *> \endverbatim
+ *
+ *  Authors:
+ *  ========
+ *
+ *> \author Univ. of Tennessee
+ *> \author Univ. of California Berkeley
+ *> \author Univ. of Colorado Denver
+ *> \author NAG Ltd.
+ *
+ *> \date November 2011
+ *
+ *> \ingroup doubleGEcomputational
+ *
+ *  =====================================================================
        SUBROUTINE DGETF2( M, N, A, LDA, IPIV, INFO )
  *
- *  -- LAPACK routine (version 3.2) --
+ *  -- LAPACK computational 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 2006
+ *     November 2011
  *
  *     .. Scalar Arguments ..
        INTEGER            INFO, LDA, M, N
- Line 13
+ Line 121
        DOUBLE PRECISION   A( LDA, * )
  *     ..
  *
- *  Purpose
- *  =======
- *
- *  DGETF2 computes an LU factorization of a general m-by-n matrix A
- *  using partial pivoting with row interchanges.
- *
- *  The factorization has the form
- *     A = P * L * U
- *  where P is a permutation matrix, L is lower triangular with unit
- *  diagonal elements (lower trapezoidal if m > n), and U is upper
- *  triangular (upper trapezoidal if m < n).
- *
- *  This is the right-looking Level 2 BLAS version of the algorithm.
- *
- *  Arguments
- *  =========
- *
- *  M       (input) INTEGER
- *          The number of rows of the matrix A.  M >= 0.
- *
- *  N       (input) INTEGER
- *          The number of columns of the matrix A.  N >= 0.
- *
- *  A       (input/output) DOUBLE PRECISION array, dimension (LDA,N)
- *          On entry, the m by n matrix to be factored.
- *          On exit, the factors L and U from the factorization
- *          A = P*L*U; the unit diagonal elements of L are not stored.
- *
- *  LDA     (input) INTEGER
- *          The leading dimension of the array A.  LDA >= max(1,M).
- *
- *  IPIV    (output) INTEGER array, dimension (min(M,N))
- *          The pivot indices; for 1 <= i <= min(M,N), row i of the
- *          matrix was interchanged with row IPIV(i).
- *
- *  INFO    (output) INTEGER
- *          = 0: successful exit
- *          < 0: if INFO = -k, the k-th argument had an illegal value
- *          > 0: if INFO = k, U(k,k) is exactly zero. The factorization
- *               has been completed, but the factor U is exactly
- *               singular, and division by zero will occur if it is used
- *               to solve a system of equations.
- *
  *  =====================================================================
  *
  *     .. Parameters ..

CVSweb interface <joel.bertrand@systella.fr>

Removed from v.1.7
changed lines
	Added in v.1.8