NAG Library Routine Document

G02HAF

INTEGER	INDW, IPSI, ISIGMA, INDC, N, M, LDX, LDC, MAXIT, NITMON, IFAIL
REAL (KIND=nag_wp)	X(LDX,M), Y(N), CPSI, H1, H2, H3, CUCV, DCHI, THETA(M), SIGMA, C(LDC,M), RS(N), WGT(N), TOL, WORK(4N+M(N+M))

3 Description

For the linear regression model

y = X θ + ε,

where	$y$ is a vector of length $n$ of the dependent variable,
	$X$ is a $n$ by $m$ matrix of independent variables of column rank $k$ ,
	$θ$ is a vector of length $m$ of unknown parameters,
and	$ε$ is a vector of length $n$ of unknown errors with $var (ε_{i}) = σ^{2}$ ,

G02HAF calculates the M-estimates given by the solution,

\hat{θ}

, to the equation

\sum_{i = 1}^{n} ψ (r_{i} / (σ w_{i})) w_{i} x_{i j} = 0, j = 1, 2, \dots, m,

(1)

where

r_{i}

is the

i

th residual, i.e., the

i

th element of

r = y - X \hat{θ}

ψ

is a suitable weight function,

w_{i}

are suitable weights,

and

σ

may be estimated at each iteration by the median absolute deviation of the residuals

\hat{σ} = \underset{i}{med} [|r_{i}|] / β_{1}

or as the solution to

\sum_{i = 1}^{n} χ (r_{i} / (\hat{σ} w_{i})) w_{i}^{2} = (n - k) β_{2}

for suitable weight function

χ

, where

β_{1}

and

β_{2}

are constants, chosen so that the estimator of

σ

is asymptotically unbiased if the errors,

ε_{i}

, have a Normal distribution. Alternatively

σ

may be held at a constant value.

The above describes the Schweppe type regression. If the

w_{i}

are assumed to equal

1

for all

i

then Huber type regression is obtained. A third type, due to Mallows, replaces (1) by

\sum_{i = 1}^{n} ψ (r_{i} / σ) w_{i} x_{i j} = 0, j = 1, 2, \dots, m .

This may be obtained by use of the transformations

\begin{array}{l} w_{i}^{*} \leftarrow \sqrt{w_{i}} \\ y_{i}^{*} \leftarrow y_{i} \sqrt{w_{i}} \\ x_{i j}^{*} \leftarrow x_{i j} \sqrt{w_{i}}, & j = 1, 2, \dots, m \end{array}

(see Section 3 of Marazzi (1987a)).

For Huber and Schweppe type regressions,

β_{1}

is the 75th percentile of the standard Normal distribution. For Mallows type regression

β_{1}

is the solution to

\frac{1}{n} \sum_{i = 1}^{n} Φ (β_{1} / \sqrt{w_{i}}) = 0.75,

where

Φ

is the standard Normal cumulative distribution function (see S15ABF).

β_{2}

is given by

\begin{array}{l} β_{2} = \int_{- \infty}^{\infty} χ (z) ϕ (z) d z & in the Huber case; \\ β_{2} = \frac{1}{n} \sum_{i = 1}^{n} w_{i} \int_{- \infty}^{\infty} χ (z) ϕ (z) d z & in the Mallows case; \\ β_{2} = \frac{1}{n} \sum_{i = 1}^{n} w_{i}^{2} \int_{- \infty}^{\infty} χ (z / w_{i}) ϕ (z) d z & in the Schweppe case; \end{array}

where

ϕ

is the standard Normal density, i.e.,

\frac{1}{\sqrt{2 π}} \exp (- \frac{1}{2} x^{2}) .

The calculation of the estimates of

θ

can be formulated as an iterative weighted least squares problem with a diagonal weight matrix

G

given by

