Integer, Intent (In)	::	m, n, k1, k2, lda
Real (Kind=nag_wp), Intent (In)	::	s(*)
Complex (Kind=nag_wp), Intent (In)	::	c(*)
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,*)
Character (1), Intent (In)	::	side, pivot, direct

C Header Interface

#include <nag.h>

void	f06tyf_ (const char side, const char pivot, const char direct, const Integer m, const Integer n, const Integer k1, const Integer k2, const Complex c[], const double s[], Complex a[], const Integer lda, const Charlen length_side, const Charlen length_pivot, const Charlen length_direct)

The routine may be called by the names f06tyf or nagf_blas_zgesrs.

3 Description

f06tyf performs the transformation

A \leftarrow P A or A \leftarrow A P^{H},

where

A

is an

m \times n

complex matrix and

P

is a complex unitary matrix, defined as a sequence of complex plane rotations,

P_{k}

, with real sines, applied in planes

k_{1}

k_{2}

The

2 \times 2

plane rotation part of

P_{k}

is assumed to have the form

(\begin{array}{r} {\bar{c}}_{k} & s_{k} \\ - s_{k} & c_{k} \end{array})

with

s_{k}

real.

4 References

None.

5 Arguments

1: $side$ – Character(1) Input

On entry: specifies whether

A

is operated on from the left or the right.

$side ='L'$: $A$ is pre-multiplied from the left.
$side ='R'$: $A$ is post-multiplied from the right.

Constraint:

side ='L'

'R'

2: $pivot$ – Character(1) Input

On entry: specifies the plane rotated by

P_{k}

$pivot ='V'$ (variable pivot): $P_{k}$ rotates the $(k, k + 1)$ plane.
$pivot ='T'$ (top pivot): $P_{k}$ rotates the $(k_{1}, k + 1)$ plane.
$pivot ='B'$ (bottom pivot): $P_{k}$ rotates the $(k, k_{2})$ plane.

Constraint:

pivot ='V'

'T'

'B'

3: $direct$ – Character(1) Input

On entry: specifies the sequence direction.

$direct ='F'$ (forward sequence): $P = P_{k_{2} - 1} \dots P_{k_{1} + 1} P_{k_{1}}$ .
$direct ='B'$ (backward sequence): $P = P_{k_{1}} P_{k_{1} + 1} \dots P_{k_{2} - 1}$ .

Constraint:

direct ='F'

'B'

4: $m$ – Integer Input

On entry:

m

, the number of rows of the matrix

A

Constraint:

m \geq 0

5: $n$ – Integer Input

On entry:

n

, the number of columns of the matrix

A

Constraint:

n \geq 0

6: $k1$ – Integer Input

7: $k2$ – Integer Input

On entry: the values

k_{1}

and

k_{2}

k1 < 1

k2 \leq k1

, or

side ='L'

and

k2 > m

, or

side ='R'

and

k2 > n

, an immediate return is effected.

8: $c (*)$ – Complex (Kind=nag_wp) array Input

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

k2 - 1

On entry:

c (k)

must hold

c_{k}

, the cosine of the rotation

P_{k}

, for

k = k_{1}, \dots, k_{2} - 1

9: $s (*)$ – Real (Kind=nag_wp) array Input

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

k2 - 1

On entry:

s (k)

must hold

s_{k}

, the sine of the rotation

P_{k}

, for

k = k_{1}, \dots, k_{2} - 1

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

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

n

On entry: the

m \times n

matrix

A

On exit: the transformed matrix

A

11: $lda$ – Integer Input

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

Constraint:

lda \geq \max (1, m)

6 Error Indicators and Warnings

None.

7 Accuracy

Not applicable.

8 Parallelism and Performance

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

f06tyf is not threaded in any implementation.

9 Further Comments

None.

10 Example

None.

NAG Library Manual, Mark 28.6

Interfaces: FL CL CPP AD PY MB

NAG FL Interface Introduction

F06 (Blas) Chapter Contents

F06 (Blas) Chapter Introduction

f06ty: FL CL CPP AD PY MB

NAG FL Interfacef06tyf (zgesrs)

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

NAG FL Interface
f06tyf (zgesrs)