f06qjf (dgeap) : NAG Library, Mark 27

void	f06qjf_ (const char side, const char trans, const Integer n, const Integer perm[], const Integer k, double b[], const Integer *ldb, const Charlen length_side, const Charlen length_trans)

C++ Header Interface

#include <nag.h>

extern "C" {

void	f06qjf_ (const char side, const char trans, const Integer &n, const Integer perm[], const Integer &k, double b[], const Integer &ldb, const Charlen length_side, const Charlen length_trans)

}

3 Description

f06qjf performs one of the permutation operations

\begin{array}{l} B \leftarrow P^{T} B, & B \leftarrow P B, \\ B \leftarrow B P^{T} or & B \leftarrow B P, \end{array}

where

B

is a real matrix, and

P

is a permutation matrix.

P

is represented in the form

P = P_{1, p_{1}} P_{2, p_{2}} \dots P_{n, p_{n}},

where

P_{i, j}

is the permutation matrix that interchanges items

i

and

j

; that is,

P_{i, j}

is the unit matrix with rows and columns

i

and

j

interchanged. If

i = j

P_{i, j} = I

Let

m

denote the number of rows of

B

side ='L'

, or the number of columns of

B

side ='R'

: the routine does not require

m

to be passed as an argument, but assumes that

m \geq p_{i}

, for

i = 1, 2, \dots, n

This routine requires the indices

p_{i}

to be supplied in an integer array; f06qkf performs the same operation with the indices supplied in a real array.

5 Arguments

side

– Character(1) Input

trans

– Character(1) Input

On entry: specifies the operation to be performed.

$side ='L'$ and $trans ='T'$: $B \leftarrow P^{T} B$ .
$side ='L'$ and $trans ='N'$: $B \leftarrow P B$ .
$side ='R'$ and $trans ='T'$: $B \leftarrow B P^{T}$ .
$side ='R'$ and $trans ='N'$: $B \leftarrow B P$ .

Constraints:

$side ='L'$ or $'R'$ ;
$trans ='N'$ or $'T'$ .

n

– Integer Input

On entry:

n

, the number of interchanges in the representation of

P

Constraint:

n \geq 0

perm (*)

– Integer array Input

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

\max (1, n)

On entry: the

n

indices

p_{i}

which define the interchanges in the representation of

P

. It is usual to have

p_{i} \geq i

, but this is not necessary.

Constraint:

1 \leq perm (i) \leq m

, where

m = \max_{k} {perm (k)}

k

– Integer Input

On entry:

k

, the number of columns of

B

side ='L'

, or the number of rows of

B

side ='R'

Constraint:

k \geq 0

b (ldb, *)

– Real (Kind=nag_wp) array Input/Output

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

\max (1, k)

side ='L'

and at least

\max (n, \max_{k} {perm (k)})

side ='R'

On entry: the original matrix

B

;

B

m \times k

, where

m = \max_{k} {perm (k)}

side ='L'

, or

k \times m

, where

m = \max_{k} {perm (k)}

side ='R'

On exit: the permuted matrix

B

ldb

– Integer Input

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

Constraints:

if $side ='L'$ , $ldb \geq \max (n, m)$ ;
if $side ='R'$ , $ldb \geq \max (1, k)$ .

NAG FL Interface
f06qjf (dgeap)

▸▿ 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 Interfacef06qjf (dgeap)

▸▿ 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
f06qjf (dgeap)