hpev#

Functions

void chpev(
    const char*          jobz,
    const char*          uplo,
    const INT            n,
          c64*  restrict AP,
          f32*  restrict W,
          c64*  restrict Z,
    const INT            ldz,
          c64*  restrict work,
          f32*  restrict rwork,
          INT*           info
);
void chpev(const char *jobz, const char *uplo, const INT n, c64 *restrict AP, f32 *restrict W, c64 *restrict Z, const INT ldz, c64 *restrict work, f32 *restrict rwork, INT *info)#

CHPEV computes all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage.

Parameters

in
jobz

= ‘N’: Compute eigenvalues only; = ‘V’: Compute eigenvalues and eigenvectors.

in
uplo

= ‘U’: Upper triangle of A is stored; = ‘L’: Lower triangle of A is stored.

in
n

The order of the matrix A. n >= 0.

inout
AP

Complex 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 0<=i<=j; if uplo = ‘L’, AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<n. On exit, AP is overwritten by values generated during the reduction to tridiagonal form.

out
W

Single precision array, dimension (n). If info = 0, the eigenvalues in ascending order.

out
Z

Complex array, dimension (ldz, n). If jobz = ‘V’, then if info = 0, Z contains the orthonormal eigenvectors of the matrix A, with the i-th column of Z holding the eigenvector associated with W(i). If jobz = ‘N’, then Z is not referenced.

in
ldz

The leading dimension of the array Z. ldz >= 1, and if jobz = ‘V’, ldz >= max(1, n).

out
work

Complex array, dimension (max(1, 2*n-1)).

out
rwork

Single precision array, dimension (max(1, 3*n-2)).

out
info

= 0: successful exit. < 0: if info = -i, the i-th argument had an illegal value. > 0: if info = i, the algorithm failed to converge; i off-diagonal elements of an intermediate tridiagonal form did not converge to zero.

Functions

void zhpev(
    const char*          jobz,
    const char*          uplo,
    const INT            n,
          c128* restrict AP,
          f64*  restrict W,
          c128* restrict Z,
    const INT            ldz,
          c128* restrict work,
          f64*  restrict rwork,
          INT*           info
);
void zhpev(const char *jobz, const char *uplo, const INT n, c128 *restrict AP, f64 *restrict W, c128 *restrict Z, const INT ldz, c128 *restrict work, f64 *restrict rwork, INT *info)#

ZHPEV computes all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage.

Parameters

in
jobz

= ‘N’: Compute eigenvalues only; = ‘V’: Compute eigenvalues and eigenvectors.

in
uplo

= ‘U’: Upper triangle of A is stored; = ‘L’: Lower triangle of A is stored.

in
n

The order of the matrix A. n >= 0.

inout
AP

Complex 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 0<=i<=j; if uplo = ‘L’, AP(i + (j-1)*(2*n-j)/2) = A(i,j) for j<=i<n. On exit, AP is overwritten by values generated during the reduction to tridiagonal form.

out
W

Double precision array, dimension (n). If info = 0, the eigenvalues in ascending order.

out
Z

Complex array, dimension (ldz, n). If jobz = ‘V’, then if info = 0, Z contains the orthonormal eigenvectors of the matrix A, with the i-th column of Z holding the eigenvector associated with W(i). If jobz = ‘N’, then Z is not referenced.

in
ldz

The leading dimension of the array Z. ldz >= 1, and if jobz = ‘V’, ldz >= max(1, n).

out
work

Complex array, dimension (max(1, 2*n-1)).

out
rwork

Double precision array, dimension (max(1, 3*n-2)).

out
info

= 0: successful exit. < 0: if info = -i, the i-th argument had an illegal value. > 0: if info = i, the algorithm failed to converge; i off-diagonal elements of an intermediate tridiagonal form did not converge to zero.

On this page

This Page