Integer, Intent (In)	::	n, k1, k2, lda
Real (Kind=nag_wp), Intent (Out)	::	c(k2-1)
Complex (Kind=nag_wp), Intent (Inout)	::	s(), a(lda,)
Character (1), Intent (In)	::	side

C Header Interface

#include <nag.h>

void	f06tsf_ (const char side, const Integer n, const Integer k1, const Integer k2, double c[], Complex s[], Complex a[], const Integer *lda, const Charlen length_side)

The routine may be called by the names f06tsf or nagf_blas_zusqr.

3 Description

f06tsf transforms an

n

n

complex upper spiked matrix

H

to upper triangular form

R

by applying a complex unitary matrix

P

from the left or the right.

H

is assumed to have real diagonal elements except where the spike joins the diagonal;

R

has real diagonal elements.

P

is formed as a sequence of plane rotations in planes

k_{1}

k_{2}

side ='L'

H

is assumed to have a row spike, with nonzero elements

h_{k_{2}, k}

, for

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

. The rotations are applied from the left:

P H = R,

where

P = D P_{k_{2} - 1} \dots P_{k_{1} + 1} P_{k_{1}}

P_{k}

is a rotation in the

(k, k_{2})

plane and

D = diag (1, \dots, 1, d_{k_{2}}, 1, \dots, 1)

with

|d_{k_{2}}| = 1

side ='R'

H

is assumed to have a column spike, with nonzero elements

h_{k + 1, k_{1}}

, for

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

. The rotations are applied from the right:

H P^{H} = R,

where

P = D P_{k_{1}} P_{k_{1} + 1} \dots P_{k_{2} - 1}

P_{k}

is a rotation in the

(k_{1}, k + 1)

plane and

D = diag (1, \dots, 1, d_{k_{1}}, 1, \dots, 1)

with

|d_{k_{1}}| = 1

The

2

2

plane rotation part of

P_{k}

has the form

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

with

c_{k}

real.

4 References

None.

5 Arguments

1: $side$ – Character(1) Input

On entry: specifies whether

H

is operated on from the left or the right.

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

Constraint:

side ='L'

'R'

2: $n$ – Integer Input

On entry:

n

, the order of the matrix

H

Constraint:

n \geq 0

3: $k1$ – Integer Input

4: $k2$ – Integer Input

On entry: the values

k_{1}

and

k_{2}

k1 < 1

k2 \leq k1

k2 > n

, an immediate return is effected.

5: $c (k2 - 1)$ – Real (Kind=nag_wp) array Output

On exit:

c (k)

holds

c_{k}

, the cosine of the rotation

P_{k}

, for

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

6: $s (*)$ – Complex (Kind=nag_wp) array Input/Output

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

k2

On entry: the nonzero elements of the spike of

H

s (k)

must hold

h_{k_{2}, k}

side ='L'

, and

h_{k + 1, k_{1}}

side ='R'

, for

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

On exit:

s (k)

holds

s_{k}

, the sine of the rotation

P_{k}

, for

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

;

s (k_{2})

holds

d_{k_{2}}

, the

k_{2}

th diagonal element of

D

, if

side ='L'

, or

d_{k_{1}}

, the

k_{1}

th diagonal element of

D

, if

side ='R'

7: $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 upper triangular part of the

n

n

upper spiked matrix

H

. The imaginary parts of the diagonal elements must be zero, except for the

(k_{2}, k_{2})

element if

side ='L'

, or the

(k_{1}, k_{1})

element if

side ='R'

On exit: the upper triangular matrix

R

. The imaginary parts of the diagonal elements are set to zero.

8: $lda$ – Integer Input

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

Constraint:

lda \geq \max (1, n)

6 Error Indicators and Warnings

None.

7 Accuracy

Not applicable.

8 Parallelism and Performance

f06tsf 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.