NAG FL Interface
f08gqf (zhpevd)

1 Purpose

f08gqf computes all the eigenvalues and, optionally, all the eigenvectors of a complex Hermitian matrix held in packed storage. If the eigenvectors are requested, then it uses a divide-and-conquer algorithm to compute eigenvalues and eigenvectors. However, if only eigenvalues are required, then it uses the Pal–Walker–Kahan variant of the QL or QR algorithm.

2 Specification

Fortran Interface
Subroutine f08gqf ( job, uplo, n, ap, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)
Integer, Intent (In) :: n, ldz, lwork, lrwork, liwork
Integer, Intent (Out) :: iwork(max(1,liwork)), info
Real (Kind=nag_wp), Intent (Inout) :: w(*)
Real (Kind=nag_wp), Intent (Out) :: rwork(max(1,lrwork))
Complex (Kind=nag_wp), Intent (Inout) :: ap(*), z(ldz,*)
Complex (Kind=nag_wp), Intent (Out) :: work(max(1,lwork))
Character (1), Intent (In) :: job, uplo
C Header Interface
#include <nag.h>
void  f08gqf_ (const char *job, const char *uplo, const Integer *n, Complex ap[], double w[], Complex z[], const Integer *ldz, Complex work[], const Integer *lwork, double rwork[], const Integer *lrwork, Integer iwork[], const Integer *liwork, Integer *info, const Charlen length_job, const Charlen length_uplo)
The routine may be called by the names f08gqf, nagf_lapackeig_zhpevd or its LAPACK name zhpevd.

3 Description

f08gqf computes all the eigenvalues and, optionally, all the eigenvectors of a complex Hermitian matrix A (held in packed storage). In other words, it can compute the spectral factorization of A as
A=ZΛZH,  
where Λ is a real diagonal matrix whose diagonal elements are the eigenvalues λi, and Z is the (complex) unitary matrix whose columns are the eigenvectors zi. Thus
Azi=λizi,  i=1,2,,n.  

4 References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia https://www.netlib.org/lapack/lug
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5 Arguments

1: job Character(1) Input
On entry: indicates whether eigenvectors are computed.
job='N'
Only eigenvalues are computed.
job='V'
Eigenvalues and eigenvectors are computed.
Constraint: job='N' or 'V'.
2: uplo Character(1) Input
On entry: indicates whether the upper or lower triangular part of A is stored.
uplo='U'
The upper triangular part of A is stored.
uplo='L'
The lower triangular part of A is stored.
Constraint: uplo='U' or 'L'.
3: n Integer Input
On entry: n, the order of the matrix A.
Constraint: n0.
4: ap* Complex (Kind=nag_wp) array Input/Output
Note: the dimension of the array ap must be at least max1,n×n+1/2.
On entry: the upper or lower triangle of the n by n Hermitian matrix A, packed by columns.
More precisely,
  • if uplo='U', the upper triangle of A must be stored with element Aij in api+jj-1/2 for ij;
  • if uplo='L', the lower triangle of A must be stored with element Aij in api+2n-jj-1/2 for ij.
On exit: ap is overwritten by the values generated during the reduction to tridiagonal form. The elements of the diagonal and the off-diagonal of the tridiagonal matrix overwrite the corresponding elements of A.
5: w* Real (Kind=nag_wp) array Output
Note: the dimension of the array w must be at least max1,n.
On exit: the eigenvalues of the matrix A in ascending order.
6: zldz* Complex (Kind=nag_wp) array Output
Note: the second dimension of the array z must be at least max1,n if job='V' and at least 1 if job='N'.
On exit: if job='V', z is overwritten by the unitary matrix Z which contains the eigenvectors of A.
If job='N', z is not referenced.
7: ldz Integer Input
On entry: the first dimension of the array z as declared in the (sub)program from which f08gqf is called.
Constraints:
  • if job='V', ldz max1,n ;
  • if job='N', ldz1.
8: workmax1,lwork Complex (Kind=nag_wp) array Workspace
On exit: if info=0, work1 contains the required minimal size of lwork.
9: lwork Integer Input
On entry: the dimension of the array work as declared in the (sub)program from which f08gqf is called.
If lwork=-1, a workspace query is assumed; the routine only calculates the minimum dimension of the work array, returns this value as the first entry of the work array, and no error message related to lwork is issued.
Constraints:
  • if n1, lwork1 or lwork=-1;
  • if job='N' and n>1, lworkn or lwork=-1;
  • if job='V' and n>1, lwork2×n or lwork=-1.
10: rworkmax1,lrwork Real (Kind=nag_wp) array Workspace
On exit: if info=0, rwork1 contains the required minimal size of lrwork.
11: lrwork Integer Input
On entry: the dimension of the array rwork as declared in the (sub)program from which f08gqf is called.
If lrwork=-1, a workspace query is assumed; the routine only calculates the minimum dimension of the rwork array, returns this value as the first entry of the rwork array, and no error message related to lrwork is issued.
Constraints:
  • if n1, lrwork1 or lrwork=-1;
  • if job='N' and n>1, lrworkn or lrwork=-1;
  • if job='V' and n>1, lrwork2×n2+5×n+1 or lrwork=-1.
12: iworkmax1,liwork Integer array Workspace
On exit: if info=0, iwork1 contains the required minimal size of liwork.
13: liwork Integer Input
On entry: the dimension of the array iwork as declared in the (sub)program from which f08gqf is called.
If liwork=-1, a workspace query is assumed; the routine only calculates the minimum dimension of the iwork array, returns this value as the first entry of the iwork array, and no error message related to liwork is issued.
Constraints:
  • if job='N' or n1, liwork1 or liwork=-1;
  • if job='V' and n>1, liwork5×n+3 or liwork=-1.
14: info Integer Output
On exit: info=0 unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

info<0
If info=-i, argument i had an illegal value. An explanatory message is output, and execution of the program is terminated.
info>0
If info=value and job='N', the algorithm failed to converge; value elements of an intermediate tridiagonal form did not converge to zero; if info=value and job='V', then the algorithm failed to compute an eigenvalue while working on the submatrix lying in rows and column value/n+1 through value mod n+1.

7 Accuracy

The computed eigenvalues and eigenvectors are exact for a nearby matrix A+E, where
E2 = Oε A2 ,  
and ε is the machine precision. See Section 4.7 of Anderson et al. (1999) for further details.

8 Parallelism and Performance

f08gqf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08gqf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The real analogue of this routine is f08gcf.

10 Example

This example computes all the eigenvalues and eigenvectors of the Hermitian matrix A, where
A = 1.0+0.0i 2.0-1.0i 3.0-1.0i 4.0-1.0i 2.0+1.0i 2.0+0.0i 3.0-2.0i 4.0-2.0i 3.0+1.0i 3.0+2.0i 3.0+0.0i 4.0-3.0i 4.0+1.0i 4.0+2.0i 4.0+3.0i 4.0+0.0i .  

10.1 Program Text

Program Text (f08gqfe.f90)

10.2 Program Data

Program Data (f08gqfe.d)

10.3 Program Results

Program Results (f08gqfe.r)