NAG Library Routine Document

g02daf performs a general multiple linear regression when the independent variables may be linearly dependent. Parameter estimates, standard errors, residuals and influence statistics are computed. g02daf may be used to perform a weighted regression.

2

Specification

Fortran Interface

Subroutine g02daf (

mean, weight, n, x, ldx, m, isx, ip, y, wt, rss, idf, b, se, cov, res, h, q, ldq, svd, irank, p, tol, wk, ifail)

Integer, Intent (In)	::	n, ldx, m, isx(m), ip, ldq
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	idf, irank
Real (Kind=nag_wp), Intent (In)	::	x(ldx,m), y(n), wt(*), tol
Real (Kind=nag_wp), Intent (Inout)	::	q(ldq,ip+1)
Real (Kind=nag_wp), Intent (Out)	::	rss, b(ip), se(ip), cov(ip(ip+1)/2), res(n), h(n), p(2ip+ipip), wk(max(2,5(ip-1)+ip*ip))
Logical, Intent (Out)	::	svd
Character (1), Intent (In)	::	mean, weight

C Header Interface

#include <nagmk26.h>

void

g02daf_ (const char *mean, const char *weight, const Integer *n, const double x[], const Integer *ldx, const Integer *m, const Integer isx[], const Integer *ip, const double y[], const double wt[], double *rss, Integer *idf, double b[], double se[], double cov[], double res[], double h[], double q[], const Integer *ldq, logical *svd, Integer *irank, double p[], const double *tol, double wk[], Integer *ifail, const Charlen length_mean, const Charlen length_weight)

3

Description

The general linear regression model is defined by

y = X β + ε,

where

$y$ is a vector of $n$ observations on the dependent variable,
$X$ is an $n$ by $p$ matrix of the independent variables of column rank $k$ ,
$β$ is a vector of length $p$ of unknown parameters, and
$ε$ is a vector of length $n$ of unknown random errors such that $var ε = V σ^{2}$ , where $V$ is a known diagonal matrix.

V = I

, the identity matrix, then least squares estimation is used. If

V \neq I

, then for a given weight matrix

W \propto V^{- 1}

, weighted least squares estimation is used.

The least squares estimates

\hat{β}

of the parameters

β

minimize

{(y - X β)}^{T} (y - X β)

while the weighted least squares estimates minimize

{(y - X β)}^{T} W (y - X β)

g02daf finds a

Q R

decomposition of

X

(or

W^{1 / 2} X

in weighted case), i.e.,

X = Q R^{*} (or W^{1 / 2} X = Q R^{*}),

where

R^{*} = (\begin{matrix} R \\ 0 \end{matrix})

and

R

is a

p

p

upper triangular matrix and

Q

is an

n

n

orthogonal matrix. If

R

is of full rank, then

\hat{β}

is the solution to

R \hat{β} = c_{1},

where

c = Q^{T} y

(or

Q^{T} W^{1 / 2} y

) and

c_{1}

is the first

p

elements of

c

. If

R

is not of full rank a solution is obtained by means of a singular value decomposition (SVD) of

R

R = Q_{*} (\begin{matrix} D & 0 \\ 0 & 0 \end{matrix}) P^{T},

where

D

is a

k

k

diagonal matrix with nonzero diagonal elements,

k

being the rank of

R

, and

Q_{*}

and

P

are

p

p

orthogonal matrices. This gives the solution

\hat{β} = P_{1} D^{- 1} Q_{*_{1}}^{T} c_{1},

P_{1}

being the first

k

columns of

P

, i.e.,

P = (\begin{matrix} P_{1} & P_{0} \end{matrix})

, and

Q_{*_{1}}

being the first

k

columns of

Q_{*}

Details of the SVD, are made available, in the form of the matrix

P^{*}

P^{*} = (\begin{matrix} D^{- 1} P_{1}^{T} \\ P_{0}^{T} \end{matrix}) .

This will be only one of the possible solutions. Other estimates may be obtained by applying constraints to the parameters. These solutions can be obtained by using g02dkf after using g02daf. Only certain linear combinations of the parameters will have unique estimates; these are known as estimable functions.

The fit of the model can be examined by considering the residuals,

r_{i} = y_{i} - \hat{y}

, where

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

are the fitted values. The fitted values can be written as

H y

for an

n

n

matrix

H

. The

i

th diagonal elements of

H

h_{i}

, give a measure of the influence of the

i

th values of the independent variables on the fitted regression model. The values

h_{i}

are sometimes known as leverages. Both

r_{i}

and

h_{i}

are provided by g02daf.

The output of g02daf also includes

\hat{β}

, the residual sum of squares and associated degrees of freedom,

(n - k)

, the standard errors of the parameter estimates and the variance-covariance matrix of the parameter estimates.

In many linear regression models the first term is taken as a mean term or an intercept, i.e.,

