Integer, Intent (In)	::	m, n, k, 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))
Character (1), Intent (In)	::	vect

C Header Interface

#include <nag.h>

void	f08ktf_ (const char vect, const Integer m, const Integer n, const Integer k, Complex a[], const Integer lda, const Complex tau[], Complex work[], const Integer lwork, Integer *info, const Charlen length_vect)

The routine may be called by the names f08ktf, nagf_lapackeig_zungbr or its LAPACK name zungbr.

3 Description

f08ktf is intended to be used after a call to f08ksf, which reduces a complex rectangular matrix

A

to real bidiagonal form

B

by a unitary transformation:

A = Q B P^{H}

. f08ksf represents the matrices

Q

and

P^{H}

as products of elementary reflectors.

This routine may be used to generate

Q

P^{H}

explicitly as square matrices, or in some cases just the leading columns of

Q

or the leading rows of

P^{H}

The various possibilities are specified by the arguments vect, m, n and k. The appropriate values to cover the most likely cases are as follows (assuming that

A

was an

m \times n

matrix):

1.To form the full $m \times m$ matrix $Q$ :
```
Call zungbr('Q',m,m,n,...)
```
(note that the array a must have at least $m$ columns).
2.If $m > n$ , to form the $n$ leading columns of $Q$ :
```
Call zungbr('Q',m,n,n,...)
```
3.To form the full $n \times n$ matrix $P^{H}$ :
```
Call zungbr('P',n,n,m,...)
```
(note that the array a must have at least $n$ rows).
4.If $m < n$ , to form the $m$ leading rows of $P^{H}$ :
```
Call zungbr('P',m,n,m,...)
```

4 References

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

5 Arguments

1: $vect$ – Character(1) Input

On entry: indicates whether the unitary matrix

Q

P^{H}

is generated.

$vect ='Q'$: $Q$ is generated.
$vect ='P'$: $P^{H}$ is generated.

Constraint:

vect ='Q'

'P'

2: $m$ – Integer Input

On entry:

m

, the number of rows of the unitary matrix

Q

P^{H}

to be returned.

Constraint:

m \geq 0

3: $n$ – Integer Input

On entry:

n

, the number of columns of the unitary matrix

Q

P^{H}

to be returned.

Constraints:

$n \geq 0$ ;
if $vect ='Q'$ and $m > k$ , $m \geq n \geq k$ ;
if $vect ='Q'$ and $m \leq k$ , $m = n$ ;
if $vect ='P'$ and $n > k$ , $n \geq m \geq k$ ;
if $vect ='P'$ and $n \leq k$ , $n = m$ .

4: $k$ – Integer Input

On entry: if

vect ='Q'

, the number of columns in the original matrix

A

vect ='P'

, the number of rows in the original matrix

A

Constraint:

k \geq 0

5: $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 f08ksf.

On exit: the unitary matrix

Q

P^{H}

, or the leading rows or columns thereof, as specified by vect, m and n.

6: $lda$ – Integer Input

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

Constraint:

lda \geq \max (1, m)

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

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

\max (1, \min (m, k))

vect ='Q'

and at least

\max (1, \min (n, k))

vect ='P'

On entry: further details of the elementary reflectors, as returned by f08ksf in its argument tauq if

vect ='Q'

, or in its argument taup if

vect ='P'

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

9: $lwork$ – Integer Input

On entry: the dimension of the array work as declared in the (sub)program from which f08ktf 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 \geq \min (m, n) \times nb

, where

nb

is the optimal block size.

Constraint:

lwork \geq \max (1, \min (m, n))

lwork = - 1

10: $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. A similar statement holds for the computed matrix

P^{H}

8 Parallelism and Performance

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

f08ktf 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 for the cases listed in Section 3 are approximately as follows:

1.To form the whole of $Q$ :
- $\frac{16}{3} n (3 m^{2} - 3 m n + n^{2})$ if $m > n$ ,
- $\frac{16}{3} m^{3}$ if $m \leq n$ ;
2.To form the $n$ leading columns of $Q$ when $m > n$ :
- $\frac{8}{3} n^{2} (3 m - n)$ ;
3.To form the whole of $P^{H}$ :
- $\frac{16}{3} n^{3}$ if $m \geq n$ ,
- $\frac{16}{3} m^{3} (3 n^{2} - 3 m n + m^{2})$ if $m < n$ ;
4.To form the $m$ leading rows of $P^{H}$ when $m < n$ :
- $\frac{8}{3} m^{2} (3 n - m)$ .

The real analogue of this routine is f08kff.

10 Example

For this routine two examples are presented, both of which involve computing the singular value decomposition of a matrix

A

, where

A = (\begin{array}{r} 0.96 - 0.81 i & - 0.03 + 0.96 i & - 0.91 + 2.06 i & - 0.05 + 0.41 i \\ - 0.98 + 1.98 i & - 1.20 + 0.19 i & - 0.66 + 0.42 i & - 0.81 + 0.56 i \\ 0.62 - 0.46 i & 1.01 + 0.02 i & 0.63 - 0.17 i & - 1.11 + 0.60 i \\ - 0.37 + 0.38 i & 0.19 - 0.54 i & - 0.98 - 0.36 i & 0.22 - 0.20 i \\ 0.83 + 0.51 i & 0.20 + 0.01 i & - 0.17 - 0.46 i & 1.47 + 1.59 i \\ 1.08 - 0.28 i & 0.20 - 0.12 i & - 0.07 + 1.23 i & 0.26 + 0.26 i \end{array})

in the first example and

A = (\begin{array}{r} 0.28 - 0.36 i & 0.50 - 0.86 i & - 0.77 - 0.48 i & 1.58 + 0.66 i \\ - 0.50 - 1.10 i & - 1.21 + 0.76 i & - 0.32 - 0.24 i & - 0.27 - 1.15 i \\ 0.36 - 0.51 i & - 0.07 + 1.33 i & - 0.75 + 0.47 i & - 0.08 + 1.01 i \end{array})

in the second.

A

must first be reduced to tridiagonal form by f08ksf. The program then calls f08ktf twice to form

Q

and

P^{H}

, and passes these matrices to f08msf, which computes the singular value decomposition of

A

f08kt: FL CL CPP AD

NAG FL Interfacef08ktf (zungbr)

▸▿ 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
f08ktf (zungbr)