Integer, Intent (In)	::	n, ilo, ihi, lda, lwork
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (In)	::	tau(*)
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,*)
Complex (Kind=nag_wp), Intent (Out)	::	work(max(1,lwork))

C Header Interface

#include <nag.h>

void	f08ntf_ (const Integer n, const Integer ilo, const Integer ihi, Complex a[], const Integer lda, const Complex tau[], Complex work[], const Integer lwork, Integer info)

The routine may be called by the names f08ntf, nagf_lapackeig_zunghr or its LAPACK name zunghr.

3 Description

f08ntf is intended to be used following a call to f08nsf, which reduces a complex general matrix

A

to upper Hessenberg form

H

by a unitary similarity transformation:

A = Q H Q^{H}

. f08nsf represents the matrix

Q

as a product of

i_{hi} - i_{lo}

elementary reflectors. Here

i_{lo}

and

i_{hi}

are values determined by f08nvf when balancing the matrix; if the matrix has not been balanced,

i_{lo} = 1

and

i_{hi} = n

This routine may be used to generate

Q

explicitly as a square matrix.

Q

has the structure:

Q = (\begin{matrix} I & 0 & 0 \\ 0 & Q_{22} & 0 \\ 0 & 0 & I \end{matrix})

where

Q_{22}

occupies rows and columns

i_{lo}

i_{hi}

4 References

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

5 Arguments

1: $n$ – Integer Input

On entry:

n

, the order of the matrix

Q

Constraint:

n \geq 0

2: $ilo$ – Integer Input

3: $ihi$ – Integer Input

On entry: these must be the same arguments ilo and ihi, respectively, as supplied to f08nsf.

Constraints:

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

4: $a (lda, *)$ – Complex (Kind=nag_wp) array Input/Output

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

\max (1, n)

On entry: details of the vectors which define the elementary reflectors, as returned by f08nsf.

On exit: the

n \times n

unitary matrix

Q

5: $lda$ – Integer Input

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

Constraint:

lda \geq \max (1, n)

6: $tau (*)$ – Complex (Kind=nag_wp) array Input

Note: the dimension of the array tau must be at least

\max (1, n - 1)

On entry: further details of the elementary reflectors, as returned by f08nsf.

7: $work (\max (1, lwork))$ – Complex (Kind=nag_wp) array Workspace

On exit: if

info = 0

, the real part of

work (1)

contains the minimum value of lwork required for optimal performance.

8: $lwork$ – Integer Input

On entry: the dimension of the array work as declared in the (sub)program from which f08ntf is called, unless

lwork = −1

, in which case a workspace query is assumed and the routine only calculates the optimal dimension of work (using the formula given below).

Suggested value: for optimal performance lwork should be at least

(ihi - ilo) \times n b

, where

n b

is the block size.

Constraint:

lwork \geq \max (1, ihi - ilo)

lwork = −1

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

Q

differs from an exactly unitary matrix by a matrix

E

such that

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

where

ε

is the machine precision.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

f08ntf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f08ntf 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

\frac{16}{3} q^{3}

, where

q = i_{hi} - i_{lo}

The real analogue of this routine is f08nff.

10 Example

This example computes the Schur factorization of the matrix

A

, where

A = (\begin{array}{r} - 3.97 - 5.04 i & - 4.11 + 3.70 i & - 0.34 + 1.01 i & 1.29 - 0.86 i \\ 0.34 - 1.50 i & 1.52 - 0.43 i & 1.88 - 5.38 i & 3.36 + 0.65 i \\ 3.31 - 3.85 i & 2.50 + 3.45 i & 0.88 - 1.08 i & 0.64 - 1.48 i \\ - 1.10 + 0.82 i & 1.81 - 1.59 i & 3.25 + 1.33 i & 1.57 - 3.44 i \end{array}) .

Here

A

is general and must first be reduced to Hessenberg form by f08nsf. The program then calls f08ntf to form

Q

, and passes this matrix to f08psf which computes the Schur factorization of

A

f08nt: FL CL CPP AD PY MB

NAG FL Interfacef08ntf (zunghr)

▸▿ 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
f08ntf (zunghr)