NAG Library Routine Document

f08uqf  (zhbgvd)

 Contents

    1  Purpose
    7  Accuracy

1
Purpose

f08uqf (zhbgvd) computes all the eigenvalues and, optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form
Az=λBz ,  
where A and B are Hermitian and banded, and B is also positive definite. If eigenvectors are desired, it uses a divide-and-conquer algorithm.

2
Specification

Fortran Interface
Subroutine f08uqf ( jobz, uplo, n, ka, kb, ab, ldab, bb, ldbb, w, z, ldz, work, lwork, rwork, lrwork, iwork, liwork, info)
Integer, Intent (In):: n, ka, kb, ldab, ldbb, ldz, lwork, lrwork, liwork
Integer, Intent (Out):: iwork(max(1,liwork)), info
Real (Kind=nag_wp), Intent (Out):: w(n), rwork(max(1,lrwork))
Complex (Kind=nag_wp), Intent (Inout):: ab(ldab,*), bb(ldbb,*), z(ldz,*)
Complex (Kind=nag_wp), Intent (Out):: work(max(1,lwork))
Character (1), Intent (In):: jobz, uplo
C Header Interface
#include nagmk26.h
void  f08uqf_ ( const char *jobz, const char *uplo, const Integer *n, const Integer *ka, const Integer *kb, Complex ab[], const Integer *ldab, Complex bb[], const Integer *ldbb, 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_jobz, const Charlen length_uplo)
The routine may be called by its LAPACK name zhbgvd.

3
Description

The generalized Hermitian-definite band problem
Az = λ Bz  
is first reduced to a standard band Hermitian problem
Cx = λx ,  
where C is a Hermitian band matrix, using Wilkinson's modification to Crawford's algorithm (see Crawford (1973) and Wilkinson (1977)). The Hermitian eigenvalue problem is then solved for the eigenvalues and the eigenvectors, if required, which are then backtransformed to the eigenvectors of the original problem.
The eigenvectors are normalized so that the matrix of eigenvectors, Z, satisfies
ZH A Z = Λ   and   ZH B Z = I ,  
where Λ  is the diagonal matrix whose diagonal elements are the eigenvalues.

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 http://www.netlib.org/lapack/lug
Crawford C R (1973) Reduction of a band-symmetric generalized eigenvalue problem Comm. ACM 16 41–44
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Wilkinson J H (1977) Some recent advances in numerical linear algebra The State of the Art in Numerical Analysis (ed D A H Jacobs) Academic Press

5
Arguments

