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

C Header Interface

#include nagmk26.h

void

g02dgf_ ( const char *weight, const Integer *n, const double wt[], double *rss, const Integer *ip, const Integer *irank, double cov[], double q[], const Integer *ldq, const logical *svd, const double p[], const double y[], double b[], double se[], double res[], const double wk[], Integer *ifail, const Charlen length_weight)

3

Description

g02dgf uses the results given by g02daf to fit the same set of independent variables to a new dependent variable.

g02daf computes a

Q R

decomposition of the matrix of

p

independent variables and also, if the model is not of full rank, a singular value decomposition (SVD). These results can be used to compute estimates of the arguments for a general linear model with a new dependent variable. The

Q R

decomposition leads to the formation of an upper triangular

p

p

matrix

R

and an

n

n

orthogonal matrix

Q

. In addition the vector

c = Q^{T} y

(or

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

) is computed. For a new dependent variable,

y_{new}

, g02dgf computes a new value of

c = Q^{T} y_{new}

Q^{T} W^{1 / 2} y_{new}

R

is of full rank, then the least squares parameter estimates,

\hat{β}

, are the solution to

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

where

c_{1}

is the first

p

elements of

c

R

is not of full rank, then g02daf will have computed an SVD of

R

R = Q_{*} (\begin{array}{l} D & 0 \\ 0 & 0 \end{array}) 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 = (P_{1} P_{0})

, and

Q_{*_{1}}

being the first

k

columns of

Q_{*}

. Details of the SVD are made available by g02daf in the form of the matrix

P^{*}

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

The matrix

Q_{*}

is made available through the workspace of g02daf.

In addition to parameter estimates, the new residuals are computed and the variance-covariance matrix of the parameter estimates are found by scaling the variance-covariance matrix for the original regression.

4

References

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

Searle S R (1971) Linear Models Wiley

5

Arguments

1: $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'

2: $n$ – IntegerInput

On entry:

n

, the number of observations.

Constraint:

n \geq ip

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

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

n

weight ='W'

, and at least

1

otherwise.

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.

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

4: $rss$ – Real (Kind=nag_wp)Input/Output

On entry: the residual sum of squares for the original dependent variable.

On exit: the residual sum of squares for the new dependent variable.

Constraint:

rss > 0.0

5: $ip$ – IntegerInput

On entry:

p

, the number of independent variables (including the mean if fitted).

Constraint:

1 \leq ip \leq n

6: $irank$ – IntegerInput

On entry: the rank of the independent variables, as given by g02daf.

Constraint:

irank > 0

, and if

svd = .FALSE.

, then

irank = ip

, else

irank \leq ip

7: $cov (ip \times (ip + 1) / 2)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: the covariance matrix of the parameter estimates as given by g02daf.

On exit: 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))

8: $q (ldq, ip + 1)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: the results of the

Q R

decomposition as returned by g02daf.

On exit: the first column of q contains the new values of

c

, the remainder of q will be unchanged.

9: $ldq$ – IntegerInput

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

Constraint:

ldq \geq n

10: $svd$ – LogicalInput

On entry: indicates if a singular value decomposition was used by g02daf.

$svd = .TRUE.$: A singular value decomposition was used by g02daf.
$svd = .FALSE.$: A singular value decomposition was not used by g02daf.

11: $p (*)$ – Real (Kind=nag_wp) arrayInput

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

ip

svd = .FALSE.

, and at least

ip \times ip + 2 \times ip

otherwise.

On entry: details of the

Q R

decomposition and SVD, if used, as returned in array p by g02daf.

svd = .FALSE.

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

Q R

decomposition (see f08aef (dgeqrf) for details).

svd = .TRUE.

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

Q R

decomposition (see f08aef (dgeqrf) for details) and the next

ip \times ip + ip

elements of p contain details of the singular value decomposition.

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

On entry: the new dependent variable,

y_{new}

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

On exit: the least squares estimates of the parameters of the regression model,

\hat{β}

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

On exit: the standard error of the estimates of the parameters.

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

On exit: the residuals for the new regression model.

16: $wk (5 \times (ip - 1) + ip \times ip)$ – Real (Kind=nag_wp) arrayInput

On entry: if

svd = .TRUE.

, wk must be unaltered from the previous call to g02daf or g02dgf.

svd = .FALSE.

, wk is used as workspace.

17: $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, $irank = 〈value〉$ .
Constraint: $irank > 0$ .

On entry, $irank = 〈value〉$ and $ip = 〈value〉$ .
Constraint: if $svd = .FALSE.$ , $irank = ip$ .

On entry, $irank = 〈value〉$ and $ip = 〈value〉$ .
Constraint: if $svd = .TRUE.$ , $irank \leq ip$ .

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

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

On entry, $rss = 〈value〉$ .
Constraint: $rss > 0.0$ .

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

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

$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 same accuracy as g02daf is obtained.

8

Parallelism and Performance

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

g02dgf 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 values of the leverages,

h_{i}

, are unaltered by a change in the dependent variable so a call to g02faf can be made using the value of h from g02daf.

10

Example

A dataset consisting of

12

observations with four independent variables and two dependent variables are read in. A model with all four independent variables is fitted to the first dependent variable by g02daf and the results printed. The model is then fitted to the second dependent variable by g02dgf and those results printed.

NAG Library Routine Document

g02dgf (linregm_fit_newvar)

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