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