Diff for /rpl/lapack/lapack/zpstrf.f between versions 1.10 and 1.11

version 1.10, 2014/01/27 09:28:41 version 1.11, 2015/11/26 11:44:26
Line 1 Line 1
 *> \brief \b ZPSTRF  *> \brief \b ZPSTRF computes the Cholesky factorization with complete pivoting of a complex Hermitian positive semidefinite matrix.
 *  *
 *  =========== DOCUMENTATION ===========  *  =========== DOCUMENTATION ===========
 *  *
Line 122 Line 122
 *>          < 0: If INFO = -K, the K-th argument had an illegal value,  *>          < 0: If INFO = -K, the K-th argument had an illegal value,
 *>          = 0: algorithm completed successfully, and  *>          = 0: algorithm completed successfully, and
 *>          > 0: the matrix A is either rank deficient with computed rank  *>          > 0: the matrix A is either rank deficient with computed rank
 *>               as returned in RANK, or is indefinite.  See Section 7 of  *>               as returned in RANK, or is not positive semidefinite. See
 *>               LAPACK Working Note #161 for further information.  *>               Section 7 of LAPACK Working Note #161 for further
   *>               information.
 *> \endverbatim  *> \endverbatim
 *  *
 *  Authors:  *  Authors:
Line 134 Line 135
 *> \author Univ. of Colorado Denver   *> \author Univ. of Colorado Denver 
 *> \author NAG Ltd.   *> \author NAG Ltd. 
 *  *
 *> \date November 2011  *> \date November 2015
 *  *
 *> \ingroup complex16OTHERcomputational  *> \ingroup complex16OTHERcomputational
 *  *
 *  =====================================================================  *  =====================================================================
       SUBROUTINE ZPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )        SUBROUTINE ZPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
 *  *
 *  -- LAPACK computational routine (version 3.4.0) --  *  -- LAPACK computational routine (version 3.6.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 2011  *     November 2015
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       DOUBLE PRECISION   TOL        DOUBLE PRECISION   TOL
Line 233 Line 234
   110    CONTINUE    110    CONTINUE
          PVT = MAXLOC( WORK( 1:N ), 1 )           PVT = MAXLOC( WORK( 1:N ), 1 )
          AJJ = DBLE( A( PVT, PVT ) )           AJJ = DBLE( A( PVT, PVT ) )
          IF( AJJ.EQ.ZERO.OR.DISNAN( AJJ ) ) THEN           IF( AJJ.LE.ZERO.OR.DISNAN( AJJ ) ) THEN
             RANK = 0              RANK = 0
             INFO = 1              INFO = 1
             GO TO 230              GO TO 230

Removed from v.1.10  
changed lines
  Added in v.1.11


CVSweb interface <joel.bertrand@systella.fr>