Integer, Intent (In)	::	n, ilo, ihi, lda, ldb, ldq, ldz, lwork
Integer, Intent (Out)	::	info
Real (Kind=nag_wp), Intent (Inout)	::	a(lda,), b(ldb,), q(ldq,), z(ldz,)
Real (Kind=nag_wp), Intent (Out)	::	alphar(n), alphai(n), beta(n), work(max(1,lwork))
Character (1), Intent (In)	::	job, compq, compz

C Header Interface

#include nagmk26.h

void

f08xef_ ( const char *job, const char *compq, const char *compz, const Integer *n, const Integer *ilo, const Integer *ihi, double a[], const Integer *lda, double b[], const Integer *ldb, double alphar[], double alphai[], double beta[], double q[], const Integer *ldq, double z[], const Integer *ldz, double work[], const Integer *lwork, Integer *info, const Charlen length_job, const Charlen length_compq, const Charlen length_compz)

The routine may be called by its LAPACK name dhgeqz.

3

Description

f08xef (dhgeqz) implements a single-double-shift version of the

Q Z

method for finding the generalized eigenvalues of the real matrix pair

(A, B)

which is in the generalized upper Hessenberg form. If the matrix pair

(A, B)

is not in the generalized upper Hessenberg form, then the routine f08wef (dgghrd) should be called before invoking f08xef (dhgeqz).

This problem is mathematically equivalent to solving the equation

\det (A - λ B) = 0 .

Note that, to avoid underflow, overflow and other arithmetic problems, the generalized eigenvalues

λ_{j}

are never computed explicitly by this routine but defined as ratios between two computed values,

α_{j}

and

β_{j}

λ_{j} = α_{j} / β_{j} .

The arguments

α_{j}

, in general, are finite complex values and

β_{j}

are finite real non-negative values.

If desired, the matrix pair

(A, B)

may be reduced to generalized Schur form. That is, the transformed matrix

B

is upper triangular and the transformed matrix

A

is block upper triangular, where the diagonal blocks are either

1

1

2

2

. The

1

1

blocks provide generalized eigenvalues which are real and the

2

2

blocks give complex generalized eigenvalues.

The argument job specifies two options. If

job ='S'

then the matrix pair

(A, B)

is simultaneously reduced to Schur form by applying one orthogonal transformation (usually called

Q

) on the left and another (usually called

Z

) on the right. That is,

\begin{matrix} A \leftarrow Q^{T} A Z \\ B \leftarrow Q^{T} B Z \end{matrix}

The

2

2

upper-triangular diagonal blocks of

B

corresponding to

2

2

blocks of a will be reduced to non-negative diagonal matrices. That is, if

a (j + 1, j)

is nonzero, then

b (j + 1, j) = b (j, j + 1) = 0

and

b (j, j)

and

b (j + 1, j + 1)

will be non-negative.

job ='E'

, then at each iteration the same transformations are computed but they are only applied to those parts of

A

and

B

which are needed to compute

α

and

β

. This option could be used if generalized eigenvalues are required but not generalized eigenvectors.

job ='S'

and

compq ='V'

'I'

, and

compz ='V'

'I'

, then the orthogonal transformations used to reduce the pair

(A, B)

are accumulated into the input arrays q and z. If generalized eigenvectors are required then job must be set to

job ='S'

and if left (right) generalized eigenvectors are to be computed then compq (compz) must be set to

compq ='V'

'I'

and not

compq \neq'N'

compq ='I'

, then eigenvectors are accumulated on the identity matrix and on exit the array q contains the left eigenvector matrix

Q

. However, if

compq ='V'

then the transformations are accumulated on the user-supplied matrix

Q_{0}

in array q on entry and thus on exit q contains the matrix product

Q Q_{0}

. A similar convention is used for compz.

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

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

Moler C B and Stewart G W (1973) An algorithm for generalized matrix eigenproblems SIAM J. Numer. Anal. 10 241–256

Stewart G W and Sun J-G (1990) Matrix Perturbation Theory Academic Press, London

5

Arguments

1: $job$ – Character(1)Input

On entry: specifies the operations to be performed on

(A, B)

$job ='E'$: The matrix pair $(A, B)$ on exit might not be in the generalized Schur form.
$job ='S'$: The matrix pair $(A, B)$ on exit will be in the generalized Schur form.

