m01zcf is provided as an aid to reordering arbitrary data structures without using additional storage. However, you should consider carefully whether it is necessary to rearrange yourr data, or whether it would be simpler and more efficient to refer to the data in sorted order using an index vector, or to create a copy of the data in sorted order.

To rearrange data into a different order without using additional storage, the simplest method is to decompose the permutation which specifies the new order into cycles and then to do a cyclic permutation of the data items in each cycle. (This is the method used by the reordering routines m01eaf, m01ebf, m01ecf and m01edf.) Given a vector IRANK which specifies the ranks of the data (as generated by the routines m01daf, m01dbf, m01dcf, m01def, m01dff, m01djf, m01dkf and m01dzf), m01zcf generates a new vector icycl, in which the permutation is represented in its component cycles, with the first element of each cycle negated. For example, the permutation

\begin{matrix} \begin{matrix} 5 & 7 \end{matrix} & \begin{matrix} 4 & 2 & 1 & 6 \end{matrix} & \begin{matrix} 3 \end{matrix} \end{matrix}

is composed of the cycles

\begin{matrix} (\begin{matrix} 1 & 5 \end{matrix}) & (\begin{matrix} 2 & 7 & 3 & 4 \end{matrix}) & (\begin{matrix} 6 \end{matrix}) \end{matrix}

and the vector icycl generated by m01zcf contains

\begin{matrix} −1 & 5 & −2 & 7 & 3 & 4 & −6 \end{matrix}

In order to rearrange the data according to the specified ranks:

item $6$ must be left in place;
items $1$ and $5$ must be interchanged;
items $4$ , $2$ , $7$ and $3$ must be moved right one place round the cycle.

The complete rearrangement can be achieved by the following code:

do k = m1, m2
  i = icycl(k)
  if (i < 0) then
    j = -i
  else
    [swap items i and j]
  end if
end do

4 References

None.

5 Arguments

1: $iperm (m2)$ – Integer array Input/Output: On entry: elements $m1$ to $m2$ of iperm must contain a permutation of the integers m1 to m2.

On exit: is used as internal workpsace prior to being restored and hence is unchanged.
2: $m1$ – Integer Input
3: $m2$ – Integer Input: On entry: m1 and m2 must specify the range of elements used in the array iperm and the range of values in the permutation, as specified under iperm.

Constraint: $0 < m1 \leq m2$ .
4: $icycl (m2)$ – Integer array Output: On exit: elements $m1$ to $m2$ of icycl contain a representation of the permutation as a list of cycles, with the first integer in each cycle negated. (See Section 3.)
5: $ifail$ – Integer Input/Output: On entry: ifail must be set to $0$ , $−1$ or $1$ to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of $0$ causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of $−1$ means that an error message is printed while a value of $1$ means that it is not.

If halting is not appropriate, the value $−1$ or $1$ is recommended. If message printing is undesirable, then the value $1$ is recommended. Otherwise, the value $0$ is recommended. When the value $- 1$ or $1$ is used it is essential to test the value of ifail on exit.

On exit: $ifail = 0$ unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry

ifail = 0

−1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $m1 = ⟨ value ⟩$ .
Constraint: $m1 \geq 1$ .

On entry, $m1 = ⟨ value ⟩$ and $m2 = ⟨ value ⟩$ .
Constraint: $m1 \leq m2$ .

On entry, $m2 = ⟨ value ⟩$ .
Constraint: $m2 \geq 1$ .

$ifail = 2$: $iperm (m1 : m2)$ does not contain a permutation of the integers m1 to m2. $iperm (I)$ contains an out-of-range value: $I = ⟨ value ⟩$ , $iperm (I) = ⟨ value ⟩$ .

$ifail = 3$: $iperm (m1 : m2)$ does not contain a permutation of the integers m1 to m2. iperm contains a repeated value: $⟨ value ⟩$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

Not applicable.

8 Parallelism and Performance

m01zcf is not threaded in any implementation.

9 Further Comments

None.

10 Example

This example reads a matrix of real numbers and rearranges its columns so that the elements of the

l

th row are in ascending order. To do this, the program first calls m01djf to rank the elements of the

l

th row, and then calls m01zcf to decompose the rank vector into cycles. It then rearranges the columns using the framework of code suggested in Section 3. The value of

l

is read from the data file.

m01zc: FL CL CPP AD

NAG FL Interfacem01zcf (permute_​decompose)

▸▿ 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
m01zcf (permute_decompose)