NAG FL Interface
g02fcf (linregm_stat_durbwat)
1
Purpose
g02fcf calculates the Durbin–Watson statistic, for a set of residuals, and the upper and lower bounds for its significance.
2
Specification
Fortran Interface
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) |
|
C++ Header Interface
#include <nag.h> extern "C" {
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
where |
is a vector of length of the dependent variable,
is an by matrix of the independent variables,
is a vector of length of unknown parameters, |
and |
is a vector of length of unknown random errors. |
The residuals are given by
and the fitted values,
, can be written as
for an
by
matrix
. 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
can be considered as a time series, the Durbin–Watson test can be used to test for serial correlation in the
, see
Durbin and Watson (1950),
Durbin and Watson (1951) and
Durbin and Watson (1971).
The Durbin–Watson statistic is
Positive serial correlation in the
will lead to a small value of
while for independent errors
will be close to
. Durbin and Watson show that the exact distribution of
depends on the eigenvalues of the matrix
where the matrix
is such that
can be written as
and the eigenvalues of the matrix
are
, for
.
However bounds on the distribution can be obtained, the lower bound being
and the upper bound being
where the
are independent standard Normal variables. The lower tail probabilities associated with these bounds,
and
, are computed by
g01epf. The interpretation of the bounds is that, for a test of size (significance)
, if
the test is significant, if
the test is not significant, while if
and
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
; 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:
– Integer
Input
-
On entry: , the number of residuals.
Constraint:
.
-
2:
– Integer
Input
-
On entry: , the number of independent variables in the regression model, including the mean.
Constraint:
.
-
3:
– Real (Kind=nag_wp) array
Input
-
On entry: the residuals, .
Constraint:
the mean of the residuals , where .
-
4:
– Real (Kind=nag_wp)
Output
-
On exit: the Durbin–Watson statistic, .
-
5:
– Real (Kind=nag_wp)
Output
-
On exit: lower bound for the significance of the Durbin–Watson statistic, .
-
6:
– Real (Kind=nag_wp)
Output
-
On exit: upper bound for the significance of the Durbin–Watson statistic, .
-
7:
– Real (Kind=nag_wp) array
Workspace
-
-
8:
– Integer
Input/Output
-
On entry:
ifail must be set to
,
or
to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of means that an error message is printed while a value of means that it is not.
If halting is not appropriate, the value
or
is recommended. If message printing is undesirable, then the value
is recommended. Otherwise, the value
is recommended.
When the value or is used it is essential to test the value of ifail on exit.
On exit:
unless the routine detects an error or a warning has been flagged (see
Section 6).
6
Error Indicators and Warnings
If on entry
or
, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Errors or warnings detected by the routine:
-
On entry, .
Constraint: .
On entry, and .
Constraint: .
-
On entry, mean of .
Constraint: the mean of the residuals , where .
-
On entry, all residuals are identical.
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.
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.
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 decimal places.
8
Parallelism and Performance
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.
If the exact probabilities are required, then the first
eigenvalues of
can be computed and
g01jdf used to compute the required probabilities with the argument
c set to
and the argument
d set to the Durbin–Watson statistic
.
10
Example
A set of residuals are read in and the Durbin–Watson statistic along with the probability bounds are computed and printed.
10.1
Program Text
10.2
Program Data
10.3
Program Results