--- rpl/lapack/lapack/zhpgst.f 2010/04/21 13:45:32 1.2
+++ rpl/lapack/lapack/zhpgst.f 2016/08/27 15:34:52 1.14
@@ -1,9 +1,122 @@
+*> \brief \b ZHPGST
+*
+* =========== DOCUMENTATION ===========
+*
+* Online html documentation available at
+* http://www.netlib.org/lapack/explore-html/
+*
+*> \htmlonly
+*> Download ZHPGST + dependencies
+*>
+*> [TGZ]
+*>
+*> [ZIP]
+*>
+*> [TXT]
+*> \endhtmlonly
+*
+* Definition:
+* ===========
+*
+* SUBROUTINE ZHPGST( ITYPE, UPLO, N, AP, BP, INFO )
+*
+* .. Scalar Arguments ..
+* CHARACTER UPLO
+* INTEGER INFO, ITYPE, N
+* ..
+* .. Array Arguments ..
+* COMPLEX*16 AP( * ), BP( * )
+* ..
+*
+*
+*> \par Purpose:
+* =============
+*>
+*> \verbatim
+*>
+*> ZHPGST reduces a complex Hermitian-definite generalized
+*> eigenproblem to standard form, using packed storage.
+*>
+*> If ITYPE = 1, the problem is A*x = lambda*B*x,
+*> and A is overwritten by inv(U**H)*A*inv(U) or inv(L)*A*inv(L**H)
+*>
+*> If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or
+*> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L.
+*>
+*> B must have been previously factorized as U**H*U or L*L**H by ZPPTRF.
+*> \endverbatim
+*
+* Arguments:
+* ==========
+*
+*> \param[in] ITYPE
+*> \verbatim
+*> ITYPE is INTEGER
+*> = 1: compute inv(U**H)*A*inv(U) or inv(L)*A*inv(L**H);
+*> = 2 or 3: compute U*A*U**H or L**H*A*L.
+*> \endverbatim
+*>
+*> \param[in] UPLO
+*> \verbatim
+*> UPLO is CHARACTER*1
+*> = 'U': Upper triangle of A is stored and B is factored as
+*> U**H*U;
+*> = 'L': Lower triangle of A is stored and B is factored as
+*> L*L**H.
+*> \endverbatim
+*>
+*> \param[in] N
+*> \verbatim
+*> N is INTEGER
+*> The order of the matrices A and B. 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.
+*>
+*> On exit, if INFO = 0, the transformed matrix, stored in the
+*> same format as A.
+*> \endverbatim
+*>
+*> \param[in] BP
+*> \verbatim
+*> BP is COMPLEX*16 array, dimension (N*(N+1)/2)
+*> The triangular factor from the Cholesky factorization of B,
+*> stored in the same format as A, as returned by ZPPTRF.
+*> \endverbatim
+*>
+*> \param[out] INFO
+*> \verbatim
+*> INFO is INTEGER
+*> = 0: successful exit
+*> < 0: if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+* Authors:
+* ========
+*
+*> \author Univ. of Tennessee
+*> \author Univ. of California Berkeley
+*> \author Univ. of Colorado Denver
+*> \author NAG Ltd.
+*
+*> \date November 2011
+*
+*> \ingroup complex16OTHERcomputational
+*
+* =====================================================================
SUBROUTINE ZHPGST( ITYPE, UPLO, N, AP, BP, 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 ..
CHARACTER UPLO
@@ -13,54 +126,6 @@
COMPLEX*16 AP( * ), BP( * )
* ..
*
-* Purpose
-* =======
-*
-* ZHPGST reduces a complex Hermitian-definite generalized
-* eigenproblem to standard form, using packed storage.
-*
-* If ITYPE = 1, the problem is A*x = lambda*B*x,
-* and A is overwritten by inv(U**H)*A*inv(U) or inv(L)*A*inv(L**H)
-*
-* If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or
-* B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L.
-*
-* B must have been previously factorized as U**H*U or L*L**H by ZPPTRF.
-*
-* Arguments
-* =========
-*
-* ITYPE (input) INTEGER
-* = 1: compute inv(U**H)*A*inv(U) or inv(L)*A*inv(L**H);
-* = 2 or 3: compute U*A*U**H or L**H*A*L.
-*
-* UPLO (input) CHARACTER*1
-* = 'U': Upper triangle of A is stored and B is factored as
-* U**H*U;
-* = 'L': Lower triangle of A is stored and B is factored as
-* L*L**H.
-*
-* N (input) INTEGER
-* The order of the matrices A and B. 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.
-*
-* On exit, if INFO = 0, the transformed matrix, stored in the
-* same format as A.
-*
-* BP (input) COMPLEX*16 array, dimension (N*(N+1)/2)
-* The triangular factor from the Cholesky factorization of B,
-* stored in the same format as A, as returned by ZPPTRF.
-*
-* INFO (output) INTEGER
-* = 0: successful exit
-* < 0: if INFO = -i, the i-th argument had an illegal value
-*
* =====================================================================
*
* .. Parameters ..
@@ -108,7 +173,7 @@
IF( ITYPE.EQ.1 ) THEN
IF( UPPER ) THEN
*
-* Compute inv(U')*A*inv(U)
+* Compute inv(U**H)*A*inv(U)
*
* J1 and JJ are the indices of A(1,j) and A(j,j)
*
@@ -131,7 +196,7 @@
10 CONTINUE
ELSE
*
-* Compute inv(L)*A*inv(L')
+* Compute inv(L)*A*inv(L**H)
*
* KK and K1K1 are the indices of A(k,k) and A(k+1,k+1)
*
@@ -161,7 +226,7 @@
ELSE
IF( UPPER ) THEN
*
-* Compute U*A*U'
+* Compute U*A*U**H
*
* K1 and KK are the indices of A(1,k) and A(k,k)
*
@@ -186,7 +251,7 @@
30 CONTINUE
ELSE
*
-* Compute L'*A*L
+* Compute L**H *A*L
*
* JJ and J1J1 are the indices of A(j,j) and A(j+1,j+1)
*