M01ZCF (PDF version)
M01 Chapter Contents
M01 Chapter Introduction
NAG Library Manual

NAG Library Routine Document


Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.


    1  Purpose
    7  Accuracy

1  Purpose

M01ZCF decomposes a permutation into cycles, as an aid to reordering ranked data.

2  Specification


3  Description

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 M01E reordering routines.) Given a vector IRANK which specifies the ranks of the data (as generated by the M01D routines), 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
5 7 4 2 1 6 3  
is composed of the cycles
1 5 2 7 3 4 6  
and the vector ICYCL generated by M01ZCF contains
-1 5 -2 7 3 4 -6  
In order to rearrange the data according to the specified ranks:
The complete rearrangement can be achieved by the following code:
DO 10 K = M1, M2
J = -I
[swap items I and J]

4  References


5  Parameters

1:     IPERMM2 – INTEGER arrayInput/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 – INTEGERInput
3:     M2 – INTEGERInput
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<M1M2.
4:     ICYCLM2 – INTEGER arrayOutput
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 – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ or ​1. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1​ or ​1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is 0. 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 or -1, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
On entry,M2<1,
Elements M1 to M2 of IPERM contain a value outside the range M1 to M2.
Elements M1 to M2 of IPERM contain a repeated value.
If IFAIL=2 or 3, elements M1 to M2 of IPERM do not contain a permutation of the integers M1 to M2.
An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.8 in the Essential Introduction for further information.
Your licence key may have expired or may not have been installed correctly.
See Section 3.7 in the Essential Introduction for further information.
Dynamic memory allocation failed.
See Section 3.6 in the Essential Introduction for further information.

7  Accuracy

Not applicable.

8  Parallelism and Performance

Not applicable.

9  Further Comments


10  Example

This example reads a matrix of real numbers and rearranges its columns so that the elements of the lth row are in ascending order. To do this, the program first calls M01DJF to rank the elements of the lth 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.

10.1  Program Text

Program Text (m01zcfe.f90)

10.2  Program Data

Program Data (m01zcfe.d)

10.3  Program Results

Program Results (m01zcfe.r)

M01ZCF (PDF version)
M01 Chapter Contents
M01 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2015