Integer, Intent (In)	::	n
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	iwrk(3*n)
Real (Kind=nag_wp), Intent (In)	::	x(n), clevel
Real (Kind=nag_wp), Intent (Out)	::	theta, thetal, thetau, estcl, wlower, wupper, wrk(4*n)
Character (1), Intent (In)	::	method

C Header Interface

#include <nag.h>

void	g07eaf_ (const char method, const Integer n, const double x[], const double clevel, double theta, double thetal, double thetau, double estcl, double wlower, double wupper, double wrk[], Integer iwrk[], Integer ifail, const Charlen length_method)

The routine may be called by the names g07eaf or nagf_univar_robust_1var_ci.

3 Description

Consider a vector of independent observations,

x = {(x_{1}, x_{2}, \dots, x_{n})}^{T}

with unknown common symmetric density

f (x_{i} - θ)

. g07eaf computes the Hodges–Lehmann location estimator (see Lehmann (1975)) of the centre of symmetry

θ

, together with an associated confidence interval. The Hodges–Lehmann estimate is defined as

\hat{θ} = median \{\frac{x_{i} + x_{j}}{2}, 1 \leq i \leq j \leq n\} .

Let

m = (n (n + 1)) / 2

and let

a_{k}

, for

k = 1, 2, \dots, m

denote the

m

ordered averages

(x_{i} + x_{j}) / 2

for

1 \leq i \leq j \leq n

. Then

if $m$ is odd, $\hat{θ} = a_{k}$ where $k = (m + 1) / 2$ ;
if $m$ is even, $\hat{θ} = (a_{k} + a_{k + 1}) / 2$ where $k = m / 2$ .

This estimator arises from inverting the one-sample Wilcoxon signed-rank test statistic,

W (x - θ_{0})

, for testing the hypothesis that

θ = θ_{0}

. Effectively

W (x - θ_{0})

is a monotonically decreasing step function of

θ_{0}

with

\begin{matrix} mean ​ (W) = μ = \frac{n (n + 1)}{4}, \\ var (W) = σ^{2} = \frac{n (n + 1) (2 n + 1)}{24} . \end{matrix}

The estimate

\hat{θ}

is the solution to the equation

W (x - \hat{θ}) = μ

; two methods are available for solving this equation. These methods avoid the computation of all the ordered averages

a_{k}

; this is because for large

n

both the storage requirements and the computation time would be excessive.

The first is an exact method based on a set partitioning procedure on the set of all ordered averages

(x_{i} + x_{j}) / 2

for

i \leq j

. This is based on the algorithm proposed by Monahan (1984).

The second is an iterative algorithm, based on the Illinois method which is a modification of the regula falsi method, see McKean and Ryan (1977). This algorithm has proved suitable for the function

W (x - θ_{0})

which is asymptotically linear as a function of

θ_{0}

The confidence interval limits are also based on the inversion of the Wilcoxon test statistic.

Given a desired percentage for the confidence interval,

1 - α

, expressed as a proportion between

0

and

1

, initial estimates for the lower and upper confidence limits of the Wilcoxon statistic are found from

W_{l} = μ - 0.5 + (σ Φ^{- 1} (α / 2))

and

W_{u} = μ + 0.5 + (σ Φ^{- 1} (1 - α / 2)),

where

Φ^{- 1}

is the inverse cumulative Normal distribution function.

W_{l}

and

W_{u}

are rounded to the nearest integer values. These estimates are then refined using an exact method if

n \leq 80

, and a Normal approximation otherwise, to find

W_{l}

and

W_{u}

satisfying

\begin{array}{l} P (W \leq W_{l}) \leq α / 2 \\ P (W \leq W_{l} + 1) > α / 2 \end{array}

and

\begin{array}{l} P (W \geq W_{u}) \leq α / 2 \\ P (W \geq W_{u} - 1) > α / 2 . \end{array}

Let

W_{u} = m - k

; then

θ_{l} = a_{k + 1}

. This is the largest value

θ_{l}

such that

W (x - θ_{l}) = W_{u}

Let

W_{l} = k

; then

θ_{u} = a_{m - k}

. This is the smallest value

θ_{u}

such that

W (x - θ_{u}) = W_{l}

As in the case of

\hat{θ}

, these equations may be solved using either the exact or the iterative methods to find the values

θ_{l}

and

θ_{u}

Then

(θ_{l}, θ_{u})

is the confidence interval for

