# NAG FL Interfaceg02brf (coeffs_​kspearman_​miss_​case)

## ▸▿ Contents

Settings help

FL Name Style:

FL Specification Language:

## 1Purpose

g02brf computes Kendall and/or Spearman nonparametric rank correlation coefficients for a set of data, omitting completely any cases with a missing observation for any variable; the data array is preserved, and the ranks of the observations are not available on exit from the routine.

## 2Specification

Fortran Interface
 Subroutine g02brf ( n, m, x, ldx, miss, rr, ldrr,
 Integer, Intent (In) :: n, m, ldx, itype, ldrr Integer, Intent (Inout) :: miss(m), ifail Integer, Intent (Out) :: ncases, incase(n), kworka(n), kworkb(n), kworkc(n) Real (Kind=nag_wp), Intent (In) :: x(ldx,m) Real (Kind=nag_wp), Intent (Inout) :: xmiss(m), rr(ldrr,m) Real (Kind=nag_wp), Intent (Out) :: work1(n), work2(n)
#include <nag.h>
 void g02brf_ (const Integer *n, const Integer *m, const double x[], const Integer *ldx, Integer miss[], double xmiss[], const Integer *itype, double rr[], const Integer *ldrr, Integer *ncases, Integer incase[], Integer kworka[], Integer kworkb[], Integer kworkc[], double work1[], double work2[], Integer *ifail)
The routine may be called by the names g02brf or nagf_correg_coeffs_kspearman_miss_case.

## 3Description

The input data consists of $n$ observations for each of $m$ variables, given as an array
 $[xij] , i=1,2,…,n (n≥2) , j=1,2,…,m (m≥2) ,$
where ${x}_{ij}$ is the $i$th observation on the $j$th variable. In addition, each of the $m$ variables may optionally have associated with it a value which is to be considered as representing a missing observation for that variable; the missing value for the $j$th variable is denoted by ${\mathit{xm}}_{j}$. Missing values need not be specified for all variables.
Let ${w}_{i}=0$ if observation $i$ contains a missing value for any of those variables for which missing values have been declared, i.e., if ${x}_{ij}={\mathit{xm}}_{j}$ for any $j$ for which an ${\mathit{xm}}_{j}$ has been assigned (see also Section 7); and ${w}_{i}=1$ otherwise, for $\mathit{i}=1,2,\dots ,n$.
The observations are first ranked as follows.
For a given variable, $j$ say, each of the observations ${x}_{ij}$ for which ${w}_{i}=1$, ($i=1,2,\dots ,n$) has associated with it an additional number, the ‘rank’ of the observation, which indicates the magnitude of that observation relative to the magnitudes of the other observations on that same variable for which ${w}_{i}=1$.
The smallest of these valid observations for variable $j$ is assigned the rank $1$, the second smallest observation for variable $j$ the rank $2$, the third smallest the rank $3$, and so on until the largest such observation is given the rank ${n}_{c}$, where ${n}_{c}=\sum _{i=1}^{n}{w}_{i}$.
If a number of cases all have the same value for the given variable, $j$, then they are each given an ‘average’ rank, e.g., if in attempting to assign the rank $h+1$, $k$ observations for which ${w}_{i}=1$ were found to have the same value, then instead of giving them the ranks
 $h+1, h+2, …, h+k ,$
all $k$ observations would be assigned the rank
 $2h+k+1 2$
and the next value in ascending order would be assigned the rank
 $h+k+ 1 .$
The process is repeated for each of the $m$ variables.
Let ${y}_{ij}$ be the rank assigned to the observation ${x}_{ij}$ when the $j$th variable is being ranked. For those observations, $i$, for which ${w}_{i}=0$, ${y}_{ij}=0$, for $j=1,2,\dots ,m$.
The quantities calculated are:
1. (a)Kendall's tau rank correlation coefficients:
 $Rjk = ∑ h=1 n ∑ i=1 n wh wi sign(yhj-yij) sign(yhk-yik) [nc(nc-1)-Tj][nc(nc-1)-Tk] , j,k=1,2,…,m ,$
 where ${n}_{c}=\sum _{i=1}^{n}{w}_{i}$ and $\mathrm{sign}u=1$ if $u>0$ $\mathrm{sign}u=0$ if $u=0$ $\mathrm{sign}u=-1$ if $u<0$
and ${T}_{j}=\sum {t}_{j}\left({t}_{j}-1\right)$ where ${t}_{j}$ is the number of ties of a particular value of variable $j$, and the summation is over all tied values of variable $j$.
2. (b)Spearman's rank correlation coefficients:
 $Rjk*=nc(nc2-1)-6∑i=1nwi (yij-yik) 2-12(Tj*+Tk*) [nc(nc2-1)-Tj*][nc(nc2-1)-Tk*] , j,k=1,2,…,m,$
where ${n}_{c}=\sum _{i=1}^{n}{w}_{i}$ and ${T}_{j}^{*}=\sum {t}_{j}\left({t}_{j}^{2}-1\right)$ where ${t}_{j}$ is the number of ties of a particular value of variable $j$, and the summation is over all tied values of variable $j$.

## 4References

Siegel S (1956) Non-parametric Statistics for the Behavioral Sciences McGraw–Hill

## 5Arguments

1: $\mathbf{n}$Integer Input
On entry: $n$, the number of observations or cases.
Constraint: ${\mathbf{n}}\ge 2$.
2: $\mathbf{m}$Integer Input
On entry: $m$, the number of variables.
Constraint: ${\mathbf{m}}\ge 2$.
3: $\mathbf{x}\left({\mathbf{ldx}},{\mathbf{m}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{x}}\left(i,j\right)$ must be set to ${x}_{ij}$, the value of the $i$th observation on the $j$th variable, where $i=1,2,\dots ,n$ and $j=1,2,\dots ,m\text{.}$
4: $\mathbf{ldx}$Integer Input
On entry: the first dimension of the array x as declared in the (sub)program from which g02brf is called.
Constraint: ${\mathbf{ldx}}\ge {\mathbf{n}}$.
5: $\mathbf{miss}\left({\mathbf{m}}\right)$Integer array Input/Output
On entry: ${\mathbf{miss}}\left(j\right)$ must be set equal to $1$ if a missing value, $x{m}_{j}$, is to be specified for the $j$th variable in the array x, or set equal to $0$ otherwise. Values of miss must be given for all $m$ variables in the array x.
On exit: the array miss is overwritten by the routine, and the information it contained on entry is lost.
6: $\mathbf{xmiss}\left({\mathbf{m}}\right)$Real (Kind=nag_wp) array Input/Output
On entry: ${\mathbf{xmiss}}\left(j\right)$ must be set to the missing value, $x{m}_{j}$, to be associated with the $j$th variable in the array x, for those variables for which missing values are specified by means of the array miss (see Section 7).
On exit: the array xmiss is overwritten by the routine, and the information it contained on entry is lost.
7: $\mathbf{itype}$Integer Input
On entry: the type of correlation coefficients which are to be calculated.
${\mathbf{itype}}=-1$
Only Kendall's tau coefficients are calculated.
${\mathbf{itype}}=0$
Both Kendall's tau and Spearman's coefficients are calculated.
${\mathbf{itype}}=1$
Only Spearman's coefficients are calculated.
Constraint: ${\mathbf{itype}}=-1$, $0$ or $1$.
8: $\mathbf{rr}\left({\mathbf{ldrr}},{\mathbf{m}}\right)$Real (Kind=nag_wp) array Output
On exit: the requested correlation coefficients.
If only Kendall's tau coefficients are requested (${\mathbf{itype}}=-1$), ${\mathbf{rr}}\left(j,k\right)$ contains Kendall's tau for the $j$th and $k$th variables.
If only Spearman's coefficients are requested (${\mathbf{itype}}=1$), ${\mathbf{rr}}\left(j,k\right)$ contains Spearman's rank correlation coefficient for the $j$th and $k$th variables.
If both Kendall's tau and Spearman's coefficients are requested (${\mathbf{itype}}=0$), the upper triangle of rr contains the Spearman coefficients and the lower triangle the Kendall coefficients. That is, for the $\mathit{j}$th and $\mathit{k}$th variables, where $\mathit{j}$ is less than $\mathit{k}$, ${\mathbf{rr}}\left(\mathit{j},\mathit{k}\right)$ contains the Spearman rank correlation coefficient, and ${\mathbf{rr}}\left(\mathit{k},\mathit{j}\right)$ contains Kendall's tau, for $\mathit{j}=1,2,\dots ,m$ and $\mathit{k}=1,2,\dots ,m$.
(Diagonal terms, ${\mathbf{rr}}\left(j,j\right)$, are unity for all three values of itype.)
9: $\mathbf{ldrr}$Integer Input
On entry: the first dimension of the array rr as declared in the (sub)program from which g02brf is called.
Constraint: ${\mathbf{ldrr}}\ge {\mathbf{m}}$.
10: $\mathbf{ncases}$Integer Output
On exit: the number of cases, ${n}_{\mathrm{c}}$, actually used in the calculations (when cases involving missing values have been eliminated).
11: $\mathbf{incase}\left({\mathbf{n}}\right)$Integer array Output
On exit: ${\mathbf{incase}}\left(\mathit{i}\right)$ holds the value $1$ if the $\mathit{i}$th case was included in the calculations, and the value $0$ if the $\mathit{i}$th case contained a missing value for at least one variable. That is, ${\mathbf{incase}}\left(\mathit{i}\right)={w}_{\mathit{i}}$ (see Section 3), for $\mathit{i}=1,2,\dots ,n$.
12: $\mathbf{kworka}\left({\mathbf{n}}\right)$Integer array Workspace
13: $\mathbf{kworkb}\left({\mathbf{n}}\right)$Integer array Workspace
14: $\mathbf{kworkc}\left({\mathbf{n}}\right)$Integer array Workspace
15: $\mathbf{work1}\left({\mathbf{n}}\right)$Real (Kind=nag_wp) array Workspace
16: $\mathbf{work2}\left({\mathbf{n}}\right)$Real (Kind=nag_wp) array Workspace
17: $\mathbf{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 $-\mathbf{1}$ or $\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit: ${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6Error Indicators and Warnings

If on entry ${\mathbf{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:
${\mathbf{ifail}}=1$
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 2$.
${\mathbf{ifail}}=2$
On entry, ${\mathbf{m}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{m}}\ge 2$.
${\mathbf{ifail}}=3$
On entry, ${\mathbf{ldrr}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{m}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{ldrr}}\ge {\mathbf{m}}$.
On entry, ${\mathbf{ldx}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{ldx}}\ge {\mathbf{n}}$.
${\mathbf{ifail}}=4$
On entry, ${\mathbf{itype}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{itype}}=-1$ or $1$.
${\mathbf{ifail}}=5$
After observations with missing values were omitted, fewer than two cases remained.
${\mathbf{ifail}}=-99$
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{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.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

## 7Accuracy

You are warned of the need to exercise extreme care in your selection of missing values. g02brf treats all values in the inclusive range $\left(1±{0.1}^{\left({\mathbf{x02bef}}-2\right)}\right)×{xm}_{j}$, where ${\mathit{xm}}_{j}$ is the missing value for variable $j$ specified in xmiss.
You must, therefore, ensure that the missing value chosen for each variable is sufficiently different from all valid values for that variable so that none of the valid values fall within the range indicated above.

## 8Parallelism and Performance

g02brf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
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.

The time taken by g02brf depends on $n$ and $m$, and the occurrence of missing values.

## 10Example

This example reads in a set of data consisting of nine observations on each of three variables. Missing values of $0.99$ and $0.0$ are declared for the first and third variables respectively; no missing value is specified for the second variable. The program then calculates and prints both Kendall's tau and Spearman's rank correlation coefficients for all three variables, omitting completely all cases containing missing values; cases $5$, $8$ and $9$ are, therefore, eliminated, leaving only six cases in the calculations.

### 10.1Program Text

Program Text (g02brfe.f90)

### 10.2Program Data

Program Data (g02brfe.d)

### 10.3Program Results

Program Results (g02brfe.r)