g02chf performs a multiple linear regression with no constant on a set of variables whose sums of squares and cross-products about zero and correlation-like coefficients are given.

2 Specification

Fortran Interface

Subroutine g02chf (

n, k1, k, sspz, ldsspz, rz, ldrz, result, coef, ldcoef, rznv, ldrznv, cz, ldcz, wkz, ldwkz, ifail)

Integer, Intent (In)	::	n, k1, k, ldsspz, ldrz, ldcoef, ldrznv, ldcz, ldwkz
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	sspz(ldsspz,k+1)
Real (Kind=nag_wp), Intent (Inout)	::	rz(ldrz,k+1), coef(ldcoef,3), rznv(ldrznv,k), cz(ldcz,k), wkz(ldwkz,k)
Real (Kind=nag_wp), Intent (Out)	::	result(13)

C Header Interface

#include <nag.h>

void

g02chf_ (const Integer *n, const Integer *k1, const Integer *k, const double sspz[], const Integer *ldsspz, double rz[], const Integer *ldrz, double result[], double coef[], const Integer *ldcoef, double rznv[], const Integer *ldrznv, double cz[], const Integer *ldcz, double wkz[], const Integer *ldwkz, Integer *ifail)

The routine may be called by the names g02chf or nagf_correg_linregm_coeffs_noconst.

3 Description

g02chf fits a curve of the form

y = b_{1} x_{1} + b_{2} x_{2} + \dots + b_{k} x_{k}

to the data points

\begin{matrix} (x_{11}, x_{21}, \dots, x_{k 1}, y_{1}) \\ (x_{12}, x_{22}, \dots, x_{k 2}, y_{2}) \\ ⋮ \\ (x_{1 n}, x_{2 n}, \dots, x_{k n}, y_{n}) \end{matrix}

such that

y_{i} = b_{1} x_{1 i} + b_{2} x_{2 i} + \dots + b_{k} x_{k i} + e_{i}, i = 1, 2, \dots, n .

The routine calculates the regression coefficients,

b_{1}, b_{2}, \dots, b_{k}

, (and various other statistical quantities) by minimizing

\sum_{i = 1}^{n} e_{i}^{2} .

The actual data values

(x_{1 i}, x_{2 i}, \dots, x_{k i}, y_{i})

are not provided as input to the routine. Instead, input to the routine consists of:

(i)The number of cases, $n$ , on which the regression is based.
(ii)The total number of variables, dependent and independent, in the regression, $(k + 1)$ .
(iii)The number of independent variables in the regression, $k$ .
(iv)The $(k + 1)$ by $(k + 1)$ matrix $[{\tilde{S}}_{i j}]$ of sums of squares and cross-products about zero of all the variables in the regression; the terms involving the dependent variable, $y$ , appear in the $(k + 1)$ th row and column.
(v)The $(k + 1)$ by $(k + 1)$ matrix $[{\tilde{R}}_{i j}]$ of correlation-like coefficients for all the variables in the regression; the correlations involving the dependent variable, $y$ , appear in the $(k + 1)$ th row and column.

The quantities calculated are:

(a)The inverse of the $k$ by $k$ partition of the matrix of correlation-like coefficients, $[{\tilde{R}}_{i j}]$ , involving only the independent variables. The inverse is obtained using an accurate method which assumes that this sub-matrix is positive definite (see Section 9).
(b)The modified matrix, $C = [c_{i j}]$ , where
$c_{i j} = \frac{{\tilde{R}}_{i j} {\tilde{r}}^{i j}}{{\tilde{S}}_{i j}}, i, j = 1, 2, \dots, k,$
where ${\tilde{r}}^{i j}$ is the $(i, j)$ th element of the inverse matrix of $[{\tilde{R}}_{i j}]$ as described in (a) above. Each element of $C$ is thus the corresponding element of the matrix of correlation-like coefficients multiplied by the corresponding element of the inverse of this matrix, divided by the corresponding element of the matrix of sums of squares and cross-products about zero.
(c)The regression coefficients:
$b_{i} = \sum_{j = 1}^{k} c_{i j} {\tilde{S}}_{j (k + 1)}, i = 1, 2, \dots, k,$
where ${\tilde{S}}_{j (k + 1)}$ is the sum of cross-products about zero for the independent variable $x_{j}$ and the dependent variable $y$ .
(d)The sum of squares attributable to the regression, $S S R$ , the sum of squares of deviations about the regression, $S S D$ , and the total sum of squares, $S S T$ :
- $S S T = {\tilde{S}}_{(k + 1) (k + 1)}$ , the sum of squares about zero for the dependent variable, $y$ ;
- $S S R = \sum_{j = 1}^{k} b_{j} {\tilde{S}}_{j (k + 1)}; S S D = S S T - S S R$ .
(e)The degrees of freedom attributable to the regression, $D F R$ , the degrees of freedom of deviations about the regression, $D F D$ , and the total degrees of freedom, $D F T$ :
$D F R = k; D F D = n - k; D F T = n .$
(f)The mean square attributable to the regression, $M S R$ , and the mean square of deviations about the regression, $M S D$ :
$M S R = S S R / D F R; M S D = S S D / D F D .$
(g)The $F$ value for the analysis of variance:
$F = M S R / M S D .$
(h)The standard error estimate:
$s = \sqrt{M S D} .$
(i)The coefficient of multiple correlation, $R$ , the coefficient of multiple determination, $R^{2}$ , and the coefficient of multiple determination corrected for the degrees of freedom, ${\bar{R}}^{2}$ :
$R = \sqrt{1 - \frac{S S D}{S S T}}; R^{2} = 1 - \frac{S S D}{S S T}; {\bar{R}}^{2} = 1 - \frac{S S D \times D F T}{S S T \times D F D} .$
(j)The standard error of the regression coefficients:
$s e (b_{i}) = \sqrt{M S D \times c_{i i}}, i = 1, 2, \dots, k .$
(k)The $t$ values for the regression coefficients:
$t (b_{i}) = \frac{b_{i}}{s e (b_{i})}, i = 1, 2, \dots, k .$

