Integer, Intent (In)	::	n, m, ldx, ldy, ldr
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (Inout)	::	x(ldx,m), y(ldy,m), yhat(ldy,m), r(ldr,m)
Real (Kind=nag_wp), Intent (Out)	::	alpha, rss, res(n), wk(mm+7m)
Character (1), Intent (In)	::	stand, pscale

C Header Interface

#include <nag.h>

void

g03bcf_ (const char *stand, const char *pscale, const Integer *n, const Integer *m, double x[], const Integer *ldx, double y[], const Integer *ldy, double yhat[], double r[], const Integer *ldr, double *alpha, double *rss, double res[], double wk[], Integer *ifail, const Charlen length_stand, const Charlen length_pscale)

The routine may be called by the names g03bcf or nagf_mv_rot_procrustes.

3 Description

Let

X

and

Y

n \times m

matrices. They can be considered as representing sets of

n

points in an

m

-dimensional space. The

X

matrix may be a matrix of loadings from say factor or canonical variate analysis, and the

Y

matrix may be a postulated pattern matrix or the loadings from a different sample. The problem is to relate the two sets of points without disturbing the relationships between the points in each set. This can be achieved by translating, rotating and scaling the sets of points. The

Y

matrix is considered as the target matrix and the

X

matrix is rotated to match that matrix.

First the two sets of points are translated so that their centroids are at the origin to give

X_{c}

and

Y_{c}

, i.e., the matrices will have zero column means. Then the rotation of the translated

X_{c}

matrix which minimizes the sum of squared distances between corresponding points in the two sets is found. This is computed from the singular value decomposition of the matrix:

X_{c}^{T} Y_{c} = U D V^{T},

where

U

and

V

are orthogonal matrices and

D

is a diagonal matrix. The matrix of rotations,

R

, is computed as:

R = U V^{T} .

After rotation, a scaling or dilation factor,

α

, may be estimated by least squares. Thus, the final set of points that best match

Y_{c}

is given by:

{\hat{Y}}_{c} = α X_{c} R .

Before rotation, both sets of points may be normalized to have unit sums of squares or the

X

matrix may be normalized to have the same sum of squares as the

Y

matrix. After rotation, the results may be translated to the original

Y

centroid.

The

i

th residual,

r_{i}

, is given by the distance between the point given in the

i

th row of

Y

and the point given in the

i

th row of

\hat{Y}

. The residual sum of squares is also computed.

4 References

Krzanowski W J (1990) Principles of Multivariate Analysis Oxford University Press

Lawley D N and Maxwell A E (1971) Factor Analysis as a Statistical Method (2nd Edition) Butterworths

5 Arguments

1: $stand$ – Character(1) Input

On entry: indicates if translation/normalization is required.

$stand ='N'$: There is no translation or normalization.
$stand ='Z'$: There is translation to the origin (i.e., to zero).
$stand ='C'$: There is translation to origin and then to the $Y$ centroid after rotation.
$stand ='U'$: There is unit normalization.
$stand ='S'$: There is translation and normalization (i.e., there is standardization).
$stand ='M'$: There is translation and normalization to $Y$ scale, then translation to the $Y$ centroid after rotation (i.e., they are matched).

Constraint:

stand ='N'

'Z'

'C'

'U'

'S'

'M'

2: $pscale$ – Character(1) Input

On entry: indicates if least squares scaling is to be applied after rotation.

$pscale ='S'$: Scaling is applied.
$pscale ='U'$: No scaling is applied.

Constraint:

pscale ='S'

'U'

3: $n$ – Integer Input

On entry:

n

, the number of points.

Constraint:

n \geq m

4: $m$ – Integer Input

On entry:

m

, the number of dimensions.

Constraint:

m \geq 1

5: $x (ldx, m)$ – Real (Kind=nag_wp) array Input/Output

On entry:

X

, the matrix to be rotated.

On exit: if

stand ='N'

, x will be unchanged.

stand ='Z'

