NAG FL Interface
f08waf (dggev)

Note: this routine is deprecated. Replaced by f08wcf.
Settings help

FL Name Style:


FL Specification Language:


1 Purpose

f08waf computes for a pair of n×n real nonsymmetric matrices (A,B) the generalized eigenvalues and, optionally, the left and/or right generalized eigenvectors using the QZ algorithm. f08waf is marked as deprecated by LAPACK; the replacement routine is f08wcf which makes better use of Level 3 BLAS.

2 Specification

Fortran Interface
Subroutine f08waf ( jobvl, jobvr, n, a, lda, b, ldb, alphar, alphai, beta, vl, ldvl, vr, ldvr, work, lwork, info)
Integer, Intent (In) :: n, lda, ldb, ldvl, ldvr, lwork
Integer, Intent (Out) :: info
Real (Kind=nag_wp), Intent (Inout) :: a(lda,*), b(ldb,*), vl(ldvl,*), vr(ldvr,*)
Real (Kind=nag_wp), Intent (Out) :: alphar(n), alphai(n), beta(n), work(max(1,lwork))
Character (1), Intent (In) :: jobvl, jobvr
C Header Interface
#include <nag.h>
void  f08waf_ (const char *jobvl, const char *jobvr, const Integer *n, double a[], const Integer *lda, double b[], const Integer *ldb, double alphar[], double alphai[], double beta[], double vl[], const Integer *ldvl, double vr[], const Integer *ldvr, double work[], const Integer *lwork, Integer *info, const Charlen length_jobvl, const Charlen length_jobvr)
The routine may be called by the names f08waf, nagf_lapackeig_dggev or its LAPACK name dggev.

3 Description

A generalized eigenvalue for a pair of matrices (A,B) is a scalar λ or a ratio α/β=λ, such that A-λB is singular. It is usually represented as the pair (α,β), as there is a reasonable interpretation for β=0, and even for both being zero.
The right eigenvector vj corresponding to the eigenvalue λj of (A,B) satisfies
A vj = λj B vj .  
The left eigenvector uj corresponding to the eigenvalue λj of (A,B) satisfies
ujH A = λj ujH B ,  
where ujH is the conjugate-transpose of uj.
All the eigenvalues and, if required, all the eigenvectors of the generalized eigenproblem Ax=λBx, where A and B are real, square matrices, are determined using the QZ algorithm. The QZ algorithm consists of four stages:
  1. 1.A is reduced to upper Hessenberg form and at the same time B is reduced to upper triangular form.
  2. 2.A is further reduced to quasi-triangular form while the triangular form of B is maintained. This is the real generalized Schur form of the pair (A,B) .
  3. 3.The quasi-triangular form of A is reduced to triangular form and the eigenvalues extracted. This routine does not actually produce the eigenvalues λj, but instead returns αj and βj such that
    λj=αj/βj,  j=1,2,,n.  
    The division by βj becomes your responsibility, since βj may be zero, indicating an infinite eigenvalue. Pairs of complex eigenvalues occur with αj/βj and αj+1/βj+1 complex conjugates, even though αj and αj+1 are not conjugate.
  4. 4.If the eigenvectors are required they are obtained from the triangular matrices and then transformed back into the original coordinate system.

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 (2012) Matrix Computations (4th Edition) Johns Hopkins University Press, Baltimore
Wilkinson J H (1979) Kronecker's canonical form and the QZ algorithm Linear Algebra Appl. 28 285–303

5 Arguments

1: jobvl Character(1) Input
On entry: if jobvl='N', do not compute the left generalized eigenvectors.
If jobvl='V', compute the left generalized eigenvectors.
Constraint: jobvl='N' or 'V'.
2: jobvr Character(1) Input
On entry: if jobvr='N', do not compute the right generalized eigenvectors.
If jobvr='V', compute the right generalized eigenvectors.
Constraint: jobvr='N' or 'V'.
3: n Integer Input
On entry: n, the order of the matrices A and B.
Constraint: n0.
4: a(lda,*) Real (Kind=nag_wp) array Input/Output
Note: the second dimension of the array a must be at least max(1,n).
On entry: the matrix A in the pair (A,B).
On exit: a has been overwritten.
5: lda Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f08waf is called.
Constraint: ldamax(1,n).
6: b(ldb,*) Real (Kind=nag_wp) array Input/Output
Note: the second dimension of the array b must be at least max(1,n).
On entry: the matrix B in the pair (A,B).
On exit: b has been overwritten.
7: ldb Integer Input
On entry: the first dimension of the array b as declared in the (sub)program from which f08waf is called.
Constraint: ldbmax(1,n).
8: alphar(n) Real (Kind=nag_wp) array Output
On exit: the element alphar(j) contains the real part of αj.
9: alphai(n) Real (Kind=nag_wp) array Output
On exit: the element alphai(j) contains the imaginary part of αj.
10: beta(n) Real (Kind=nag_wp) array Output
On exit: (alphar(j)+alphai(j)×i)/beta(j), for j=1,2,,n, will be the generalized eigenvalues.
If alphai(j) is zero, then the jth eigenvalue is real; if positive, then the jth and (j+1)st eigenvalues are a complex conjugate pair, with alphai(j+1) negative.
Note:  the quotients alphar(j)/beta(j) and alphai(j)/beta(j) may easily overflow or underflow, and beta(j) may even be zero. Thus, you should avoid naively computing the ratio αj/βj. However, max|αj| will always be less than and usually comparable with A2 in magnitude, and max|βj| will always be less than and usually comparable with B2.
11: vl(ldvl,*) Real (Kind=nag_wp) array Output
Note: the second dimension of the array vl must be at least max(1,n) if jobvl='V', and at least 1 otherwise.
On exit: if jobvl='V', the left eigenvectors uj are stored one after another in the columns of vl, in the same order as the corresponding eigenvalues.
If the jth eigenvalue is real, then uj=vl(:,j), the jth column of vl.
If the jth and (j+1)th eigenvalues form a complex conjugate pair, then uj=vl(:,j)+i×vl(:,j+1) and u(j+1)=vl(:,j)-i×vl(:,j+1). Each eigenvector will be scaled so the largest component has |real part|+|imag. part|=1.
If jobvl='N', vl is not referenced.
12: ldvl Integer Input
On entry: the first dimension of the array vl as declared in the (sub)program from which f08waf is called.
Constraints:
  • if jobvl='V', ldvl max(1,n) ;
  • otherwise ldvl1.
