Integer, Intent (In)	::	n, ip
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	res(n)
Real (Kind=nag_wp), Intent (Out)	::	d, pdl, pdu, work(n)

C Header Interface

#include <nag.h>

void	g02fcf_ (const Integer n, const Integer ip, const double res[], double d, double pdl, double pdu, double work[], Integer ifail)

The routine may be called by the names g02fcf or nagf_correg_linregm_stat_durbwat.

3 Description

For the general linear regression model

y = X β + ε,

where	$y$ is a vector of length $n$ of the dependent variable, $X$ is an $n \times p$ matrix of the independent variables, $β$ is a vector of length $p$ of unknown parameters,
and	$ε$ is a vector of length $n$ of unknown random errors.

The residuals are given by

r = y - \hat{y} = y - X \hat{β}

and the fitted values,

\hat{y} = X \hat{β}

, can be written as

H y

for an

n \times n

matrix

H

. Note that when a mean term is included in the model the sum of the residuals is zero. If the observations have been taken serially, that is

y_{1}, y_{2}, \dots, y_{n}

can be considered as a time series, the Durbin–Watson test can be used to test for serial correlation in the

ε_{i}

, see Durbin and Watson (1950), Durbin and Watson (1951) and Durbin and Watson (1971).

The Durbin–Watson statistic is

d = \frac{\sum_{i = 1}^{n - 1} {(r_{i + 1} - r_{i})}^{2}}{\sum_{i = 1}^{n} r_{i}^{2}} .

Positive serial correlation in the

ε_{i}

will lead to a small value of

d

while for independent errors

d

will be close to

2

. Durbin and Watson show that the exact distribution of

d

depends on the eigenvalues of the matrix

H A

where the matrix

A

is such that

d

can be written as

d = \frac{r^{T} A r}{r^{T} r}

and the eigenvalues of the matrix

A

are

λ_{j} = (1 - \cos (π j / n))

, for

j = 1, 2, \dots, n - 1

However bounds on the distribution can be obtained, the lower bound being

d_{l} = \frac{\sum_{i = 1}^{n - p} λ_{i} u_{i}^{2}}{\sum_{i = 1}^{n - p} u_{i}^{2}}

and the upper bound being

d_{u} = \frac{\sum_{i = 1}^{n - p} λ_{i - 1 + p} u_{i}^{2}}{\sum_{i = 1}^{n - p} u_{i}^{2}},

where the

u_{i}

are independent standard Normal variables. The lower tail probabilities associated with these bounds,

p_{l}

and

p_{u}

, are computed by g01epf. The interpretation of the bounds is that, for a test of size (significance)

α

, if

p_{l} \leq α

the test is significant, if

p_{u} > α

the test is not significant, while if

p_{l} > α

and

p_{u} \leq α

no conclusion can be reached.

The above probabilities are for the usual test of positive auto-correlation. If the alternative of negative auto-correlation is required, then a call to g01epf should be made with the argument d taking the value of

4 - d

; see Newbold (1988).

4 References

Durbin J and Watson G S (1950) Testing for serial correlation in least squares regression. I Biometrika 37 409–428

Durbin J and Watson G S (1951) Testing for serial correlation in least squares regression. II Biometrika 38 159–178

Durbin J and Watson G S (1971) Testing for serial correlation in least squares regression. III Biometrika 58 1–19

Granger C W J and Newbold P (1986) Forecasting Economic Time Series (2nd Edition) Academic Press

Newbold P (1988) Statistics for Business and Economics Prentice–Hall

5 Arguments

1: $n$ – Integer Input: On entry: $n$ , the number of residuals.

Constraint: $n > ip$ .
2: $ip$ – Integer Input: On entry: $p$ , the number of independent variables in the regression model, including the mean.

Constraint: $ip \geq 1$ .
3: $res (n)$ – Real (Kind=nag_wp) array Input: On entry: the residuals, $r_{1}, r_{2}, \dots, r_{n}$ .

Constraint: the mean of the residuals $\leq \sqrt{ε}$ , where $ε = machine precision$ .
4: $d$ – Real (Kind=nag_wp) Output: On exit: the Durbin–Watson statistic, $d$ .
5: $pdl$ – Real (Kind=nag_wp) Output: On exit: lower bound for the significance of the Durbin–Watson statistic, $p_{l}$ .
6: $pdu$ – Real (Kind=nag_wp) Output: On exit: upper bound for the significance of the Durbin–Watson statistic, $p_{u}$ .
7: $work (n)$ – Real (Kind=nag_wp) array Workspace
8: $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 $- 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, $ip = ⟨ value ⟩$ .
Constraint: $ip \geq 1$ .

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

$ifail = 2$: On entry, mean of $res = ⟨ value ⟩$ .
Constraint: the mean of the residuals $\leq \sqrt{ε}$ , where $ε = machine precision$ .

$ifail = 3$: On entry, all residuals are identical.

$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

The probabilities are computed to an accuracy of at least

4

decimal places.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

g02fcf 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

If the exact probabilities are required, then the first

n - p

eigenvalues of

H A

can be computed and g01jdf used to compute the required probabilities with the argument c set to

0.0

and the argument d set to the Durbin–Watson statistic

d

10 Example

A set of

10

residuals are read in and the Durbin–Watson statistic along with the probability bounds are computed and printed.

g02fc: FL CL CPP AD PY MB

NAG FL Interfaceg02fcf (linregm_​stat_​durbwat)

▸▿ 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
g02fcf (linregm_stat_durbwat)