Integer, Intent (In)	::	n, ldt, ldq, ifst, ilst
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (Inout)	::	t(ldt,), q(ldq,)
Character (1), Intent (In)	::	compq

C Header Interface

#include <nag.h>

void	f08qtf_ (const char compq, const Integer n, Complex t[], const Integer ldt, Complex q[], const Integer ldq, const Integer ifst, const Integer ilst, Integer *info, const Charlen length_compq)

The routine may be called by the names f08qtf, nagf_lapackeig_ztrexc or its LAPACK name ztrexc.

3 Description

f08qtf reorders the Schur factorization of a complex general matrix

A = Q T Q^{H}

, so that the diagonal element of

T

with row index ifst is moved to row ilst.

The reordered Schur form

\tilde{T}

is computed by a unitary similarity transformation:

\tilde{T} = Z^{H} T Z

. Optionally the updated matrix

\tilde{Q}

of Schur vectors is computed as

\tilde{Q} = Q Z

, giving

A = \tilde{Q} \tilde{T} {\tilde{Q}}^{H}

4 References

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

5 Arguments

1: $compq$ – Character(1) Input

On entry: indicates whether the matrix

Q

of Schur vectors is to be updated.

$compq ='V'$: The matrix $Q$ of Schur vectors is updated.
$compq ='N'$: No Schur vectors are updated.

Constraint:

compq ='V'

'N'

2: $n$ – Integer Input

On entry:

n

, the order of the matrix

T

Constraint:

n \geq 0

3: $t (ldt *)$ – Complex (Kind=nag_wp) array Input/Output

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

\max (1, n)

On entry: the

n

n

upper triangular matrix

T

, as returned by f08psf.

On exit: t is overwritten by the updated matrix

\tilde{T}

4: $ldt$ – Integer Input

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

Constraint:

ldt \geq \max (1, n)

5: $q (ldq *)$ – Complex (Kind=nag_wp) array Input/Output

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

\max (1, n)

compq ='V'

and at least

1

compq ='N'

On entry: if

compq ='V'

, q must contain the

n

n

unitary matrix

Q

of Schur vectors.

On exit: if

compq ='V'

, q contains the updated matrix of Schur vectors.

compq ='N'

, q is not referenced.

6: $ldq$ – Integer Input

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

Constraints:

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

7: $ifst$ – Integer Input

8: $ilst$ – Integer Input

On entry: ifst and ilst must specify the reordering of the diagonal elements of

T

. The element with row index ifst is moved to row ilst by a sequence of exchanges between adjacent elements.

Constraint:

1 \leq ifst \leq n

and

1 \leq ilst \leq n

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

7 Accuracy

The computed matrix

\tilde{T}

is exactly similar to a matrix

(T + E)

, where

{‖E‖}_{2} = O (ε) {‖T‖}_{2},

and

ε

is the machine precision.

The values of the eigenvalues are never changed by the reordering.

8 Parallelism and Performance

f08qtf 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 real floating-point operations is approximately

20 n r

compq ='N'

, and

40 n r

compq ='V'

, where

r = |ifst - ilst|

The real analogue of this routine is f08qff.

10 Example

This example reorders the Schur factorization of the matrix

T

so that element

t_{11}

is moved to

t_{44}

, where

T = (\begin{array}{r} - 6.00 - 7.00 i & 0.36 - 0.36 i & - 0.19 + 0.48 i & 0.88 - 0.25 i \\ 0.00 + 0.00 i & - 5.00 + 2.00 i & - 0.03 - 0.72 i & - 0.23 + 0.13 i \\ 0.00 + 0.00 i & 0.00 + 0.00 i & 8.00 - 1.00 i & 0.94 + 0.53 i \\ 0.00 + 0.00 i & 0.00 + 0.00 i & 0.00 + 0.00 i & 3.00 - 4.00 i \end{array}) .

Interfaces: FL CL AD

NAG FL Interface Introduction

F08 (Lapackeig) Chapter Contents

F08 (Lapackeig) Chapter Introduction

f08qt: FL CL AD

NAG FL Interfacef08qtf (ztrexc)

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

NAG FL Interface
f08qtf (ztrexc)