13: vr(ldvr,*) Real (Kind=nag_wp) array Output
Note: the second dimension of the array vr must be at least max(1,n) if jobvr='V', and at least 1 otherwise.
On exit: if jobvr='V', the right eigenvectors vj are stored one after another in the columns of vr, in the same order as the corresponding eigenvalues.
If the jth eigenvalue is real, then vj=vr(:,j), the jth column of VR.
If the jth and (j+1)th eigenvalues form a complex conjugate pair, then vj=vr(:,j)+i×vr(:,j+1) and vj+1=vr(:,j)-i×vr(:,j+1). Each eigenvector will be scaled so the largest component has |real part|+|imag. part|=1.
If jobvr='N', vr is not referenced.
14: ldvr Integer Input
On entry: the first dimension of the array vr as declared in the (sub)program from which f08waf is called.
Constraints:
  • if jobvr='V', ldvr max(1,n) ;
  • otherwise ldvr1.
15: work(max(1,lwork)) Real (Kind=nag_wp) array Workspace
On exit: if info=0, work(1) contains the minimum value of lwork required for optimal performance.
16: lwork Integer Input
On entry: the dimension of the array work as declared in the (sub)program from which f08waf is called.
If lwork=−1, a workspace query is assumed; the routine only calculates the optimal size of the work array, returns this value as the first entry of the work array, and no error message related to lwork is issued.
Suggested value: for optimal performance, lwork must generally be larger than the minimum; increase workspace by, say, nb×n, where nb is the optimal block size.
Constraint: lworkmax(1,8×n).
17: 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=1,,n
The QZ iteration failed. No eigenvectors have been calculated but alphar(j), alphai(j) and beta(j) should be correct from element value.
info=n+1
The QZ iteration failed with an unexpected error, please contact NAG.
info=n+2
A failure occurred in f08ykf while computing generalized eigenvectors.

7 Accuracy

The computed eigenvalues and eigenvectors are exact for nearby matrices (A+E) and (B+F), where
(E,F) F = O(ε) (A,B) F ,  
and ε is the machine precision. See Section 4.11 of Anderson et al. (1999) for further details.
Note:  interpretation of results obtained with the QZ algorithm often requires a clear understanding of the effects of small changes in the original data. These effects are reviewed in Wilkinson (1979), in relation to the significance of small values of αj and βj. It should be noted that if αj and βj are both small for any j, it may be that no reliance can be placed on any of the computed eigenvalues λi=αi/βi. You are recommended to study Wilkinson (1979) and, if in difficulty, to seek expert advice on determining the sensitivity of the eigenvalues to perturbations in the data.

8 Parallelism and Performance

f08waf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08waf 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.
The complex analogue of this routine is f08wnf.

10 Example

This example finds all the eigenvalues and right eigenvectors of the matrix pair (A,B), where
A = ( 3.9 12.5 -34.5 -0.5 4.3 21.5 -47.5 7.5 4.3 21.5 -43.5 3.5 4.4 26.0 -46.0 6.0 )   and   B= ( 1.0 2.0 -3.0 1.0 1.0 3.0 -5.0 4.0 1.0 3.0 -4.0 3.0 1.0 3.0 -4.0 4.0 ) .  
Note that the block size (NB) of 64 assumed in this example is not realistic for such a small problem, but should be suitable for large problems.

10.1 Program Text

Program Text (f08wafe.f90)

10.2 Program Data

Program Data (f08wafe.d)

10.3 Program Results

Program Results (f08wafe.r)