θ

. The confidence interval is thus defined by those values of

θ_{0}

such that the null hypothesis,

θ = θ_{0}

, is not rejected by the Wilcoxon signed-rank test at the

(100 \times α) %

level.

4 References

Lehmann E L (1975) Nonparametrics: Statistical Methods Based on Ranks Holden–Day

Marazzi A (1987) Subroutines for robust estimation of location and scale in ROBETH Cah. Rech. Doc. IUMSP, No. 3 ROB 1 Institut Universitaire de Médecine Sociale et Préventive, Lausanne

McKean J W and Ryan T A (1977) Algorithm 516: An algorithm for obtaining confidence intervals and point estimates based on ranks in the two-sample location problem ACM Trans. Math. Software 10 183–185

Monahan J F (1984) Algorithm 616: Fast computation of the Hodges–Lehman location estimator ACM Trans. Math. Software 10 265–270

5 Arguments

1: $method$ – Character(1) Input

On entry: specifies the method to be used.

$method ='E'$: The exact algorithm is used.
$method ='A'$: The iterative algorithm is used.

Constraint:

method ='E'

'A'

2: $n$ – Integer Input

On entry:

n

, the sample size.

Constraint:

n \geq 2

3: $x (n)$ – Real (Kind=nag_wp) array Input

On entry: the sample observations,

x_{i}

, for

i = 1, 2, \dots, n

4: $clevel$ – Real (Kind=nag_wp) Input

On entry: the confidence interval desired.

For example, for a

95 %

confidence interval set

clevel = 0.95

Constraint:

0.0 < clevel < 1.0

5: $theta$ – Real (Kind=nag_wp) Output

On exit: the estimate of the location,

\hat{θ}

6: $thetal$ – Real (Kind=nag_wp) Output

On exit: the estimate of the lower limit of the confidence interval,

θ_{l}

7: $thetau$ – Real (Kind=nag_wp) Output

On exit: the estimate of the upper limit of the confidence interval,

θ_{u}

8: $estcl$ – Real (Kind=nag_wp) Output

On exit: an estimate of the actual percentage confidence of the interval found, as a proportion between

(0.0, 1.0)

9: $wlower$ – Real (Kind=nag_wp) Output

On exit: the upper value of the Wilcoxon test statistic,

W_{u}

, corresponding to the lower limit of the confidence interval.

10: $wupper$ – Real (Kind=nag_wp) Output

On exit: the lower value of the Wilcoxon test statistic,

W_{l}

, corresponding to the upper limit of the confidence interval.

11: $wrk (4 \times n)$ – Real (Kind=nag_wp) array Workspace

12: $iwrk (3 \times n)$ – Integer array Workspace

13: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

- 1 or 1

. If you are unfamiliar with this argument you should refer to Section 4 in the Introduction to the NAG Library FL Interface 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 argument, 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

- 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, $clevel = 〈value〉$ .
Constraint: $0.0 < clevel < 1.0$ .

On entry, $method = 〈value〉$ .
Constraint: $method ='E'$ or $'A'$ .

On entry, $n = 〈value〉$ .
Constraint: $n \geq 2$ .

$ifail = 2$: Not enough information to compute an interval estimate since the whole sample is identical. The common value is returned in theta, thetal and thetau.

$ifail = 3$: The iterative procedure used to estimate, $θ_{l}$ , the lower confidence limit has not converged. This is an unlikely exit but the estimate should still be a reasonable approximation.

The iterative procedure used to estimate, $θ_{u}$ , the upper confidence limit has not converged. This is an unlikely exit but the estimate should still be a reasonable approximation.

The iterative procedure used to estimate $θ$ has not converged. This is an unlikely exit but the estimate should still be a reasonable approximation.

$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

g07eaf should produce results accurate to five significant figures in the width of the confidence interval; that is the error for any one of the three estimates should be less than

0.00001 \times (thetau - thetal)

8 Parallelism and Performance

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

9 Further Comments

The time taken increases with the sample size

n

10 Example

The following program calculates a 95% confidence interval for

θ

, a measure of symmetry of the sample of

50

observations.

Interfaces: FL CL AD

NAG FL Interface Introduction

G07 (Univar) Chapter Contents

G07 (Univar) Chapter Introduction

g07ea: FL CL AD

NAG FL Interfaceg07eaf (robust_​1var_​ci)

▸▿ 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
g07eaf (robust_1var_ci)