1:     jobz – Character(1)Input
On entry: indicates whether eigenvectors are computed.
jobz='N'
Only eigenvalues are computed.
jobz='V'
Eigenvalues and eigenvectors are computed.
Constraint: jobz='N' or 'V'.
2:     uplo – Character(1)Input
On entry: if uplo='U', the upper triangles of A and B are stored.
If uplo='L', the lower triangles of A and B are stored.
Constraint: uplo='U' or 'L'.
3:     n – IntegerInput
On entry: n, the order of the matrices A and B.
Constraint: n0.
4:     ka – IntegerInput
On entry: if uplo='U', the number of superdiagonals, ka, of the matrix A.
If uplo='L', the number of subdiagonals, ka, of the matrix A.
Constraint: ka0.
5:     kb – IntegerInput
On entry: if uplo='U', the number of superdiagonals, kb, of the matrix B.
If uplo='L', the number of subdiagonals, kb, of the matrix B.
Constraint: kakb0.
6:     abldab* – Complex (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array ab must be at least max1,n.
On entry: the upper or lower triangle of the n by n Hermitian band matrix A.
The matrix is stored in rows 1 to ka+1, more precisely,
  • if uplo='U', the elements of the upper triangle of A within the band must be stored with element Aij in abka+1+i-jj​ for ​max1,j-kaij;
  • if uplo='L', the elements of the lower triangle of A within the band must be stored with element Aij in ab1+i-jj​ for ​jiminn,j+ka.
On exit: the contents of ab are overwritten.
7:     ldab – IntegerInput
On entry: the first dimension of the array ab as declared in the (sub)program from which f08uqf (zhbgvd) is called.
Constraint: ldabka+1.
8:     bbldbb* – Complex (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array bb must be at least max1,n.
On entry: the upper or lower triangle of the n by n Hermitian band matrix B.
The matrix is stored in rows 1 to kb+1, more precisely,
  • if uplo='U', the elements of the upper triangle of B within the band must be stored with element Bij in bbkb+1+i-jj​ for ​max1,j-kbij;
  • if uplo='L', the elements of the lower triangle of B within the band must be stored with element Bij in bb1+i-jj​ for ​jiminn,j+kb.
On exit: the factor S from the split Cholesky factorization B=SHS, as returned by f08utf (zpbstf).
9:     ldbb – IntegerInput
On entry: the first dimension of the array bb as declared in the (sub)program from which f08uqf (zhbgvd) is called.
Constraint: ldbbkb+1.
10:   wn – Real (Kind=nag_wp) arrayOutput
On exit: the eigenvalues in ascending order.
11:   zldz* – Complex (Kind=nag_wp) arrayOutput
Note: the second dimension of the array z must be at least max1,n if jobz='V', and at least 1 otherwise.
On exit: if jobz='V', z contains the matrix Z of eigenvectors, with the ith column of Z holding the eigenvector associated with wi. The eigenvectors are normalized so that ZHBZ=I.
If jobz='N', z is not referenced.
12:   ldz – IntegerInput
On entry: the first dimension of the array z as declared in the (sub)program from which f08uqf (zhbgvd) is called.
Constraints:
  • if jobz='V', ldz max1,n ;
  • otherwise ldz1.
13:   workmax1,lwork – Complex (Kind=nag_wp) arrayWorkspace
On exit: if info=0, the real part of work1 contains the minimum value of lwork required for optimal performance.
14:   lwork – IntegerInput
On entry: the dimension of the array work as declared in the (sub)program from which f08uqf (zhbgvd) is called.
If lwork=-1, a workspace query is assumed; the routine only calculates the optimal sizes of the work, rwork and iwork arrays, returns these values as the first entries of the work, rwork and iwork arrays, and no error message related to lwork, lrwork or liwork is issued.
Constraints:
  • if n1, lwork1;
  • if jobz='N' and n>1, lworkmax1,n;
  • if jobz='V' and n>1, lworkmax1,2×n2.
15:   rworkmax1,lrwork – Real (Kind=nag_wp) arrayWorkspace
On exit: if info=0, rwork1 returns the optimal lrwork.
16:   lrwork – IntegerInput
On entry: the first dimension of the array rwork as declared in the (sub)program from which f08uqf (zhbgvd) is called.
If lrwork=-1, a workspace query is assumed; the routine only calculates the optimal sizes of the work, rwork and iwork arrays, returns these values as the first entries of the work, rwork and iwork arrays, and no error message related to lwork, lrwork or liwork is issued.
Constraints:
  • if n1, lrwork1;
  • if jobz='N' and n>1, lrworkmax1,n;
  • if jobz='V' and n>1, lrwork1+5×n+2×n2.
17:   iworkmax1,liwork – Integer arrayWorkspace
On exit: if info=0, iwork1 returns the optimal liwork.
18:   liwork – IntegerInput
On entry: the dimension of the array iwork as declared in the (sub)program from which f08uqf (zhbgvd) is called.
If liwork=-1, a workspace query is assumed; the routine only calculates the optimal sizes of the work, rwork and iwork arrays, returns these values as the first entries of the work, rwork and iwork arrays, and no error message related to lwork, lrwork or liwork is issued.
Constraints:
  • if jobz='N' or n1, liwork1;
  • if jobz='V' and n>1, liwork3+5×n.
19:   info – IntegerOutput
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=i and in, the algorithm failed to converge; i off-diagonal elements of an intermediate tridiagonal form did not converge to zero.
If info=i and i>n, if info=n+i, for 1in, then f08utf (zpbstf) returned info=i: B is not positive definite. The factorization of B could not be completed and no eigenvalues or eigenvectors were computed.

7
Accuracy

If B is ill-conditioned with respect to inversion, then the error bounds for the computed eigenvalues and vectors may be large, although when the diagonal elements of B differ widely in magnitude the eigenvalues and eigenvectors may be less sensitive than the condition of B would suggest. See Section 4.10 of Anderson et al. (1999) for details of the error bounds.

8
Parallelism and Performance

f08uqf (zhbgvd) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08uqf (zhbgvd) 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 total number of floating-point operations is proportional to n3  if jobz='V' and, assuming that nka , is approximately proportional to n2 ka  otherwise.
The real analogue of this routine is f08ucf (dsbgvd).

10
Example

This example finds all the eigenvalues of the generalized band Hermitian eigenproblem Az = λ Bz , where
A = -1.13i+0.00 1.94-2.10i -1.40+0.25i 0.00i+0.00 1.94+2.10i -1.91i+0.00 -0.82-0.89i -0.67+0.34i -1.40-0.25i -0.82+0.89i -1.87i+0.00 -1.10-0.16i 0.00i+0.00 -0.67-0.34i -1.10+0.16i 0.50i+0.00  
and
B = 9.89i+0.00 1.08-1.73i 0.00i+0.00 0.00i+0.00 1.08+1.73i 1.69i+0.00 -0.04+0.29i 0.00i+0.00 0.00i+0.00 -0.04-0.29i 2.65i+0.00 -0.33+2.24i 0.00i+0.00 0.00i+0.00 -0.33-2.24i 2.17i+0.00 .  

10.1
Program Text

Program Text (f08uqfe.f90)

10.2
Program Data

Program Data (f08uqfe.d)

10.3
Program Results

Program Results (f08uqfe.r)

© The Numerical Algorithms Group Ltd, Oxford, UK. 2017