G08RBF (PDF version)
G08 Chapter Contents
G08 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentG08RBF

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

G08RBF calculates the parameter estimates, score statistics and their variance-covariance matrices for the linear model using a likelihood based on the ranks of the observations when some of the observations may be right-censored.

## 2  Specification

 SUBROUTINE G08RBF ( NS, NV, NSUM, Y, IP, X, LDX, ICEN, GAMMA, NMAX, TOL, PRVR, LDPRVR, IRANK, ZIN, ETA, VAPVEC, PAREST, WORK, LWORK, IWA, IFAIL)
 INTEGER NS, NV(NS), NSUM, IP, LDX, ICEN(NSUM), NMAX, LDPRVR, IRANK(NMAX), LWORK, IWA(4*NMAX), IFAIL REAL (KIND=nag_wp) Y(NSUM), X(LDX,IP), GAMMA, TOL, PRVR(LDPRVR,IP), ZIN(NMAX), ETA(NMAX), VAPVEC(NMAX*(NMAX+1)/2), PAREST(4*IP+1), WORK(LWORK)

## 3  Description

Analysis of data can be made by replacing observations by their ranks. The analysis produces inference for the regression model where the location parameters of the observations, ${\theta }_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$, are related by $\theta =X\beta$. Here $X$ is an $n$ by $p$ matrix of explanatory variables and $\beta$ is a vector of $p$ unknown regression parameters. The observations are replaced by their ranks and an approximation, based on Taylor's series expansion, made to the rank marginal likelihood. For details of the approximation see Pettitt (1982).
An observation is said to be right-censored if we can only observe ${Y}_{j}^{*}$ with ${Y}_{j}^{*}\le {Y}_{j}$. We rank censored and uncensored observations as follows. Suppose we can observe ${Y}_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,n$, directly but ${Y}_{j}^{*}$, for $\mathit{j}=n+1,\dots ,q$ and $n\le q$, are censored on the right. We define the rank ${r}_{j}$ of ${Y}_{j}$, for $j=1,2,\dots ,n$, in the usual way; ${r}_{j}$ equals $i$ if and only if ${Y}_{j}$ is the $i$th smallest amongst the ${Y}_{1},{Y}_{2},\dots ,{Y}_{n}$. The right-censored ${Y}_{j}^{*}$, for $j=n+1,n+2,\dots ,q$, has rank ${r}_{j}$ if and only if ${Y}_{j}^{*}$ lies in the interval $\left[{Y}_{\left({r}_{j}\right)},{Y}_{\left({r}_{j}+1\right)}\right]$, with ${Y}_{0}=-\infty$, ${Y}_{\left(n+1\right)}=+\infty$ and ${Y}_{\left(1\right)}<\cdots <{Y}_{\left(n\right)}$ the ordered ${Y}_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,n$.
The distribution of the $Y$ is assumed to be of the following form. Let ${F}_{L}\left(y\right)={e}^{y}/\left(1+{e}^{y}\right)$, the logistic distribution function, and consider the distribution function ${F}_{\gamma }\left(y\right)$ defined by $1-{F}_{\gamma }={\left[1-{F}_{L}\left(y\right)\right]}^{1/\gamma }$. This distribution function can be thought of as either the distribution function of the minimum, ${X}_{1,\gamma }$, of a random sample of size ${\gamma }^{-1}$ from the logistic distribution, or as the ${F}_{\gamma }\left(y-\mathrm{log}\gamma \right)$ being the distribution function of a random variable having the $F$-distribution with $2$ and $2{\gamma }^{-1}$ degrees of freedom. This family of generalized logistic distribution functions $\left[{F}_{\gamma }\left(.\right)\text{;}0\le \gamma <\infty \right]$ naturally links the symmetric logistic distribution $\left(\gamma =1\right)$ with the skew extreme value distribution ($\mathrm{lim}\gamma \to 0$) and with the limiting negative exponential distribution ($\mathrm{lim}\gamma \to \infty$). For this family explicit results are available for right-censored data. See Pettitt (1983) for details.
Let ${l}_{R}$ denote the logarithm of the rank marginal likelihood of the observations and define the $q×1$ vector $a$ by $a={l}_{R}^{\prime }\left(\theta =0\right)$, and let the $q$ by $q$ diagonal matrix $B$ and $q$ by $q$ symmetric matrix $A$ be given by $B-A=-{l}_{R}^{\prime \prime }\left(\theta =0\right)$. Then various statistics can be found from the analysis.
 (a) The score statistic ${X}^{\mathrm{T}}a$. This statistic is used to test the hypothesis ${H}_{0}:\beta =0$ (see (e)). (b) The estimated variance-covariance matrix of the score statistic in (a). (c) The estimate ${\stackrel{^}{\beta }}_{R}=M{X}^{\mathrm{T}}a$. (d) The estimated variance-covariance matrix $M={\left({X}^{\mathrm{T}}\left(B-A\right)X\right)}^{-1}$ of the estimate ${\stackrel{^}{\beta }}_{R}$. (e) The ${\chi }^{2}$ statistic $Q={\stackrel{^}{\beta }}_{R}{M}^{-1}\text{​ ​}{\stackrel{^}{\beta }}_{r}={a}^{\mathrm{T}}X{\left({X}^{\mathrm{T}}\left(B-A\right)X\right)}^{-1}{X}^{\mathrm{T}}a$, used to test ${H}_{0}:\beta =0$. Under ${H}_{0}$, $Q$ has an approximate ${\chi }^{2}$-distribution with $p$ degrees of freedom. (f) The standard errors ${M}_{ii}^{1/2}$ of the estimates given in (c). (g) Approximate $z$-statistics, i.e., ${Z}_{i}={\stackrel{^}{\beta }}_{{R}_{i}}/se\left({\stackrel{^}{\beta }}_{{R}_{i}}\right)$ for testing ${H}_{0}:{\beta }_{i}=0$. For $i=1,2,\dots ,n$, ${Z}_{i}$ has an approximate $N\left(0,1\right)$ distribution.