X_{i, 1} = 1

, for

i = 1, 2, \dots, n

. This is provided as an option. Also only some of the possible independent variables are required to be included in a model, a facility to select variables to be included in the model is provided.

Details of the

Q R

decomposition and, if used, the SVD, are made available. These allow the regression to be updated by adding or deleting an observation using g02dcf, adding or deleting a variable using g02def and g02dff or estimating and testing an estimable function using g02dnf.

4

References

Cook R D and Weisberg S (1982) Residuals and Influence in Regression Chapman and Hall

Draper N R and Smith H (1985) Applied Regression Analysis (2nd Edition) Wiley

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

Hammarling S (1985) The singular value decomposition in multivariate statistics SIGNUM Newsl. 20(3) 2–25

McCullagh P and Nelder J A (1983) Generalized Linear Models Chapman and Hall

Searle S R (1971) Linear Models Wiley

5

Arguments

1: $mean$ – Character(1)Input

On entry: indicates if a mean term is to be included.

$mean ='M'$: A mean term, intercept, will be included in the model.
$mean ='Z'$: The model will pass through the origin, zero-point.

Constraint:

mean ='M'

'Z'

2: $weight$ – Character(1)Input

On entry: indicates if weights are to be used.

$weight ='U'$: Least squares estimation is used.
$weight ='W'$: Weighted least squares is used and weights must be supplied in array wt.

Constraint:

weight ='U'

'W'

3: $n$ – IntegerInput

On entry:

n

, the number of observations.

Constraint:

n \geq 2

4: $x (ldx, m)$ – Real (Kind=nag_wp) arrayInput

On entry:

x (i, j)

must contain the

i

th observation for the

j

th independent variable, for

i = 1, 2, \dots, n

and

j = 1, 2, \dots, m

5: $ldx$ – IntegerInput

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

Constraint:

ldx \geq n

6: $m$ – IntegerInput

On entry:

m

, the total number of independent variables in the dataset.

Constraint:

m \geq 1

7: $isx (m)$ – Integer arrayInput

On entry: indicates which independent variables are to be included in the model.

$isx (j) > 0$: The variable contained in the $j$ th column of x is included in the regression model.

Constraints:

$isx (j) \geq 0$ , for $j = 1, 2, \dots, m$ ;
if $mean ='M'$ , exactly $ip - 1$ values of isx must be $> 0$ ;
if $mean ='Z'$ , exactly ip values of isx must be $> 0$ .

8: $ip$ – IntegerInput

On entry: the number of independent variables in the model, including the mean or intercept if present.

Constraints:

if $mean ='M'$ , $1 \leq ip \leq m + 1$ ;
if $mean ='Z'$ , $1 \leq ip \leq m$ ;
otherwise $1 \leq ip \leq n$ .

9: $y (n)$ – Real (Kind=nag_wp) arrayInput

On entry:

y

, the observations on the dependent variable.

10: $wt (*)$ – Real (Kind=nag_wp) arrayInput

Note: the dimension of the array wt must be at least

n

weight ='W'

On entry: if

weight ='W'

, wt must contain the weights to be used in the weighted regression.

wt (i) = 0.0

, the

i

th observation is not included in the model, in which case the effective number of observations is the number of observations with nonzero weights. The values of res and h will be set to zero for observations with zero weights.

weight ='U'

, wt is not referenced and the effective number of observations is

n

Constraint: if

weight ='W'

wt (i) \geq 0.0

, for

i = 1, 2, \dots, n

11: $rss$ – Real (Kind=nag_wp)Output

On exit: the residual sum of squares for the regression.

12: $idf$ – IntegerOutput

On exit: the degrees of freedom associated with the residual sum of squares.

13: $b (ip)$ – Real (Kind=nag_wp) arrayOutput

On exit:

b (i)

i = 1, 2, \dots, ip

contains the least squares estimates of the parameters of the regression model,

\hat{β}

mean ='M'

b (1)

will contain the estimate of the mean parameter and

b (i + 1)

will contain the coefficient of the variable contained in column

j

of x, where

isx (j)

is the

i

th positive value in the array isx.

mean ='Z'

b (i)

will contain the coefficient of the variable contained in column

j

of x, where

isx (j)

is the

i

th positive value in the array isx.

14: $se (ip)$ – Real (Kind=nag_wp) arrayOutput

On exit:

se (i)

i = 1, 2, \dots, ip

contains the standard errors of the ip parameter estimates given in b.

15: $cov (ip \times (ip + 1) / 2)$ – Real (Kind=nag_wp) arrayOutput

On exit: the first

ip \times (ip + 1) / 2

elements of cov contain the upper triangular part of the variance-covariance matrix of the ip parameter estimates given in b. They are stored packed by column, i.e., the covariance between the parameter estimate given in

b (i)

and the parameter estimate given in

