NAG FL Interface
f08xnf (zgges)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

1: $\mathbf{jobvsl}$ – Character(1) Input

On entry: if $\mathbf{jobvsl}=\text{'N'}$, do not compute the left Schur vectors.

If $\mathbf{jobvsl}=\text{'V'}$, compute the left Schur vectors.

Constraint: $\mathbf{jobvsl}=\text{'N'}$ or $\text{'V'}$.

2: $\mathbf{jobvsr}$ – Character(1) Input

On entry: if $\mathbf{jobvsr}=\text{'N'}$, do not compute the right Schur vectors.

If $\mathbf{jobvsr}=\text{'V'}$, compute the right Schur vectors.

Constraint: $\mathbf{jobvsr}=\text{'N'}$ or $\text{'V'}$.

3: $\mathbf{sort}$ – Character(1) Input

On entry: specifies whether or not to order the eigenvalues on the diagonal of the generalized Schur form.

$\mathbf{sort}=\text{'N'}$

Eigenvalues are not ordered.

$\mathbf{sort}=\text{'S'}$

Eigenvalues are ordered (see selctg).

Constraint: $\mathbf{sort}=\text{'N'}$ or $\text{'S'}$.

4: $\mathbf{selctg}$ – Logical Function, supplied by the user. External Procedure

If $\mathbf{sort}=\text{'S'}$, selctg is used to select generalized eigenvalues to be moved to the top left of the generalized Schur form.

If $\mathbf{sort}=\text{'N'}$, selctg is not referenced by f08xnf, and may be called with the dummy function f08xnz.

The specification of selctg is:

Fortran Interface copy

Function selctg ( a, b) Logical :: selctg Complex (Kind=nag_wp), Intent (In) :: a, b

C Header Interface copy

Nag_Boolean  selctg (const Complex *a, const Complex *b)

C++ Header Interface copy

#include <nag.h> extern "C" { Nag_Boolean  selctg (const Complex &a, const Complex &b) }

1: $\mathbf{a}$ – Complex (Kind=nag_wp) Input

2: $\mathbf{b}$ – Complex (Kind=nag_wp) Input

On entry: an eigenvalue $\mathbf{a}\left(j\right)/\mathbf{b}\left(j\right)$ is selected if $\mathbf{selctg}(\mathbf{a}\left(j\right),\mathbf{b}\left(j\right))$ is .TRUE..

Note that in the ill-conditioned case, a selected generalized eigenvalue may no longer satisfy $\mathbf{selctg}(\mathbf{a}\left(j\right),\mathbf{b}\left(j\right))=\mathrm{.TRUE.}$ after ordering. $\mathbf{info}=\mathbf{n}+\mathbf{2}$ in this case.

selctg must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which f08xnf is called. Arguments denoted as Input must not be changed by this procedure.

5: $\mathbf{n}$ – Integer Input

On entry: $n$, the order of the matrices $A$ and $B$.

Constraint: $\mathbf{n}\ge 0$.

6: $\mathbf{a}(\mathbf{lda},*)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array a must be at least $\max (1,\mathbf{n})$.

On entry: the first of the pair of matrices, $A$.

On exit: a has been overwritten by its generalized Schur form $S$.

7: $\mathbf{lda}$ – Integer Input

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

Constraint: $\mathbf{lda}\ge \max (1,\mathbf{n})$.

8: $\mathbf{b}(\mathbf{ldb},*)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array b must be at least $\max (1,\mathbf{n})$.

On entry: the second of the pair of matrices, $B$.

On exit: b has been overwritten by its generalized Schur form $T$.

9: $\mathbf{ldb}$ – Integer Input

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

Constraint: $\mathbf{ldb}\ge \max (1,\mathbf{n})$.

10: $\mathbf{sdim}$ – Integer Output

On exit: if $\mathbf{sort}=\text{'N'}$, $\mathbf{sdim}=0$.

If $\mathbf{sort}=\text{'S'}$, $\mathbf{sdim}=$ number of eigenvalues (after sorting) for which selctg is .TRUE..

11: $\mathbf{alpha}\left(\mathbf{n}\right)$ – Complex (Kind=nag_wp) array Output

On exit: see the description of beta.

12: $\mathbf{beta}\left(\mathbf{n}\right)$ – Complex (Kind=nag_wp) array Output