Constraint:

job ='E'

'S'

2: $compq$ – Character(1)Input

On entry: specifies the operations to be performed on

Q

$compq ='N'$: The array q is unchanged.
$compq ='V'$: The left transformation $Q$ is accumulated on the array q.
$compq ='I'$: The array q is initialized to the identity matrix before the left transformation $Q$ is accumulated in q.

Constraint:

compq ='N'

'V'

'I'

3: $compz$ – Character(1)Input

On entry: specifies the operations to be performed on

Z

$compz ='N'$: The array z is unchanged.
$compz ='V'$: The right transformation $Z$ is accumulated on the array z.
$compz ='I'$: The array z is initialized to the identity matrix before the right transformation $Z$ is accumulated in z.

Constraint:

compz ='N'

'V'

'I'

4: $n$ – IntegerInput

On entry:

n

, the order of the matrices

A

B

Q

and

Z

Constraint:

n \geq 0

5: $ilo$ – IntegerInput

6: $ihi$ – IntegerInput

On entry: the indices

i_{lo}

and

i_{hi}

, respectively which define the upper triangular parts of

A

. The submatrices

A (1 : i_{lo} - 1, 1 : i_{lo} - 1)

and

A (i_{hi} + 1 : n, i_{hi} + 1 : n)

are then upper triangular. These arguments are provided by f08whf (dggbal) if the matrix pair was previously balanced; otherwise,

ilo = 1

and

ihi = n

Constraints:

if $n > 0$ , $1 \leq ilo \leq ihi \leq n$ ;
if $n = 0$ , $ilo = 1$ and $ihi = 0$ .

7: $a (lda *)$ – Real (Kind=nag_wp) arrayInput/Output

Note: the second dimension of the array a must be at least

\max (1, n)

On entry: the

n

n

upper Hessenberg matrix

A

. The elements below the first subdiagonal must be set to zero.

On exit: if

job ='S'

, the matrix pair

(A, B)

will be simultaneously reduced to generalized Schur form.

job ='E'

, the

1

1

and

2

2

diagonal blocks of the matrix pair

(A, B)

will give generalized eigenvalues but the remaining elements will be irrelevant.

8: $lda$ – IntegerInput

On entry: the first dimension of the array a as declared in the (sub)program from which f08xef (dhgeqz) is called.

Constraint:

lda \geq \max (1, n)

9: $b (ldb *)$ – Real (Kind=nag_wp) arrayInput/Output

Note: the second dimension of the array b must be at least

\max (1, n)

On entry: the

n

n

upper triangular matrix

B

. The elements below the diagonal must be zero.

On exit: if

job ='S'

, the matrix pair

(A, B)

will be simultaneously reduced to generalized Schur form.

job ='E'

, the

1

1

and

2

2

diagonal blocks of the matrix pair

(A, B)

will give generalized eigenvalues but the remaining elements will be irrelevant.

10: $ldb$ – IntegerInput

On entry: the first dimension of the array b as declared in the (sub)program from which f08xef (dhgeqz) is called.

Constraint:

ldb \geq \max (1, n)

11: $alphar (n)$ – Real (Kind=nag_wp) arrayOutput

On exit: the real parts of

α_{j}

, for

j = 1, 2, \dots, n

12: $alphai (n)$ – Real (Kind=nag_wp) arrayOutput

On exit: the imaginary parts of

α_{j}

, for

j = 1, 2, \dots, n

13: $beta (n)$ – Real (Kind=nag_wp) arrayOutput

On exit:

β_{j}

, for

j = 1, 2, \dots, n

14: $q (ldq *)$ – Real (Kind=nag_wp) arrayInput/Output

Note: the second dimension of the array q must be at least

\max (1, n)

compq ='V'

'I'

and at least

1

compq ='N'

On entry: if

compq ='V'

, the matrix

Q_{0}

. The matrix

Q_{0}

is usually the matrix

Q

returned by f08wef (dgghrd).

compq ='N'

, q is not referenced.

On exit: if

compq ='V'

, q contains the matrix product

Q Q_{0}

compq ='I'

, q contains the transformation matrix

Q

15: $ldq$ – IntegerInput

