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)	::	work(max(1,lwork))
Character (1), Intent (In)	::	compq, compz

C Header Interface

#include nagmk26.h

void

f08wff_ ( 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 q[], const Integer *ldq, double z[], const Integer *ldz, double work[], const Integer *lwork, Integer *info, const Charlen length_compq, const Charlen length_compz)

The routine may be called by its LAPACK name dgghd3.

3

Description

f08wff (dgghd3) is the third step in the solution of the real generalized eigenvalue problem

A x = λ B x .

The (optional) first step balances the two matrices using f08whf (dggbal). In the second step, matrix

B

is reduced to upper triangular form using the

Q R

factorization routine f08aef (dgeqrf) and this orthogonal transformation

Q

is applied to matrix

A

by calling f08agf (dormqr). The driver, f08wcf (dggev3), solves the real generalized eigenvalue problem by combining all the required steps including those just listed.

f08wff (dgghd3) reduces a pair of real matrices

(A, B)

, where

B

is upper triangular, to the generalized upper Hessenberg form using orthogonal transformations. This two-sided transformation is of the form

\begin{matrix} Q^{T} A Z = H, \\ Q^{T} B Z = T \end{matrix}

where

H

is an upper Hessenberg matrix,

T

is an upper triangular matrix and

Q

and

Z

are orthogonal matrices determined as products of Givens rotations. They may either be formed explicitly, or they may be postmultiplied into input matrices

Q_{1}

and

Z_{1}

, so that

\begin{matrix} Q_{1} A Z_{1}^{T} = (Q_{1} Q) H {(Z_{1} Z)}^{T}, \\ Q_{1} B Z_{1}^{T} = (Q_{1} Q) T {(Z_{1} Z)}^{T} . \end{matrix}

4

References

Golub G H and Van Loan C F (2012) Matrix Computations (4th 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

5

Arguments

1: $compq$ – Character(1)Input

On entry: specifies the form of the computed orthogonal matrix

Q

$compq ='N'$: Do not compute $Q$ .
$compq ='I'$: The orthogonal matrix $Q$ is returned.
$compq ='V'$: q must contain an orthogonal matrix $Q_{1}$ , and the product $Q_{1} Q$ is returned.

Constraint:

compq ='N'

'I'

'V'

2: $compz$ – Character(1)Input

On entry: specifies the form of the computed orthogonal matrix

Z

$compz ='N'$: Do not compute $Z$ .
$compz ='I'$: The orthogonal matrix $Z$ is returned.
$compz ='V'$: z must contain an orthogonal matrix $Z_{1}$ , and the product $Z_{1} Z$ is returned.

Constraint:

compz ='N'

'V'

'I'

3: $n$ – IntegerInput

On entry:

n

, the order of the matrices

A

and

B

Constraint:

n \geq 0

4: $ilo$ – IntegerInput

5: $ihi$ – IntegerInput

On entry:

i_{lo}

and

i_{hi}

as determined by a previous call to f08whf (dggbal). Otherwise, they should be set to

1

and

n

, respectively.

Constraints:

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

6: $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 matrix

A

of the matrix pair

(A, B)

. Usually, this is the matrix

A

returned by f08agf (dormqr).

On exit: a is overwritten by the upper Hessenberg matrix

H

7: $lda$ – IntegerInput

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

Constraint:

lda \geq \max (1, n)

8: $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 upper triangular matrix

B

of the matrix pair

(A, B)

. Usually, this is the matrix

B

returned by the

Q R

factorization routine f08aef (dgeqrf).

On exit: b is overwritten by the upper triangular matrix

T

9: $ldb$ – IntegerInput

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

Constraint:

ldb \geq \max (1, n)

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

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

\max (1, n)

compq ='I'

'V'

and at least

1

compq ='N'

On entry: if

compq ='V'

, q must contain an orthogonal matrix

Q_{1}

compq ='N'

, q is not referenced.

On exit: if

compq ='I'

, q contains the orthogonal matrix

Q

compq ='V'

, q is overwritten by

Q_{1} Q

11: $ldq$ – IntegerInput

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

Constraints:

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

12: $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'

, z must contain an orthogonal matrix

Z_{1}

compz ='N'

, z is not referenced.

On exit: if

compz ='I'

, z contains the orthogonal matrix

Z

compz ='V'

, z is overwritten by

Z_{1} Z

13: $ldz$ – IntegerInput

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

Constraints:

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

14: $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.

15: $lwork$ – IntegerInput

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

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,

6 \times nb \times n

, where

nb

is the optimal block size.

16: $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.

7

Accuracy

The reduction to the generalized Hessenberg form is implemented using orthogonal transformations which are backward stable.

8

Parallelism and Performance

f08wff (dgghd3) 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

This routine is usually followed by f08xef (dhgeqz) which implements the

Q Z

algorithm for computing generalized eigenvalues of a reduced pair of matrices.

The complex analogue of this routine is f08wtf (zgghd3).

10

Example

See Section 10 in f08xef (dhgeqz) and f08ykf (dtgevc).

f08wff (dgghd3) (PDF version)

F08 (lapack) Chapter Contents

F08 (lapack) Chapter Introduction

NAG Library Manual

NAG Library Routine Document

f08wff (dgghd3)

▸▿ 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

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