In many situations, more than one sample of observations will be available. In this case we assume the model,
 $hk Yk = XkT β+ek , k=1,2,…,NS ,$
where NS is the number of samples. In an obvious manner, ${Y}_{k}$ and ${X}_{k}$ are the vector of observations and the design matrix for the $k$th sample respectively. Note that the arbitrary transformation ${h}_{k}$ can be assumed different for each sample since observations are ranked within the sample.
The earlier analysis can be extended to give a combined estimate of $\beta$ as $\stackrel{^}{\beta }=Dd$, where
 $D-1=∑k=1NSXTBk-AkXk$
and
 $d=∑k= 1NS XkT ak ,$
with ${a}_{k}$, ${B}_{k}$ and ${A}_{k}$ defined as $a$, $B$ and $A$ above but for the $k$th sample.
The remaining statistics are calculated as for the one sample case.

## 4  References

Kalbfleisch J D and Prentice R L (1980) The Statistical Analysis of Failure Time Data Wiley
Pettitt A N (1982) Inference for the linear model using a likelihood based on ranks J. Roy. Statist. Soc. Ser. B 44 234–243
Pettitt A N (1983) Approximate methods using ranks for regression with censored data Biometrika 70 121–132

## 5  Parameters

1:     NS – INTEGERInput
On entry: the number of samples.
Constraint: ${\mathbf{NS}}\ge 1$.
2:     NV(NS) – INTEGER arrayInput
On entry: the number of observations in the $\mathit{i}$th sample, for $\mathit{i}=1,2,\dots ,{\mathbf{NS}}$.
Constraint: ${\mathbf{NV}}\left(\mathit{i}\right)\ge 1$, for $\mathit{i}=1,2,\dots ,{\mathbf{NS}}$.
3:     NSUM – INTEGERInput
On entry: the total number of observations.
Constraint: ${\mathbf{NSUM}}=\sum _{\mathit{i}=1}^{{\mathbf{NS}}}{\mathbf{NV}}\left(\mathit{i}\right)$.
4:     Y(NSUM) – REAL (KIND=nag_wp) arrayInput
On entry: the observations in each sample. Specifically, ${\mathbf{Y}}\left(\sum _{k=1}^{i-1}{\mathbf{NV}}\left(k\right)+j\right)$ must contain the $j$th observation in the $i$th sample.
5:     IP – INTEGERInput
On entry: the number of parameters to be fitted.
Constraint: ${\mathbf{IP}}\ge 1$.
6:     X(LDX,IP) – REAL (KIND=nag_wp) arrayInput
On entry: the design matrices for each sample. Specifically, ${\mathbf{X}}\left(\sum _{k=1}^{i-1}{\mathbf{NV}}\left(k\right)+j,l\right)$ must contain the value of the $l$th explanatory variable for the $j$th observations in the $i$th sample.
Constraint: ${\mathbf{X}}$ must not contain a column with all elements equal.
7:     LDX – INTEGERInput
On entry: the first dimension of the array X as declared in the (sub)program from which G08RBF is called.
Constraint: ${\mathbf{LDX}}\ge {\mathbf{NSUM}}$.
8:     ICEN(NSUM) – INTEGER arrayInput
On entry: defines the censoring variable for the observations in Y.
${\mathbf{ICEN}}\left(i\right)=0$
If ${\mathbf{Y}}\left(i\right)$ is uncensored.
${\mathbf{ICEN}}\left(i\right)=1$
If ${\mathbf{Y}}\left(i\right)$ is censored.
Constraint: ${\mathbf{ICEN}}\left(\mathit{i}\right)=0$ or $1$, for $\mathit{i}=1,2,\dots ,{\mathbf{NSUM}}$.
9:     GAMMA – REAL (KIND=nag_wp)Input
On entry: the value of the parameter defining the generalized logistic distribution. For ${\mathbf{GAMMA}}\le 0.0001$, the limiting extreme value distribution is assumed.
Constraint: ${\mathbf{GAMMA}}\ge 0.0$.
10:   NMAX – INTEGERInput
On entry: the value of the largest sample size.
Constraint: ${\mathbf{NMAX}}=\underset{1\le i\le {\mathbf{NS}}}{\mathrm{max}}\phantom{\rule{0.25em}{0ex}}\left({\mathbf{NV}}\left(i\right)\right)$ and ${\mathbf{NMAX}}>{\mathbf{IP}}$.
11:   TOL – REAL (KIND=nag_wp)Input
On entry: the tolerance for judging whether two observations are tied. Thus, observations ${Y}_{i}$ and ${Y}_{j}$ are adjudged to be tied if $\left|{Y}_{i}-{Y}_{j}\right|<{\mathbf{TOL}}$.
Constraint: ${\mathbf{TOL}}>0.0$.
12:   PRVR(LDPRVR,IP) – REAL (KIND=nag_wp) arrayOutput
On exit: the variance-covariance matrices of the score statistics and the parameter estimates, the former being stored in the upper triangle and the latter in the lower triangle. Thus for $1\le i\le j\le {\mathbf{IP}}$, ${\mathbf{PRVR}}\left(i,j\right)$ contains an estimate of the covariance between the $i$th and $j$th score statistics. For $1\le j\le i\le {\mathbf{IP}}-1$, ${\mathbf{PRVR}}\left(i+1,j\right)$ contains an estimate of the covariance between the $i$th and $j$th parameter estimates.
13:   LDPRVR – INTEGERInput
On entry: the first dimension of the array PRVR as declared in the (sub)program from which G08RBF is called.
Constraint: ${\mathbf{LDPRVR}}\ge {\mathbf{IP}}+1$.
14:   IRANK(NMAX) – INTEGER arrayOutput
On exit: for the one sample case, IRANK contains the ranks of the observations.
15:   ZIN(NMAX) – REAL (KIND=nag_wp) arrayOutput
On exit: for the one sample case, ZIN contains the expected values of the function $g\left(.\right)$ of the order statistics.
16:   ETA(NMAX) – REAL (KIND=nag_wp) arrayOutput
On exit: for the one sample case, ETA contains the expected values of the function $g\prime \left(.\right)$ of the order statistics.
17:   VAPVEC(${\mathbf{NMAX}}×\left({\mathbf{NMAX}}+1\right)/2$) – REAL (KIND=nag_wp) arrayOutput
On exit: for the one sample case, VAPVEC contains the upper triangle of the variance-covariance matrix of the function $g\left(.\right)$ of the order statistics stored column-wise.
18:   PAREST($4×{\mathbf{IP}}+1$) – REAL (KIND=nag_wp) arrayOutput
On exit: the statistics calculated by the routine.
The first IP components of PAREST contain the score statistics.
The next IP elements contain the parameter estimates.
${\mathbf{PAREST}}\left(2×{\mathbf{IP}}+1\right)$ contains the value of the ${\chi }^{2}$ statistic.
The next IP elements of PAREST contain the standard errors of the parameter estimates.
Finally, the remaining IP elements of PAREST contain the $z$-statistics.
19:   WORK(LWORK) – REAL (KIND=nag_wp) arrayWorkspace
20:   LWORK – INTEGERInput
On entry: the dimension of the array WORK as declared in the (sub)program from which G08RBF is called.
Constraint: ${\mathbf{LWORK}}\ge {\mathbf{NMAX}}×\left({\mathbf{IP}}+1\right)$.
21:   IWA($4×{\mathbf{NMAX}}$) – INTEGER arrayWorkspace
22:   IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to $0$, $-1\text{​ 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\text{​ 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 $-\mathbf{1}\text{​ 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).

## 6  Error Indicators and Warnings

If on entry ${\mathbf{IFAIL}}={\mathbf{0}}$ or $-{\mathbf{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{NS}}<1$, or ${\mathbf{TOL}}\le 0.0$, or ${\mathbf{NMAX}}\le {\mathbf{IP}}$, or ${\mathbf{LDPRVR}}<{\mathbf{IP}}+1$, or ${\mathbf{LDX}}<{\mathbf{NSUM}}$, or ${\mathbf{NMAX}}\ne {\mathrm{max}}_{1\le i\le {\mathbf{NS}}}\left({\mathbf{NV}}\left(i\right)\right)$, or ${\mathbf{NV}}\left(i\right)\le 0$ for some $i$, $i=1,2,\dots ,{\mathbf{NS}}$, or ${\mathbf{NSUM}}\ne \sum _{i=1}^{{\mathbf{NS}}}{\mathbf{NV}}\left(i\right)$, or ${\mathbf{IP}}<1$, or ${\mathbf{GAMMA}}<0.0$, or ${\mathbf{LWORK}}<{\mathbf{NMAX}}×\left({\mathbf{IP}}+1\right)$.
${\mathbf{IFAIL}}=2$
 On entry, ${\mathbf{ICEN}}\left(i\right)\ne 0$ or $1$, for some $1\le i\le {\mathbf{NSUM}}$.
${\mathbf{IFAIL}}=3$
On entry, all the observations are adjudged to be tied. You are advised to check the value supplied for TOL.
${\mathbf{IFAIL}}=4$
The matrix ${X}^{\mathrm{T}}\left(B-A\right)X$ is either ill-conditioned or not positive definite. This error should only occur with extreme rankings of the data.
${\mathbf{IFAIL}}=5$
 On entry, at least one column of the matrix $X$ has all its elements equal.

## 7  Accuracy

The computations are believed to be stable.

## 8  Further Comments

The time taken by G08RBF depends on the number of samples, the total number of observations and the number of parameters fitted.
In extreme cases the parameter estimates for certain models can be infinite, although this is unlikely to occur in practice. See Pettitt (1982) for further details.

## 9  Example

This example fits a regression model to a single sample of $40$ observations using just one explanatory variable.

### 9.1  Program Text

Program Text (g08rbfe.f90)

### 9.2  Program Data

Program Data (g08rbfe.d)

### 9.3  Program Results

Program Results (g08rbfe.r)

G08RBF (PDF version)
G08 Chapter Contents
G08 Chapter Introduction
NAG Library Manual