Integer, Intent (In)	::	n, ndim, ldx
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	iwk(5*n)
Real (Kind=nag_wp), Intent (In)	::	d(n*(n-1)/2)
Real (Kind=nag_wp), Intent (Inout)	::	x(ldx,ndim)
Real (Kind=nag_wp), Intent (Out)	::	eval(n), wk(n*(n+17)/2-1)
Character (1), Intent (In)	::	roots

C Header Interface

#include <nag.h>

void	g03faf_ (const char roots, const Integer n, const double d[], const Integer ndim, double x[], const Integer ldx, double eval[], double wk[], Integer iwk[], Integer *ifail, const Charlen length_roots)

The routine may be called by the names g03faf or nagf_mv_multidimscal_metric.

3 Description

For a set of

n

objects a distance matrix

D

can be calculated such that

d_{i j}

is a measure of how ‘far apart’ are objects

i

and

j

(see g03eaf for example). Principal coordinate analysis or metric scaling starts with a distance matrix and finds points

X

in Euclidean space such that those points have the same distance matrix. The aim is to find a small number of dimensions,

k ≪ (n - 1)

, that provide an adequate representation of the distances.

The principal coordinates of the points are computed from the eigenvectors of the matrix

E

where

e_{i j} = −1 / 2 (d_{i j}^{2} - d_{i .}^{2} - d_{. j}^{2} + d_{. .}^{2})

with

d_{i .}^{2}

denoting the average of

d_{i j}^{2}

over the suffix

j

, etc.. The eigenvectors are then scaled by multiplying by the square root of the value of the corresponding eigenvalue.

Provided that the ordered eigenvalues,

λ_{i}

, of the matrix

E

are all positive,

\sum_{i = 1}^{k} λ_{i} / \sum_{i = 1}^{n - 1} λ_{i}

shows how well the data is represented in

k

dimensions. The eigenvalues will be non-negative if

E

is positive semidefinite. This will be true provided

d_{i j}

satisfies the inequality:

d_{i j} \leq d_{i k} + d_{j k}

for all

i, j, k

. If this is not the case the size of the negative eigenvalue reflects the amount of deviation from this condition and the results should be treated cautiously in the presence of large negative eigenvalues. See Krzanowski (1990) for further discussion. g03faf provides the option for all eigenvalues to be computed so that the smallest eigenvalues can be checked.

4 References

Chatfield C and Collins A J (1980) Introduction to Multivariate Analysis Chapman and Hall

Gower J C (1966) Some distance properties of latent root and vector methods used in multivariate analysis Biometrika 53 325–338

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

5 Arguments

1: $roots$ – Character(1) Input

On entry: indicates if all the eigenvalues are to be computed or just the ndim largest.

$roots ='A'$: All the eigenvalues are computed.
$roots ='L'$: Only the largest ndim eigenvalues are computed.

Constraint:

roots ='A'

'L'

2: $n$ – Integer Input

On entry:

n

, the number of objects in the distance matrix.

Constraint:

n > ndim

3: $d (n \times (n - 1) / 2)$ – Real (Kind=nag_wp) array Input

On entry: the lower triangle of the distance matrix

D

stored packed by rows. That is

d ((i - 1) \times (i - 2) / 2 + j)

must contain

d_{i j}

for

i = 2, 3, \dots, n; j = 1, 2, \dots, i - 1

Constraint:

d (i) \geq 0.0

, for

i = 1, 2, \dots, n (n - 1) / 2

4: $ndim$ – Integer Input

On entry:

k

, the number of dimensions used to represent the data.

Constraint:

ndim \geq 1

5: $x (ldx, ndim)$ – Real (Kind=nag_wp) array Output

On exit: the

i

th row contains

k

coordinates for the

i

th point,

i = 1, 2, \dots, n

6: $ldx$ – Integer Input

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

Constraint:

ldx \geq n

7: $eval (n)$ – Real (Kind=nag_wp) array Output

On exit: if

roots ='A'

, eval contains the

n

scaled eigenvalues of the matrix

E

roots ='L'

, eval contains the largest

k

scaled eigenvalues of the matrix

E

In both cases the eigenvalues are divided by the sum of the eigenvalues (that is, the trace of

E

8: $wk (n \times (n + 17) / 2 - 1)$ – Real (Kind=nag_wp) array Workspace

9: $iwk (5 \times n)$ – Integer array Workspace

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

On entry, $n = ⟨ value ⟩$ and $ndim = ⟨ value ⟩$ .
Constraint: $n > ndim$ .

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

On entry, $roots = ⟨ value ⟩$ .
Constraint: $roots ='A'$ or $'L'$ .

$ifail = 2$: On entry, all the elements of $d = 0.0$ .

On entry, $i = ⟨ value ⟩$ and $d (i) < 0.0$ .
Constraint: $d (i) \geq 0.0$ .

$ifail = 3$: There are less than ndim eigenvalues greater than zero. Try a smaller number of dimensions or use non-metric scaling.

$ifail = 4$: The computation of the eigenvalues or eigenvectors has failed. Seek expert help.

$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

g03faf uses f08jff or f08jjf to compute the eigenvalues and f08jkf to compute the eigenvectors. These routines should be consulted for a discussion of the accuracy of the computations involved.

8 Parallelism and Performance

g03faf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

g03faf 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

Alternative, non-metric, methods of scaling are provided by g03fcf.

The relationship between principal coordinates and principal components, see g03fcf, is discussed in Krzanowski (1990) and Gower (1966).

10 Example

The data, given by Krzanowski (1990), are dissimilarities between water vole populations in Europe. The first two principal coordinates are computed.

g03fa: FL CL CPP AD

NAG FL Interfaceg03faf (multidimscal_​metric)

▸▿ 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
g03faf (multidimscal_metric)