chpgv
chpgv - compute all the eigenvalues and, optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
SUBROUTINE CHPGV( ITYPE, JOBZ, UPLO, N, A, B, W, Z, LDZ, WORK,
* WORK2, INFO)
CHARACTER * 1 JOBZ, UPLO
COMPLEX A(*), B(*), Z(LDZ,*), WORK(*)
INTEGER ITYPE, N, LDZ, INFO
REAL W(*), WORK2(*)
SUBROUTINE CHPGV_64( ITYPE, JOBZ, UPLO, N, A, B, W, Z, LDZ, WORK,
* WORK2, INFO)
CHARACTER * 1 JOBZ, UPLO
COMPLEX A(*), B(*), Z(LDZ,*), WORK(*)
INTEGER*8 ITYPE, N, LDZ, INFO
REAL W(*), WORK2(*)
SUBROUTINE HPGV( ITYPE, JOBZ, UPLO, [N], A, B, W, Z, [LDZ], [WORK],
* [WORK2], [INFO])
CHARACTER(LEN=1) :: JOBZ, UPLO
COMPLEX, DIMENSION(:) :: A, B, WORK
COMPLEX, DIMENSION(:,:) :: Z
INTEGER :: ITYPE, N, LDZ, INFO
REAL, DIMENSION(:) :: W, WORK2
SUBROUTINE HPGV_64( ITYPE, JOBZ, UPLO, [N], A, B, W, Z, [LDZ], [WORK],
* [WORK2], [INFO])
CHARACTER(LEN=1) :: JOBZ, UPLO
COMPLEX, DIMENSION(:) :: A, B, WORK
COMPLEX, DIMENSION(:,:) :: Z
INTEGER(8) :: ITYPE, N, LDZ, INFO
REAL, DIMENSION(:) :: W, WORK2
#include <sunperf.h>
void chpgv(int itype, char jobz, char uplo, int n, complex *a, complex *b, float *w, complex *z, int ldz, int *info);
void chpgv_64(long itype, char jobz, char uplo, long n, complex *a, complex *b, float *w, complex *z, long ldz, long *info);
chpgv computes all the eigenvalues and, optionally, the eigenvectors
of a complex generalized Hermitian-definite eigenproblem, of the form
A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x.
Here A and B are assumed to be Hermitian, stored in packed format,
and B is also positive definite.
-
* ITYPE (input)
-
Specifies the problem type to be solved:
-
* JOBZ (input)
-
-
* UPLO (input)
-
-
* N (input)
-
The order of the matrices A and B. N >= 0.
-
* A (input/output)
-
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 A as follows:
if UPLO = 'U', A(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
if UPLO = 'L', A(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<=n.
On exit, the contents of A are destroyed.
-
* B (input/output)
-
On entry, the upper or lower triangle of the Hermitian matrix
B, packed columnwise in a linear array. The j-th column of B
is stored in the array B as follows:
if UPLO = 'U', B(i + (j-1)*j/2) = B(i,j) for 1<=i<=j;
if UPLO = 'L', B(i + (j-1)*(2*n-j)/2) = B(i,j) for j<=i<=n.
On exit, the triangular factor U or L from the Cholesky
factorization B = U**H*U or B = L*L**H, in the same storage
format as B.
-
* W (output)
-
If INFO = 0, the eigenvalues in ascending order.
-
* Z (input)
-
If JOBZ = 'V', then if INFO = 0, Z contains the matrix Z of
eigenvectors. The eigenvectors are normalized as follows:
if ITYPE = 1 or 2, Z**H*B*Z = I;
if ITYPE = 3, Z**H*inv(B)*Z = I.
If JOBZ = 'N', then Z is not referenced.
-
* LDZ (input)
-
The leading dimension of the array Z. LDZ >= 1, and if
JOBZ = 'V', LDZ >= max(1,N).
-
* WORK (workspace)
-
dimension(MAX(1,2*N-1))
-
* WORK2 (workspace)
-
-
* INFO (output)
-