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

Diff for /rpl/lapack/lapack/zpptrf.f between versions 1.8 and 1.18

version 1.8, 2011/07/22 07:38:19 version 1.18, 2023/08/07 08:39:34
Line 1 Line 1
   *> \brief \b ZPPTRF
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at
   *            http://www.netlib.org/lapack/explore-html/
   *
   *> \htmlonly
   *> Download ZPPTRF + dependencies
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zpptrf.f">
   *> [TGZ]</a>
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zpptrf.f">
   *> [ZIP]</a>
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zpptrf.f">
   *> [TXT]</a>
   *> \endhtmlonly
   *
   *  Definition:
   *  ===========
   *
   *       SUBROUTINE ZPPTRF( UPLO, N, AP, INFO )
   *
   *       .. Scalar Arguments ..
   *       CHARACTER          UPLO
   *       INTEGER            INFO, N
   *       ..
   *       .. Array Arguments ..
   *       COMPLEX*16         AP( * )
   *       ..
   *
   *
   *> \par Purpose:
   *  =============
   *>
   *> \verbatim
   *>
   *> ZPPTRF computes the Cholesky factorization of a complex Hermitian
   *> positive definite matrix A stored in packed format.
   *>
   *> The factorization has the form
   *>    A = U**H * U,  if UPLO = 'U', or
   *>    A = L  * L**H,  if UPLO = 'L',
   *> where U is an upper triangular matrix and L is lower triangular.
   *> \endverbatim
   *
   *  Arguments:
   *  ==========
   *
   *> \param[in] UPLO
   *> \verbatim
   *>          UPLO is CHARACTER*1
   *>          = 'U':  Upper triangle of A is stored;
   *>          = 'L':  Lower triangle of A is stored.
   *> \endverbatim
   *>
   *> \param[in] N
   *> \verbatim
   *>          N is INTEGER
   *>          The order of the matrix A.  N >= 0.
   *> \endverbatim
   *>
   *> \param[in,out] AP
   *> \verbatim
   *>          AP is COMPLEX*16 array, dimension (N*(N+1)/2)
   *>          On entry, the upper or lower triangle of the Hermitian matrix
   *>          A, packed columnwise in a linear array.  The j-th column of A
   *>          is stored in the array AP as follows:
   *>          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
   *>          if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n.
   *>          See below for further details.
   *>
   *>          On exit, if INFO = 0, the triangular factor U or L from the
   *>          Cholesky factorization A = U**H*U or A = L*L**H, in the same
   *>          storage format as A.
   *> \endverbatim
   *>
   *> \param[out] INFO
   *> \verbatim
   *>          INFO is INTEGER
   *>          = 0:  successful exit
   *>          < 0:  if INFO = -i, the i-th argument had an illegal value
   *>          > 0:  if INFO = i, the leading minor of order i is not
   *>                positive definite, and the factorization could not be
   *>                completed.
   *> \endverbatim
   *
   *  Authors:
   *  ========
   *
   *> \author Univ. of Tennessee
   *> \author Univ. of California Berkeley
   *> \author Univ. of Colorado Denver
   *> \author NAG Ltd.
   *
   *> \ingroup complex16OTHERcomputational
   *
   *> \par Further Details:
   *  =====================
   *>
   *> \verbatim
   *>
   *>  The packed storage scheme is illustrated by the following example
   *>  when N = 4, UPLO = 'U':
   *>
   *>  Two-dimensional storage of the Hermitian matrix A:
   *>
   *>     a11 a12 a13 a14
   *>         a22 a23 a24
   *>             a33 a34     (aij = conjg(aji))
   *>                 a44
   *>
   *>  Packed storage of the upper triangle of A:
   *>
   *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
   *> \endverbatim
   *>
   *  =====================================================================
       SUBROUTINE ZPPTRF( UPLO, N, AP, INFO )        SUBROUTINE ZPPTRF( UPLO, N, AP, INFO )
 *  *
 *  -- LAPACK routine (version 3.3.1) --  *  -- LAPACK computational routine --
 *  -- 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..--
 *  -- April 2011                                                      --  
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       CHARACTER          UPLO        CHARACTER          UPLO
Line 13 Line 129
       COMPLEX*16         AP( * )        COMPLEX*16         AP( * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *  ZPPTRF computes the Cholesky factorization of a complex Hermitian  
 *  positive definite matrix A stored in packed format.  
 *  
 *  The factorization has the form  
 *     A = U**H * U,  if UPLO = 'U', or  
 *     A = L  * L**H,  if UPLO = 'L',  
 *  where U is an upper triangular matrix and L is lower triangular.  
 *  
 *  Arguments  
 *  =========  
 *  
 *  UPLO    (input) CHARACTER*1  
 *          = 'U':  Upper triangle of A is stored;  
 *          = 'L':  Lower triangle of A is stored.  
 *  
 *  N       (input) INTEGER  
 *          The order of the matrix A.  N >= 0.  
 *  
 *  AP      (input/output) COMPLEX*16 array, dimension (N*(N+1)/2)  
 *          On entry, the upper or lower triangle of the Hermitian matrix  
 *          A, packed columnwise in a linear array.  The j-th column of A  
 *          is stored in the array AP as follows:  
 *          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;  
 *          if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n.  
 *          See below for further details.  
 *  
 *          On exit, if INFO = 0, the triangular factor U or L from the  
 *          Cholesky factorization A = U**H*U or A = L*L**H, in the same  
 *          storage format as A.  
 *  
 *  INFO    (output) INTEGER  
 *          = 0:  successful exit  
 *          < 0:  if INFO = -i, the i-th argument had an illegal value  
 *          > 0:  if INFO = i, the leading minor of order i is not  
 *                positive definite, and the factorization could not be  
 *                completed.  
 *  
 *  Further Details  
 *  ===============  
 *  
 *  The packed storage scheme is illustrated by the following example  
 *  when N = 4, UPLO = 'U':  
 *  
 *  Two-dimensional storage of the Hermitian matrix A:  
 *  
 *     a11 a12 a13 a14  
 *         a22 a23 a24  
 *             a33 a34     (aij = conjg(aji))  
 *                 a44  
 *  
 *  Packed storage of the upper triangle of A:  
 *  
 *  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Parameters ..  *     .. Parameters ..
Line 130 Line 189
 *  *
 *           Compute U(J,J) and test for non-positive-definiteness.  *           Compute U(J,J) and test for non-positive-definiteness.
 *  *
             AJJ = DBLE( AP( JJ ) ) - ZDOTC( J-1, AP( JC ), 1, AP( JC ),              AJJ = DBLE( AP( JJ ) ) - DBLE( ZDOTC( J-1,
      $            1 )       $            AP( JC ), 1, AP( JC ), 1 ) )
             IF( AJJ.LE.ZERO ) THEN              IF( AJJ.LE.ZERO ) THEN
                AP( JJ ) = AJJ                 AP( JJ ) = AJJ
                GO TO 30                 GO TO 30
Removed from v.1.8  
changed lines
  Added in v.1.18

CVSweb interface <joel.bertrand@systella.fr>