4 References

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

5 Arguments

1: $n$ – Integer Input

On entry:

n

, the number of cases used in calculating the sums of squares and cross-products and correlation-like coefficients.

2: $k1$ – Integer Input

On entry: is no longer required by g02chf but is retained for backwards compatibility.

3: $k$ – Integer Input

On entry:

k

, the number of independent variables in the regression.

Constraint:

1 \leq k \leq n - 1

4: $sspz (ldsspz, k + 1)$ – Real (Kind=nag_wp) array Input

On entry:

sspz (i, j)

must be set to

{\tilde{S}}_{i j}

, the sum of cross-products about zero for the

i

th and

j

th variables, for

i = 1, 2, \dots, k + 1

and

j = 1, 2, \dots, k + 1

; terms involving the dependent variable appear in row

k + 1

and column

k + 1

5: $ldsspz$ – Integer Input

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

Constraint:

ldsspz \geq k + 1

6: $rz (ldrz, k + 1)$ – Real (Kind=nag_wp) array Input

On entry:

rz (i, j)

must be set to

{\tilde{R}}_{i j}

, the correlation-like coefficient for the

i

th and

j

th variables, for

i = 1, 2, \dots, k + 1

and

j = 1, 2, \dots, k + 1

; coefficients involving the dependent variable appear in row

k + 1

and column

k + 1

7: $ldrz$ – Integer Input

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

Constraint:

ldrz \geq k + 1

8: $result (13)$ – Real (Kind=nag_wp) array Output

On exit: the following information:

$result (1)$	$S S R$ , the sum of squares attributable to the regression;
$result (2)$	$D F R$ , the degrees of freedom attributable to the regression;
$result (3)$	$M S R$ , the mean square attributable to the regression;
$result (4)$	$F$ , the $F$ value for the analysis of variance;
$result (5)$	$S S D$ , the sum of squares of deviations about the regression;
$result (6)$	$D F D$ , the degrees of freedom of deviations about the regression;
$result (7)$	$M S D$ , the mean square of deviations about the regression;
$result (8)$	$S S T$ , the total sum of squares;
$result (9)$	$D F T$ , the total degrees of freedom;
$result (10)$	$s$ , the standard error estimate;
$result (11)$	$R$ , the coefficient of multiple correlation;
$result (12)$	$R^{2}$ , the coefficient of multiple determination;
$result (13)$	${\bar{R}}^{2}$ , the coefficient of multiple determination corrected for the degrees of freedom.

9: $coef (ldcoef, 3)$ – Real (Kind=nag_wp) array Output

On exit: for

i = 1, 2, \dots, k

, the following information:

$coef (i, 1)$: $b_{i}$ , the regression coefficient for the $i$ th variable.
$coef (i, 2)$: $s e (b_{i})$ , the standard error of the regression coefficient for the $i$ th variable.
$coef (i, 3)$: $t (b_{i})$ , the $t$ value of the regression coefficient for the $i$ th variable.

10: $ldcoef$ – Integer Input

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

Constraint:

ldcoef \geq k

11: $rznv (ldrznv, k)$ – Real (Kind=nag_wp) array Output

On exit: the inverse of the matrix of correlation-like coefficients for the independent variables; that is, the inverse of the matrix consisting of the first