'C'

'S'

'M'

, x will be translated to have zero column means.

stand ='U'

'S'

, x will be scaled to have unit sum of squares.

stand ='M'

, x will be scaled to have the same sum of squares as y.

6: $ldx$ – Integer Input

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

Constraint:

ldx \geq n

7: $y (ldy, m)$ – Real (Kind=nag_wp) array Input/Output

On entry: the target matrix,

y

On exit: if

stand ='N'

, y will be unchanged.

stand ='Z'

'S'

, y will be translated to have zero column means.

stand ='U'

'S'

, y will be scaled to have unit sum of squares.

stand ='C'

'M'

, y will be translated and then after rotation translated back. The output y should be the same as the input y except for rounding errors.

8: $ldy$ – Integer Input

On entry: the first dimension of the arrays y and yhat as declared in the (sub)program from which g03bcf is called.

Constraint:

ldy \geq n

9: $yhat (ldy, m)$ – Real (Kind=nag_wp) array Output

On exit: the fitted matrix,

\hat{Y}

10: $r (ldr, m)$ – Real (Kind=nag_wp) array Output

On exit: the matrix of rotations,

R

, see Section 9.

11: $ldr$ – Integer Input

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

Constraint:

ldr \geq m

12: $alpha$ – Real (Kind=nag_wp) Output

On exit: if

pscale ='S'

the scaling factor,

α

; otherwise alpha is not set.

13: $rss$ – Real (Kind=nag_wp) Output

On exit: the residual sum of squares.

14: $res (n)$ – Real (Kind=nag_wp) array Output

On exit: the residuals,

r_{i}

, for

i = 1, 2, \dots, n

15: $wk (m \times m + 7 \times m)$ – Real (Kind=nag_wp) array Workspace

16: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

−1

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

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, $ldr = ⟨ value ⟩$ and $m = ⟨ value ⟩$ .
Constraint: $ldr \geq m$ .

On entry, $ldx = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $ldx \geq n$ .

On entry, $ldy = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $ldy \geq n$ .

On entry, $m = ⟨ value ⟩$ .
Constraint: $m > 0$ .

On entry, $n = ⟨ value ⟩$ and $m = ⟨ value ⟩$ .
Constraint: $n \geq m$ .

On entry, $pscale = ⟨ value ⟩$ .
Constraint: $pscale ='S'$ or $'U'$ .

On entry, $stand = ⟨ value ⟩$ .
Constraint: $stand ='N'$ , $'Z'$ , $'C'$ , $'U'$ , $'S'$ or $'M'$ .

$ifail = 2$: Only one distinct point (centred at zero) in x array.

Only one distinct point (centred at zero) in y array.

$ifail = 3$: yhat contains only zero-points when least squares scaling is applied.

$ifail = 4$: The singular value decomposition has failed to converge. This is an unlikely error exit.

$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

The accuracy of the calculation of the rotation matrix largely depends upon the singular value decomposition. See the F08 Chapter Introduction for further details.

8 Parallelism and Performance

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

9 Further Comments

Note that if the matrix

X_{c}^{T} Y

is not of full rank, then the matrix of rotations,

R

, may not be unique even if there is a unique solution in terms of the rotated matrix,

{\hat{Y}}_{c}

. The matrix

R

may also include reflections as well as pure rotations, see Krzanowski (1990).

If the column dimensions of the

X

and

Y

matrices are not equal, the smaller of the two should be supplemented by columns of zeros. Adding a column of zeros to both

X

and

Y

will have the effect of allowing reflections as well as rotations.

10 Example

Three points representing the vertices of a triangle in two dimensions are input. The points are translated and rotated to match the triangle given by

(0, 0)

(1, 0)

(0, 2)

and scaling is applied after rotation. The target matrix and fitted matrix are printed along with additional information.

g03bc: FL CL CPP AD

NAG FL Interfaceg03bcf (rot_​procrustes)

▸▿ 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
g03bcf (rot_procrustes)