On entry: the first dimension of the array q as declared in the (sub)program from which f08xef (dhgeqz) is called.

Constraints:

if $compq ='V'$ or $'I'$ , $ldq \geq n$ ;
if $compq ='N'$ , $ldq \geq 1$ .

16: $z (ldz *)$ – Real (Kind=nag_wp) arrayInput/Output

Note: the second dimension of the array z must be at least

\max (1, n)

compz ='V'

'I'

and at least

1

compz ='N'

On entry: if

compz ='V'

, the matrix

Z_{0}

. The matrix

Z_{0}

is usually the matrix

Z

returned by f08wef (dgghrd).

compz ='N'

, z is not referenced.

On exit: if

compz ='V'

, z contains the matrix product

Z Z_{0}

compz ='I'

, z contains the transformation matrix

Z

17: $ldz$ – IntegerInput

On entry: the first dimension of the array z as declared in the (sub)program from which f08xef (dhgeqz) is called.

Constraints:

if $compz ='V'$ or $'I'$ , $ldz \geq n$ ;
if $compz ='N'$ , $ldz \geq 1$ .

18: $work (\max (1, lwork))$ – Real (Kind=nag_wp) arrayWorkspace

On exit: if

info = 0

work (1)

contains the minimum value of lwork required for optimal performance.

19: $lwork$ – IntegerInput

On entry: the dimension of the array work as declared in the (sub)program from which f08xef (dhgeqz) is called.

lwork = - 1

, a workspace query is assumed; the routine only calculates the minimum 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.

Constraint:

lwork \geq \max (1, n)

lwork = - 1

20: $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 $1 \leq info \leq n$ , the $Q Z$ iteration did not converge and the matrix pair $(A, B)$ is not in the generalized Schur form at exit. However, if $info < n$ , then the computed $α_{i}$ and $β_{i}$ should be correct for $i = info + 1, \dots, n$ .

If $n + 1 \leq info \leq 2 \times n$ , the computation of shifts failed and the matrix pair $(A, B)$ is not in the generalized Schur form at exit. However, if $info < 2 \times n$ , then the computed $α_{i}$ and $β_{i}$ should be correct for $i = info - n + 1, \dots, n$ .

If $info > 2 \times n$ , then an unexpected Library error has occurred. Please contact NAG with details of your program.

7

Accuracy

Please consult Section 4.11 of the LAPACK Users' Guide (see Anderson et al. (1999)) and Chapter 6 of Stewart and Sun (1990), for more information.

8

Parallelism and Performance

f08xef (dhgeqz) 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

f08xef (dhgeqz) is the fifth step in the solution of the real generalized eigenvalue problem and is called after f08wef (dgghrd).

The complex analogue of this routine is f08xsf (zhgeqz).

10

Example

This example computes the

α

and

β

arguments, which defines the generalized eigenvalues, of the matrix pair

(A, B)

given by

A = (\begin{array}{r} 1.0 & 1.0 & 1.0 & 1.0 & 1.0 \\ 2.0 & 4.0 & 8.0 & 16.0 & 32.0 \\ 3.0 & 9.0 & 27.0 & 81.0 & 243.0 \\ 4.0 & 16.0 & 64.0 & 256.0 & 1024.0 \\ 5.0 & 25.0 & 125.0 & 625.0 & 3125.0 \end{array})

B = (\begin{array}{r} 1.0 & 2.0 & 3.0 & 4.0 & 5.0 \\ 1.0 & 4.0 & 9.0 & 16.0 & 25.0 \\ 1.0 & 8.0 & 27.0 & 64.0 & 125.0 \\ 1.0 & 16.0 & 81.0 & 256.0 & 625.0 \\ 1.0 & 32.0 & 243.0 & 1024.0 & 3125.0 \end{array}) .

This requires calls to five routines: f08whf (dggbal) to balance the matrix, f08aef (dgeqrf) to perform the

Q R

factorization of

B

, f08agf (dormqr) to apply

Q

A

, f08wef (dgghrd) to reduce the matrix pair to the generalized Hessenberg form and f08xef (dhgeqz) to compute the eigenvalues using the

Q Z

algorithm.

NAG Library Routine Document

f08xef (dhgeqz)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results