k

rows and columns of rz.

12: $ldrznv$ – Integer Input

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

Constraint:

ldrznv \geq k

13: $cz (ldcz, k)$ – Real (Kind=nag_wp) array Output

On exit: the modified inverse matrix,

C

, where

cz (i, j) = \frac{rz (i, j) \times rznv (i, j)}{sspz (i, j)}, i, j = 1, 2, \dots, k .

14: $ldcz$ – Integer Input

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

Constraint:

ldcz \geq k

15: $wkz (ldwkz, k)$ – Real (Kind=nag_wp) array Workspace

16: $ldwkz$ – Integer Input

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

Constraint:

ldwkz \geq k

17: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

- 1

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

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, $k = 〈value〉$ .
Constraint: $k \geq 1$ .

$ifail = 3$: On entry, $n = 〈value〉$ and $k = 〈value〉$ .
Constraint: $n \geq k + 1$ .

$ifail = 4$: On entry, $ldcoef = 〈value〉$ and $k = 〈value〉$ .
Constraint: $ldcoef \geq k$ .

On entry, $ldcz = 〈value〉$ and $k = 〈value〉$ .
Constraint: $ldcz \geq k$ .

On entry, $ldrz = 〈value〉$ and $k = 〈value〉$ .
Constraint: $ldrz \geq k + 1$ .

On entry, $ldrznv = 〈value〉$ and $k = 〈value〉$ .
Constraint: $ldrznv \geq k$ .

On entry, $ldsspz = 〈value〉$ and $k = 〈value〉$ .
Constraint: $ldsspz \geq k + 1$ .

On entry, $ldwkz = 〈value〉$ and $k = 〈value〉$ .
Constraint: $ldwkz \geq k$ .

$ifail = 5$: The $K$ by $K$ partition of rz which requires inversion is not positive definite.

$ifail = 6$: The refinement following the actual inversion has failed. This indicates that the $k$ by $k$ partition of the matrix held in rz, which is to be inverted, is ill-conditioned. The use of g02daf, which employs a different numerical technique, may avoid the difficulty.

$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 accuracy of g02chf is almost entirely dependent on the accuracy of the matrix inversion method used. As g02chf works with the matrix of correlation coefficients rather than that of the sums of squares and cross-products of deviations from means all terms in the matrix being inverted are of a similar order and therefore the scope for computational error is reduced. An alternative, and potentially more numerically reliable, routine is g02daf. g02daf works directly with the data matrix and therefore avoids explicitly performing a matrix inversion. However, g02daf does not handle missing values, nor does it provide the same output as this routine.

If, in calculating

F

or any of the

t (b_{i})

(see Section 3), the numbers involved are such that the result would be outside the range of numbers which can be stored by the machine, then the answer is set to the largest quantity which can be stored as a real variable, by means of a call to x02alf.

8 Parallelism and Performance

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

g02chf 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

The time taken by g02chf depends on

k

This routine assumes that the matrix of correlation-like coefficients for the independent variables in the regression is positive definite; it fails if this is not the case.

This correlation matrix will in fact be positive definite whenever the correlation-like matrix and the sums of squares and cross-products (about zero) matrix have been formed either without regard to missing values, or by eliminating completely any cases involving missing values for any variable. If, however, these matrices are formed by eliminating cases with missing values from only those calculations involving the variables for which the values are missing, no such statement can be made, and the correlation-like matrix may or may not be positive definite. You should be aware of the possible dangers of using correlation matrices formed in this way (see the G02 Chapter Introduction), but if they nevertheless wish to carry out regressions using such matrices, this routine is capable of handling the inversion of such matrices, provided they are positive definite.

If a matrix is positive definite, its subsequent re-organisation by either of g02cef or g02cff will not affect this property and the new matrix can safely be used in this routine. Thus correlation matrices produced by any of g02bdf, g02bef, g02bkf or g02blf, even if subsequently modified by either g02cef or g02cff, can be handled by this routine.

It should be noted that the routine requires the dependent variable to be the last of the

k + 1

variables whose statistics are provided as input to the routine. If this variable is not correctly positioned in the original data, the means, standard deviations, sums of squares and cross-products about zero, and correlation-like coefficients can be manipulated by using g02cef or g02cff to reorder the variables as necessary.

10 Example

This example reads in the sums of squares and cross-products about zero, and correlation-like coefficients for three variables. A multiple linear regression with no constant is then performed with the third and final variable as the dependent variable. Finally the results are printed.

g02ch: FL CL CPP AD

NAG FL Interfaceg02chf (linregm_​coeffs_​noconst)

▸▿ 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
g02chf (linregm_coeffs_noconst)