b (j)

j \geq i

, is stored in

cov (j \times (j - 1) / 2 + i)

16: $res (n)$ – Real (Kind=nag_wp) arrayOutput

On exit: the (weighted) residuals,

r_{i}

, for

i = 1, 2, \dots, n

17: $h (n)$ – Real (Kind=nag_wp) arrayOutput

On exit: the diagonal elements of

H

h_{i}

, for

i = 1, 2, \dots, n

18: $q (ldq, ip + 1)$ – Real (Kind=nag_wp) arrayOutput

On exit: the results of the

Q R

decomposition:

the first column of q contains $c$ ;
the upper triangular part of columns $2$ to $ip + 1$ contain the $R$ matrix;
the strictly lower triangular part of columns $2$ to $ip + 1$ contain details of the $Q$ matrix.

19: $ldq$ – IntegerInput

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

Constraint:

ldq \geq n

20: $svd$ – LogicalOutput

On exit: if a singular value decomposition has been performed then svd will be .TRUE., otherwise svd will be .FALSE..

21: $irank$ – IntegerOutput

On exit: the rank of the independent variables.

svd = .FALSE.

irank = ip

svd = .TRUE.

, irank is an estimate of the rank of the independent variables.

irank is calculated as the number of singular values greater that

tol \times

(largest singular value). It is possible for the SVD to be carried out but irank to be returned as ip.

22: $p (2 \times ip + ip \times ip)$ – Real (Kind=nag_wp) arrayOutput

On exit: details of the

Q R

decomposition and SVD if used.

svd = .FALSE.

, only the first ip elements of p are used these will contain the zeta values for the

Q R

decomposition (see f08aef (dgeqrf) for details).

svd = .TRUE.

, the first ip elements of p will contain the zeta values for the

Q R

decomposition (see f08aef (dgeqrf) for details) and the next ip elements of p contain singular values. The following ip by ip elements contain the matrix

P^{*}

stored by columns.

23: $tol$ – Real (Kind=nag_wp)Input

On entry: the value of tol is used to decide if the independent variables are of full rank and if not what is the rank of the independent variables. The smaller the value of tol the stricter the criterion for selecting the singular value decomposition. If

tol = 0.0

, the singular value decomposition will never be used; this may cause run time errors or inaccurate results if the independent variables are not of full rank.

Suggested value:

tol = 0.000001

Constraint:

tol \geq 0.0

24: $wk (\max (2, 5 \times (ip - 1) + ip \times ip))$ – Real (Kind=nag_wp) arrayOutput

On exit: if on exit

svd = .TRUE.

, wk contains information which is needed by g02dgf; otherwise wk is used as workspace.

25: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 or 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation 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, $ip = 〈value〉$ .
Constraint: $ip \geq 1$ .

On entry, $ip = 〈value〉$ and $n = 〈value〉$ .
Constraint: $ip \leq n$ .

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

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

On entry, $m = 〈value〉$ .
Constraint: $m \geq 1$ .

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

On entry, $tol = 〈value〉$ .
Constraint: $tol \geq 0.0$ .

$ifail = 2$: On entry, $mean = 〈value〉$ .
Constraint: $mean ='M'$ or $'Z'$ .

On entry, $weight = 〈value〉$ .
Constraint: $weight ='U'$ or $'W'$ .

$ifail = 3$: On entry, $wt (〈value〉) < 0.0$ .
Constraint: $wt (i) \geq 0.0$ , for $i = 1, 2, \dots, n$ .

$ifail = 4$: On entry, $ip = 〈value〉$ .
Constraint: ip must be compatible with the number of nonzero elements in isx.

On entry, $isx (〈value〉) < 0$ .
Constraint: $isx (i) \geq 0.0$ , for $i = 1, 2, \dots, m$ .

$ifail = 5$: The degrees of freedom for the residuals are zero, i.e., the designated number of arguments is equal to the effective number of observations. In this case the parameter estimates will be returned along with the diagonal elements of $H$ , but neither standard errors nor the variance-covariance matrix will be calculated.

$ifail = 6$: SVD solution failed to converge.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

The accuracy of g02daf is closely related to the accuracy of f02wuf and f08aef (dgeqrf). These routine documents should be consulted.

8

Parallelism and Performance

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

g02daf 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

Standardized residuals and further measures of influence can be computed using g02faf. g02faf requires, in particular, the results stored in res and h.

10

Example

Data from an experiment with four treatments and three observations per treatment are read in. The treatments are represented by dummy (

0 - 1

) variables. An unweighted model is fitted with a mean included in the model. g02buf is then called to calculate the total sums of squares and the coefficient of determination (

R_{2}

), adjusted

R_{2}

and Akaike's information criteria (AIC) are calculated.

NAG Library Routine Document

g02daf (linregm_fit)

▸▿ 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

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