On exit: $\mathbf{alpha}\left(\mathit{j}\right)/\mathbf{beta}\left(\mathit{j}\right)$, for $\mathit{j}=1,2,\dots ,\mathbf{n}$, will be the generalized eigenvalues. $\mathbf{alpha}\left(\mathit{j}\right)$, for $\mathit{j}=1,2,\dots ,\mathbf{n}$ and $\mathbf{beta}\left(\mathit{j}\right)$, for $\mathit{j}=1,2,\dots ,\mathbf{n}$, are the diagonals of the complex Schur form $(A,B)$ output by f08xnf. The $\mathbf{beta}\left(j\right)$ will be non-negative real.

Note:  the quotients $\mathbf{alpha}\left(j\right)/\mathbf{beta}\left(j\right)$ may easily overflow or underflow, and $\mathbf{beta}\left(j\right)$ may even be zero. Thus, you should avoid naively computing the ratio $\alpha /\beta$. However, alpha will always be less than and usually comparable with ${\Vert A\Vert }_2$ in magnitude, and beta will always be less than and usually comparable with ${\Vert B\Vert }_2$.

13: $\mathbf{vsl}(\mathbf{ldvsl},*)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array vsl must be at least $\max (1,\mathbf{n})$ if $\mathbf{jobvsl}=\text{'V'}$, and at least $1$ otherwise.

On exit: if $\mathbf{jobvsl}=\text{'V'}$, vsl will contain the left Schur vectors, $Q$.

If $\mathbf{jobvsl}=\text{'N'}$, vsl is not referenced.

14: $\mathbf{ldvsl}$ – Integer Input

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

Constraints:

• if $\mathbf{jobvsl}=\text{'V'}$, $\mathbf{ldvsl}\ge \max (1,\mathbf{n})$;
• otherwise $\mathbf{ldvsl}\ge 1$.

15: $\mathbf{vsr}(\mathbf{ldvsr},*)$ – Complex (Kind=nag_wp) array Output

Note: the second dimension of the array vsr must be at least $\max (1,\mathbf{n})$ if $\mathbf{jobvsr}=\text{'V'}$, and at least $1$ otherwise.

On exit: if $\mathbf{jobvsr}=\text{'V'}$, vsr will contain the right Schur vectors, $Z$.

If $\mathbf{jobvsr}=\text{'N'}$, vsr is not referenced.

16: $\mathbf{ldvsr}$ – Integer Input

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

Constraints:

• if $\mathbf{jobvsr}=\text{'V'}$, $\mathbf{ldvsr}\ge \max (1,\mathbf{n})$;
• otherwise $\mathbf{ldvsr}\ge 1$.

17: $\mathbf{work}\left(\max (1,\mathbf{lwork})\right)$ – Complex (Kind=nag_wp) array Workspace

On exit: if $\mathbf{info}=\mathbf{0}$, the real part of $\mathbf{work}\left(1\right)$ contains the minimum value of lwork required for optimal performance.

18: $\mathbf{lwork}$ – Integer Input

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

If $\mathbf{lwork}=\mathrm{-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, say $2\times \mathbf{n}+\mathit{nb}\times \mathbf{n}$, where $\mathit{nb}$ is the optimal block size for f08nsf.

Constraint: $\mathbf{lwork}\ge \max (1,2\times \mathbf{n})$.

19: $\mathbf{rwork}\left(\max (1,8\times \mathbf{n})\right)$ – Real (Kind=nag_wp) array Workspace

20: $\mathbf{bwork}\left(*\right)$ – Logical array Workspace

Note: the dimension of the array bwork must be at least $1$ if $\mathbf{sort}=\text{'N'}$, and at least $\max (1,\mathbf{n})$ otherwise.

If $\mathbf{sort}=\text{'N'}$, bwork is not referenced.

21: $\mathbf{info}$ – Integer Output

On exit: $\mathbf{info}=0$ unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

$\mathbf{info}<0$

If $\mathbf{info}=-i$, argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

$\mathbf{info}=1,\dots ,\mathbf{n}$

The $QZ$ iteration did not converge and the matrix pair $(A,B)$ is not in the generalized Schur form. The computed ${\alpha }_i$ and ${\beta }_i$ should be correct for $i=⟨\mathit{\text{value}}⟩,\dots ,⟨\mathit{\text{value}}⟩$.

$\mathbf{info}=\mathbf{n}+1$

The $QZ$ iteration failed with an unexpected error, please contact NAG.

$\mathbf{info}=\mathbf{n}+2$

After reordering, roundoff changed values of some complex eigenvalues so that leading eigenvalues in the generalized Schur form no longer satisfy $\mathbf{selctg}=\mathrm{.TRUE.}$. This could also be caused by underflow due to scaling.

$\mathbf{info}=\mathbf{n}+3$

The eigenvalues could not be reordered because some eigenvalues were too close to separate (the problem is very ill-conditioned).

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results