G_{i i} = \{\begin{cases} \frac{ψ (r_{i} / (σ w_{i}))}{(r_{i} / (σ w_{i}))}, & r_{i} \neq 0 \\ ψ^{'} (0), & r_{i} = 0 \end{cases},

where

ψ^{'} (t)

is the derivative of

ψ

at the point

t

The value of

θ

at each iteration is given by the weighted least squares regression of

y

X

. This is carried out by first transforming the

y

and

X

\begin{array}{l} {\tilde{y}}_{i} = y_{i} \sqrt{G_{i i}} \\ {\tilde{x}}_{i j} = x_{i j} \sqrt{G_{i i}}, & j = 1, 2, \dots, m \end{array}

and then using F04JGF. If

X

is of full column rank then an orthogonal-triangular (

Q R

) decomposition is used; if not, a singular value decomposition is used.

The following functions are available for

ψ

and

χ

in G02HAF.

(a)

Unit Weights

ψ (t) = t, χ (t) = \frac{t^{2}}{2} .

This gives least squares regression.

(b)

Huber's Function

ψ (t) = \max (- c, \min (c, t)), χ (t) = \{\begin{cases} \frac{t^{2}}{2}, & |t| \leq d \\ \frac{d^{2}}{2}, & |t| > d \end{cases}

(c)

Hampel's Piecewise Linear Function

ψ_{h_{1}, h_{2}, h_{3}} (t) = - ψ_{h_{1}, h_{2}, h_{3}} (- t) = \{\begin{cases} t, & 0 \leq t \leq h_{1} \\ h_{1}, & h_{1} \leq t \leq h_{2} \\ h_{1} (h_{3} - t) / (h_{3} - h_{2}), & h_{2} \leq t \leq h_{3} \\ 0, & h_{3} < t \end{cases}

χ (t) = \{\begin{cases} \frac{t^{2}}{2}, & |t| \leq d \\ \frac{d^{2}}{2}, & |t| > d \end{cases}

(d)

Andrew's Sine Wave Function

ψ (t) = \{\begin{cases} \sin t, & - π \leq t \leq π \\ 0, & |t| > π \end{cases} χ (t) = \{\begin{cases} \frac{t^{2}}{2}, & |t| \leq d \\ \frac{d^{2}}{2}, & |t| > d \end{cases}

(e)

Tukey's Bi-weight

ψ (t) = \{\begin{cases} t {(1 - t^{2})}^{2}, & |t| \leq 1 \\ 0, & |t| > 1 \end{cases} χ (t) = \{\begin{cases} \frac{t^{2}}{2}, & |t| \leq d \\ \frac{d^{2}}{2}, & |t| > d \end{cases}

where

c

h_{1}

h_{2}

h_{3}

, and

d

are given constants.

Several schemes for calculating weights have been proposed, see Hampel et al. (1986) and Marazzi (1987a). As the different independent variables may be measured on different scales, one group of proposed weights aims to bound a standardized measure of influence. To obtain such weights the matrix

A

has to be found such that:

\frac{1}{n} \sum_{i = 1}^{n} u ({‖z_{i}‖}_{2}) z_{i} z_{i}^{T} = I

and

z_{i} = A x_{i},

where	$x_{i}$ is a vector of length $m$ containing the $i$ th row of $X$ ,
	$A$ is an $m$ by $m$ lower triangular matrix,
and	$u$ is a suitable function.

The weights are then calculated as

w_{i} = f ({‖z_{i}‖}_{2})

for a suitable function

f

G02HAF finds

A

using the iterative procedure

A_{k} = (S_{k} + I) A_{k - 1},

where

S_{k} = (s_{j l})

s_{j l} = \{\begin{cases} - \min [\max (h_{j l} / n, - B L), B L], & j > l \\ - \min [\max (\frac{1}{2} (h_{j j} / n - 1), - B D), B D], & j = l \end{cases}

and

h_{j l} = \sum_{i = 1}^{n} u ({‖z_{i}‖}_{2}) z_{i j} z_{i l}

and

B L

and

B D

are bounds set at

0.9

Two weights are available in G02HAF:

(i)

Krasker–Welsch Weights

u (t) = g_{1} (\frac{c}{t}),

where	$g_{1} (t) = t^{2} + (1 - t^{2}) (2 Φ (t) - 1) - 2 t ϕ (t)$ ,
	$Φ (t)$ is the standard Normal cumulative distribution function,
	$ϕ (t)$ is the standard Normal probability density function,
and	$f (t) = \frac{1}{t}$ .

These are for use with Schweppe type regression.

(ii)

Maronna's Proposed Weights

\begin{array}{l} u (t) = \{\begin{cases} \frac{c}{t^{2}} & |t| > c \\ 1 & |t| \leq c \end{cases} \\ f (t) = \sqrt{u (t)} . \end{array}

These are for use with Mallows type regression.

Finally the asymptotic variance-covariance matrix,

C

, of the estimates

θ

is calculated.

For Huber type regression

C = f_{H} {(X^{T} X)}^{- 1} {\hat{σ}}^{2},

where

f_{H} = \frac{1}{n - m} \frac{\sum_{i = 1}^{n} ψ^{2} (r_{i} / \hat{σ})}{{(\frac{1}{n} \sum_{i = 1}^{n} ψ^{'} (\frac{r_{i}}{\hat{σ}}))}^{2}} κ^{2}

κ^{2} = 1 + \frac{m}{n} \frac{\frac{1}{n} \sum_{i = 1}^{n} {(ψ^{'} (r_{i} / \hat{σ}) - \frac{1}{n} \sum_{i = 1}^{n} ψ^{'} (r_{i} / \hat{σ}))}^{2}}{{(\frac{1}{n} \sum_{i = 1}^{n} ψ^{'} (\frac{r_{i}}{\hat{σ}}))}^{2}} .

See Huber (1981) and Marazzi (1987b).

For Mallows and Schweppe type regressions

C

is of the form

{\frac{\hat{σ}}{n}}^{2} S_{1}^{- 1} S_{2} S_{1}^{- 1},

where

S_{1} = \frac{1}{n} X^{T} D X

and

S_{2} = \frac{1}{n} X^{T} P X

D

is a diagonal matrix such that the

i

th element approximates

E (ψ^{'} (r_{i} / (σ w_{i})))

in the Schweppe case and

E (ψ^{'} (r_{i} / σ) w_{i})

in the Mallows case.

P

is a diagonal matrix such that the

i

th element approximates

E (ψ^{2} (r_{i} / (σ w_{i})) w_{i}^{2})

in the Schweppe case and

E (ψ^{2} (r_{i} / σ) w_{i}^{2})

in the Mallows case.

Two approximations are available in G02HAF:

Average over the

r_{i}

\begin{matrix} Schweppe & Mallows \\ D_{i} = (\frac{1}{n} \sum_{j = 1}^{n} ψ^{'} (\frac{r_{j}}{\hat{σ} w_{i}})) w_{i} & D_{i} = (\frac{1}{n} \sum_{j = 1}^{n} ψ^{'} (\frac{r_{j}}{\hat{σ}})) w_{i} \\ P_{i} = (\frac{1}{n} \sum_{j = 1}^{n} ψ^{2} (\frac{r_{j}}{\hat{σ} w_{i}})) w_{i}^{2} & P_{i} = (\frac{1}{n} \sum_{j = 1}^{n} ψ^{2} (\frac{r_{j}}{\hat{σ}})) w_{i}^{2} \end{matrix}

Replace expected value by observed

\begin{matrix} Schweppe & Mallows \\ D_{i} = ψ^{'} (\frac{r_{i}}{\hat{σ} w_{i}}) w_{i} & D_{i} = ψ^{'} (\frac{r_{i}}{\hat{σ}}) w_{i} \\ P_{i} = ψ^{2} (\frac{r_{i}}{\hat{σ} w_{i}}) w_{i}^{2} & P_{i} = ψ^{2} (\frac{r_{i}}{\hat{σ}}) w_{i}^{2} \end{matrix} .

See Hampel et al. (1986) and Marazzi (1987b).

Note: there is no explicit provision in the routine for a constant term in the regression model. However, the addition of a dummy variable whose value is

1.0

for all observations will produce a value of

\hat{θ}

corresponding to the usual constant term.

G02HAF is based on routines in ROBETH; see Marazzi (1987a).

4 References

Hampel F R, Ronchetti E M, Rousseeuw P J and Stahel W A (1986) Robust Statistics. The Approach Based on Influence Functions Wiley

Huber P J (1981) Robust Statistics Wiley

Marazzi A (1987a) Weights for bounded influence regression in ROBETH Cah. Rech. Doc. IUMSP, No. 3 ROB 3 Institut Universitaire de Médecine Sociale et Préventive, Lausanne

Marazzi A (1987b) Subroutines for robust and bounded influence regression in ROBETH Cah. Rech. Doc. IUMSP, No. 3 ROB 2 Institut Universitaire de Médecine Sociale et Préventive, Lausanne

5 Parameters

1: $INDW$ – INTEGERInput

On entry: specifies the type of regression to be performed.

$INDW < 0$: Mallows type regression with Maronna's proposed weights.
$INDW = 0$: Huber type regression.
$INDW > 0$: Schweppe type regression with Krasker–Welsch weights.

2: $IPSI$ – INTEGERInput

On entry: specifies which

ψ

function is to be used.

$IPSI = 0$: $ψ (t) = t$ , i.e., least squares.
$IPSI = 1$: Huber's function.
$IPSI = 2$: Hampel's piecewise linear function.
$IPSI = 3$: Andrew's sine wave.
$IPSI = 4$: Tukey's bi-weight.

Constraint:

0 \leq IPSI \leq 4

3: $ISIGMA$ – INTEGERInput

On entry: specifies how

σ

is to be estimated.

$ISIGMA < 0$: $σ$ is estimated by median absolute deviation of residuals.
$ISIGMA = 0$: $σ$ is held constant at its initial value.
$ISIGMA > 0$: $σ$ is estimated using the $χ$ function.

4: $INDC$ – INTEGERInput

On entry: if

INDW \neq 0

, INDC specifies the approximations used in estimating the covariance matrix of

\hat{θ}

$INDC = 1$: Averaging over residuals.
$INDC \neq 1$: Replacing expected by observed.
$INDW = 0$: INDC is not referenced.

5: $N$ – INTEGERInput

On entry:

n

, the number of observations.

Constraint:

N > 1

6: $M$ – INTEGERInput

On entry:

m

, the number of independent variables.

Constraint:

1 \leq M < N

7: $X (LDX, M)$ – REAL (KIND=nag_wp) arrayInput/Output

On entry: the values of the

X

matrix, i.e., the independent variables.

X (i, j)

must contain the

i j

th element of

X

, for

i = 1, 2, \dots, n

and

j = 1, 2, \dots, m

INDW < 0

, then during calculations the elements of X will be transformed as described in Section 3. Before exit the inverse transformation will be applied. As a result there may be slight differences between the input X and the output X.

On exit: unchanged, except as described above.

8: $LDX$ – INTEGERInput

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

Constraint:

LDX \geq N

9: $Y (N)$ – REAL (KIND=nag_wp) arrayInput/Output

On entry: the data values of the dependent variable.

Y (i)

must contain the value of

y

for the

i

th observation, for

i = 1, 2, \dots, n

INDW < 0

, then during calculations the elements of Y will be transformed as described in Section 3. Before exit the inverse transformation will be applied. As a result there may be slight differences between the input Y and the output Y.

On exit: unchanged, except as described above.

10: $CPSI$ – REAL (KIND=nag_wp)Input

On entry: if

IPSI = 1

, CPSI must specify the parameter,

c

, of Huber's

ψ

function.

IPSI \neq 1

on entry, CPSI is not referenced.

Constraint: if

CPSI > 0.0

IPSI = 1

11: $H1$ – REAL (KIND=nag_wp)Input

12: $H2$ – REAL (KIND=nag_wp)Input

13: $H3$ – REAL (KIND=nag_wp)Input

On entry: if

IPSI = 2

, H1, H2, and H3 must specify the parameters

h_{1}

h_{2}

, and

h_{3}

, of Hampel's piecewise linear

ψ

function. H1, H2, and H3 are not referenced if

IPSI \neq 2

Constraint: if

IPSI = 2

0.0 \leq H1 \leq H2 \leq H3

and

H3 > 0.0

14: $CUCV$ – REAL (KIND=nag_wp)Input

On entry: if

INDW < 0

, must specify the value of the constant,

c

, of the function

u

for Maronna's proposed weights.

INDW > 0

, must specify the value of the function

u

for the Krasker–Welsch weights.

INDW = 0

, is not referenced.

Constraints:

if $INDW < 0$ , $CUCV \geq M$ ;
if $INDW > 0$ , $CUCV \geq \sqrt{M}$ .

15: $DCHI$ – REAL (KIND=nag_wp)Input

On entry:

d

, the constant of the

χ

function. DCHI is not referenced if

IPSI = 0

, or if

ISIGMA \leq 0

Constraint: if

IPSI \neq 0

and

ISIGMA > 0

DCHI > 0.0

16: $THETA (M)$ – REAL (KIND=nag_wp) arrayInput/Output

On entry: starting values of the parameter vector

θ

. These may be obtained from least squares regression. Alternatively if

ISIGMA < 0

and

SIGMA = 1

or if

ISIGMA > 0

and SIGMA approximately equals the standard deviation of the dependent variable,

y

, then

THETA (i) = 0.0

, for

i = 1, 2, \dots, m

may provide reasonable starting values.

On exit:

THETA (i)

contains the M-estimate of

θ_{i}

, for

i = 1, 2, \dots, m

17: $SIGMA$ – REAL (KIND=nag_wp)Input/Output

On entry: a starting value for the estimation of

σ

. SIGMA should be approximately the standard deviation of the residuals from the model evaluated at the value of

θ

given by THETA on entry.

Constraint:

SIGMA > 0.0

On exit: contains the final estimate of

σ

ISIGMA \neq 0

or the value assigned on entry if

ISIGMA = 0

18: $C (LDC, M)$ – REAL (KIND=nag_wp) arrayOutput

On exit: the diagonal elements of C contain the estimated asymptotic standard errors of the estimates of

θ

, i.e.,

C (i, i)

contains the estimated asymptotic standard error of the estimate contained in

THETA (i)

The elements above the diagonal contain the estimated asymptotic correlation between the estimates of

θ

, i.e.,

C (i, j)

1 \leq i < j \leq m

contains the asymptotic correlation between the estimates contained in

THETA (i)

and

THETA (j)

The elements below the diagonal contain the estimated asymptotic covariance between the estimates of

θ

, i.e.,

C (i, j)

1 \leq j < i \leq m

contains the estimated asymptotic covariance between the estimates contained in

THETA (i)

and

THETA (j)

19: $LDC$ – INTEGERInput

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

Constraint:

LDC \geq M

20: $RS (N)$ – REAL (KIND=nag_wp) arrayOutput

On exit: the residuals from the model evaluated at final value of THETA, i.e., RS contains the vector

(y - X \hat{θ})

21: $WGT (N)$ – REAL (KIND=nag_wp) arrayOutput

On exit: the vector of weights.

WGT (i)

contains the weight for the

i

th observation, for

i = 1, 2, \dots, n

22: $TOL$ – REAL (KIND=nag_wp)Input

On entry: the relative precision for the calculation of

A

(if

INDW \neq 0

), the estimates of

θ

and the estimate of

σ

(if

ISIGMA \neq 0

). Convergence is assumed when the relative change in all elements being considered is less than TOL.

INDW < 0

and

ISIGMA < 0

, TOL is also used to determine the precision of

β_{1}

It is advisable for TOL to be greater than

100 \times machine precision

Constraint:

TOL > 0.0

23: $MAXIT$ – INTEGERInput

On entry: the maximum number of iterations that should be used in the calculation of

A

(if

INDW \neq 0

), and of the estimates of

θ

and

σ

, and of

β_{1}

(if

INDW < 0

and

ISIGMA < 0

A value of

MAXIT = 50

should be adequate for most uses.

Constraint:

MAXIT > 0

24: $NITMON$ – INTEGERInput

On entry: the amount of information that is printed on each iteration.

$NITMON = 0$: No information is printed.
$NITMON \neq 0$: The current estimate of $θ$ , the change in $θ$ during the current iteration and the current value of $σ$ are printed on the first and every $abs (NITMON)$ iterations.

Also, if

INDW \neq 0

and

NITMON > 0

then information on the iterations to calculate

A

is printed. This is the current estimate of

A

and the maximum value of

S_{i j}

(see Section 3).

When printing occurs the output is directed to the current advisory message unit (see X04ABF).

25: $WORK (4 \times N + M \times (N + M))$ – REAL (KIND=nag_wp) arrayOutput

On exit: the following values are assigned to WORK:

$WORK (1) = β_{1}$ if $ISIGMA < 0$ , or $WORK (1) = β_{2}$ if $ISIGMA > 0$ .
$WORK (2) =$ number of iterations used to calculate $A$ .
$WORK (3) =$ number of iterations used to calculate final estimates of $θ$ and $σ$ .
$WORK (4) = k$ , the rank of the weighted least squares equations.

The rest of the array is used as workspace.

26: $IFAIL$ – INTEGERInput/Output

On entry: IFAIL must be set to

0

- 1 ​ 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 ​ or ​ 1

is recommended. If the output of error messages is undesirable, then the value

1

is recommended. Otherwise, because for this routine the values of the output parameters may be useful even if

IFAIL \neq 0

on exit, the recommended value is

- 1

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

Note: G02HAF may return useful information for one or more of the following detected errors or warnings.

Errors or warnings detected by the routine:

$IFAIL = 1$

On entry,	$N \leq 1$ ,
or	$M < 1$ ,
or	$N \leq M$ ,
or	$LDX < N$ ,
or	$LDC < M$ .

$IFAIL = 2$

On entry,	$IPSI < 0$ ,
or	$IPSI > 4$ .

$IFAIL = 3$

On entry,	$SIGMA \leq 0.0$ ,
or	$IPSI = 1$ and $CPSI \leq 0.0$ ,
or	$IPSI = 2$ and $H1 < 0.0$ ,
or	$IPSI = 2$ and $H1 > H2$ ,
or	$IPSI = 2$ and $H2 > H3$ ,
or	$IPSI = 2$ and $H1 = H2 = H3 = 0.0$ ,
or	$IPSI \neq 0$ and $ISIGMA > 0$ and $DCHI \leq 0.0$ ,
or	$INDW > 0$ and $CUCV < \sqrt{M}$ ,
or	$INDW < 0$ and $CUCV < M$ .

$IFAIL = 4$

On entry,	$TOL \leq 0.0$ ,
or	$MAXIT \leq 0$ .

$IFAIL = 5$: The number of iterations required to calculate the weights exceeds MAXIT. (Only if $INDW \neq 0$ .)

$IFAIL = 6$: The number of iterations required to calculate $β_{1}$ exceeds MAXIT. (Only if $INDW < 0$ and $ISIGMA < 0$ .)

$IFAIL = 7$: Either the number of iterations required to calculate $θ$ and $σ$ exceeds MAXIT (note that, in this case $WORK (3) = MAXIT$ on exit), or the iterations to solve the weighted least squares equations failed to converge. The latter is an unlikely error exit.

$IFAIL = 8$: The weighted least squares equations are not of full rank.

$IFAIL = 9$: If $INDW = 0$ then $(X^{T} X)$ is almost singular.

If $INDW \neq 0$ then $S_{1}$ is singular or almost singular. This may be due to too many diagonal elements of the matrix being zero, see Section 9.

$IFAIL = 10$

In calculating the correlation factor for the asymptotic variance-covariance matrix either the value of

\frac{1}{n} \sum_{i = 1}^{n} ψ^{'} (r_{i} / \hat{σ}) = 0,   or κ = 0,   or \sum_{i = 1}^{n} ψ^{2} (r_{i} / \hat{σ}) = 0 .

See Section 9. In this case C is returned as

X^{T} X

(Only if

INDW = 0

$IFAIL = 11$: The estimated variance for an element of $θ \leq 0$ .

In this case the diagonal element of C will contain the negative variance and the above diagonal elements in the row and column corresponding to the element will be returned as zero.

This error may be caused by rounding errors or too many of the diagonal elements of $P$ being zero, where $P$ is defined in Section 3. See Section 9.

$IFAIL = 12$: The degrees of freedom for error, $n - k \leq 0$ (this is an unlikely error exit), or the estimated value of $σ$ was $0$ during an iteration.

$IFAIL = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.8 in the Essential Introduction for further information.

$IFAIL = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.7 in the Essential Introduction for further information.

$IFAIL = - 999$: Dynamic memory allocation failed.
See Section 3.6 in the Essential Introduction for further information.

7 Accuracy

The precision of the estimates is determined by TOL. As a more stable method is used to calculate the estimates of

θ

than is used to calculate the covariance matrix, it is possible for the least squares equations to be of full rank but the

(X^{T} X)

matrix to be too nearly singular to be inverted.

8 Parallelism and Performance

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

G02HAF 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

In cases when

ISIGMA \geq 0

it is important for the value of SIGMA to be of a reasonable magnitude. Too small a value may cause too many of the winsorized residuals, i.e.,

ψ (r_{i} / σ)

, to be zero or a value of

ψ^{'} (r_{i} / σ)

, used to estimate the asymptotic covariance matrix, to be zero. This can lead to errors

IFAIL = 8

9

(if

INDW \neq 0

IFAIL = 10

(if

INDW = 0

) and

IFAIL = 11

G02HBF, G02HDF and G02HFF together carry out the same calculations as G02HAF but for user-supplied functions for

ψ

χ

ψ^{'}

and

u

10 Example

The number of observations and the number of

x

variables are read in followed by the data. The option parameters are then read in (in this case giving Schweppe type regression with Hampel's

ψ

function and Huber's

χ

function and then using the ‘replace expected by observed’ option in calculating the covariances). Finally a set of values for the constants are read in.

After a call to G02HAF,

\hat{θ}

, its standard error and

\hat{σ}

are printed. In addition the weight and residual for each observation is printed.

NAG Library Routine DocumentG02HAF

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

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 Library Routine Document

G02HAF