--- rpl/lapack/lapack/zpptrf.f 2010/08/07 13:22:43 1.5
+++ rpl/lapack/lapack/zpptrf.f 2023/08/07 08:39:34 1.18
@@ -1,9 +1,125 @@
+*> \brief \b ZPPTRF
+*
+* =========== DOCUMENTATION ===========
+*
+* Online html documentation available at
+* http://www.netlib.org/lapack/explore-html/
+*
+*> \htmlonly
+*> Download ZPPTRF + dependencies
+*>
+*> [TGZ]
+*>
+*> [ZIP]
+*>
+*> [TXT]
+*> \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 )
*
-* -- LAPACK routine (version 3.2) --
+* -- LAPACK computational routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-* November 2006
*
* .. Scalar Arguments ..
CHARACTER UPLO
@@ -13,63 +129,6 @@
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 ..
@@ -115,7 +174,7 @@
*
IF( UPPER ) THEN
*
-* Compute the Cholesky factorization A = U'*U.
+* Compute the Cholesky factorization A = U**H * U.
*
JJ = 0
DO 10 J = 1, N
@@ -130,8 +189,8 @@
*
* Compute U(J,J) and test for non-positive-definiteness.
*
- AJJ = DBLE( AP( JJ ) ) - ZDOTC( J-1, AP( JC ), 1, AP( JC ),
- $ 1 )
+ AJJ = DBLE( AP( JJ ) ) - DBLE( ZDOTC( J-1,
+ $ AP( JC ), 1, AP( JC ), 1 ) )
IF( AJJ.LE.ZERO ) THEN
AP( JJ ) = AJJ
GO TO 30
@@ -140,7 +199,7 @@
10 CONTINUE
ELSE
*
-* Compute the Cholesky factorization A = L*L'.
+* Compute the Cholesky factorization A = L * L**H.
*
JJ = 1
DO 20 J = 1, N