NAG Library Routine Document

Integer, Intent (In)	::	n, iblock, nt, it(*), ldtabl, ldc, irdf
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	irep(nt)
Real (Kind=nag_wp), Intent (In)	::	y(n), tol
Real (Kind=nag_wp), Intent (Inout)	::	tabl(ldtabl,5), c(ldc,nt)
Real (Kind=nag_wp), Intent (Out)	::	gmean, bmean(abs(iblock)), tmean(nt), r(n), ef(nt), wk(3*nt)

C Header Interface

#include <nagmk26.h>

void

g04bbf_ (const Integer *n, const double y[], const Integer *iblock, const Integer *nt, const Integer it[], double *gmean, double bmean[], double tmean[], double tabl[], const Integer *ldtabl, double c[], const Integer *ldc, Integer irep[], double r[], double ef[], const double *tol, const Integer *irdf, double wk[], Integer *ifail)

3

Description

In a completely randomized design, experimental material is divided into a number of units, or plots, to which a treatment can be applied. In a randomized block design the units are grouped into blocks so that the variation within blocks is less than the variation between blocks. If every treatment is applied to one plot in each block it is a complete block design. If there are fewer plots per block than treatments then the design will be an incomplete block design and may be balanced or partially balanced.

For a completely randomized design, with

t

treatments and

n_{t}

plots per treatment, the linear model is

y_{i j} = μ + τ_{j} + e_{i j}, j = 1, 2, \dots, t ​ and ​ i = 1, 2, \dots, n_{j},

where

y_{i j}

is the

i

th observation for the

j

th treatment,

μ

is the overall mean,

τ_{j}

is the effect of the

j

th treatment and

e_{i j}

is the random error term. For a randomized block design, with

t

treatments and

b

blocks of

k

plots, the linear model is

y_{i j (l)} = μ + β_{i} + τ_{l} + e_{i j}, i = 1, 2, \dots, b, ​ j = 1, 2, \dots, k ​ and ​ l = 1, 2, \dots, t,

where

β_{i}

is the effect of the

i

th block and the

i j (l)

notation indicates that the

l

th treatment is applied to the

j

th plot in the

i

th block.

The completely randomized design gives rise to a one-way analysis of variance. The treatments do not have to be equally replicated, i.e., do not have to occur the same number of times. First the overall mean,

\hat{μ}

, is computed and subtracted from the observations to give

y_{i j}^{'} = y_{i j} - \hat{μ}

. The estimated treatment effects,

{\hat{τ}}_{j}

are then computed as the treatment means of the mean adjusted observations,

y_{i j}^{'}

, and the treatment sum of squares can be computed from the sum of squares of the treatment totals of the

y_{i j}^{'}

divided by the number of observations per treatment total,

n_{j}

. The final residuals are computed as

r_{i j} = y_{i j}^{'} - {\hat{τ}}_{j}

, and, from the residuals, the residual sum of squares is calculated.

For the randomized block design the mean is computed and subtracted from the observations to give

y_{i j (l)}^{'} = y_{i j (l)} - \hat{μ}

. The estimated block effects, ignoring treatment effects,

{\hat{β}}_{i}

, are then computed using the block means of the

y_{i j (l)}^{'}

and the unadjusted sum of squares computed as the sum of squared block totals for the

y_{i j (l)}^{'}

divided by number of plots per block,

k

. The block adjusted observations are then computed as

y_{i j (l)}^{''} = {y_{i}^{'} j}_{(l)} = {\hat{β}}_{i}

. In the case of the complete block design, with the same replication for each treatment within each block, the blocks and treatments are orthogonal, and so the treatment effects are estimated as the treatment means of the block adjusted observations,

y_{i j (l)}^{''}

. The treatment sum of squares is computed as the sum of squared treatment totals of the

y_{i j (l)}^{''}

divided by the number of replicates to the treatments,

r = b k / t

. Finally the residuals, and hence the residual sum of squares, are given by

r_{i j (l)} = y_{i j (l)}^{''} - {\hat{τ}}_{l}

For a design without the same replication for each treatment within each block the treatments and the blocks will not be orthogonal, so the treatments adjusted for blocks need to be computed. The adjusted treatment effects are found as the solution to the equations

(R - N N^{T} / k) \hat{τ} = q,

where

q

is the vector of the treatment totals for block adjusted observations,

y_{i j (l)}^{''}

R

is a diagonal matrix with

R_{l l}

equal to the number of times the

l

th treatment is replicated, and

n

is the

t

b

incidence matrix, with

N_{l j}

equal to the number of times treatment

l

occurs in block

j

. The solution to the equations can be written as

\hat{τ} = Ω q

where

Ω

is a generalized inverse of

(R - N N^{T} / k)

. The solution is found from the eigenvalue decomposition of

(R - N N^{T} / k)

. The residuals are first calculated by subtracting the estimated treatment effects from the block adjusted observations to give

r_{i j (l)}^{'} = y_{i j (l)}^{''} - {\hat{τ}}_{l}

. However, since only the unadjusted block effects have been removed and blocks and treatments are not orthogonal, the block means of the

r_{i j (l)}^{'}

have to be subtracted to give the correct residuals,

r_{i j (l)}

and residual sum of squares.

The mean squares are computed as the sum of squares divided by the degrees of freedom. The degrees of freedom for the unadjusted blocks is

b - 1

, for the completely randomized and the complete block designs the degrees of freedom for the treatments is

t - 1

. In the general case the degrees of freedom for treatments is the rank of the matrix

Ω

. The

F

-statistic given by the ratio of the treatment mean square to the residual mean square tests the hypothesis

H_{0} : τ_{1} = τ_{2} = \dots = τ_{t} = 0 .

The standard errors for the difference in treatment effects, or treatment means, for the completely randomized or the complete block designs, are given by:

se (τ_{j} - τ_{j *}) = (\frac{1}{n_{j}} + \frac{1}{n_{j *}}) s^{2}

where

s^{2}

is the residual mean square and

n_{j} = n_{j *} = b

in the complete block design. In the general case the variances of the treatment effects are given by

var (τ) = Ω s^{2}

from which the appropriate standard errors of the difference between treatment effects or the difference between adjusted means can be calculated.

In the complete block design all the information on the treatment effects is given by the within block analysis. In other designs there may be a loss of information due to the non-orthogonality of treatments and blocks. The efficiency of the within block analysis in these cases is given by the (canonical) efficiency factors, these are the nonzero eigenvalues of the matrix

(R - N N^{T} / k)

, divided by the number of replicates in the case of equal replication, or by the mean of the number of replicates in the unequally replicated case, see John (1987). If more than one eigenvalue is zero then the design is said to be disconnected and some treatments can only be compared using a between block analysis.

4

References

Cochran W G and Cox G M (1957) Experimental Designs Wiley

Davis O L (1978) The Design and Analysis of Industrial Experiments Longman

John J A (1987) Cyclic Designs Chapman and Hall

John J A and Quenouille M H (1977) Experiments: Design and Analysis Griffin

Searle S R (1971) Linear Models Wiley

5

Arguments

1: $n$ – IntegerInput

On entry: the number of observations.

Constraint:

n \geq 2

and if

abs (iblock) \geq 2

, n must be a multiple of

abs (iblock)

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

On entry: the observations in the order as described by iblock and nt.

3: $iblock$ – IntegerInput

On entry: indicates the block structure.

$abs (iblock) \leq 1$: There are no blocks, i.e., it is a completely randomized design.
$iblock \geq 2$: There are iblock blocks and the data should be input by blocks, i.e., y must contain the observations for block $1$ followed by the observations for block $2$ , etc.
$iblock \leq - 2$: There are $abs (iblock)$ blocks and the data is input in parallel with respect to blocks, i.e., $y (1)$ must contain the first observation for block $1$ , $y (2)$ must contain the first observation for block $2 \dots y (abs (iblock))$ must contain the first observation for block $abs (iblock), y (abs (iblock + 1))$ must contain the second observation for block $1$ , etc.

Constraint:

iblock = 1

2

- 2

4: $nt$ – IntegerInput

On entry: the number of treatments. If only blocks are required in the analysis then set

nt = 1

Constraints:

if $abs (iblock) \geq 2$ , $nt \geq 1$ ;
otherwise $nt \geq 2$ .

5: $it (*)$ – Integer arrayInput

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

n

nt \geq 2

, and at least

1

otherwise.

On entry:

it (i)

indicates which of the nt treatments plot

i

received, for

i = 1, 2, \dots, n

nt = 1

, it is not referenced.

Constraint:

1 \leq it (i) \leq nt

, for

i = 1, 2, \dots, n

6: $gmean$ – Real (Kind=nag_wp)Output

On exit: the grand mean,

\hat{μ}

7: $bmean (abs (iblock))$ – Real (Kind=nag_wp) arrayOutput

On exit: if

abs (iblock) \geq 2

bmean (j)

contains the mean for the

j

th block,

{\hat{β}}_{j}

, for

j = 1, 2, \dots, b

8: $tmean (nt)$ – Real (Kind=nag_wp) arrayOutput

On exit: if

nt \geq 2

tmean (l)

contains the (adjusted) mean for the

l

th treatment,

{\hat{μ}}^{*} + {\hat{τ}}_{l}

, for

l = 1, 2, \dots, t

, where

{\hat{μ}}^{*}

is the mean of the treatment adjusted observations,

y_{i j (l)} - {\hat{τ}}_{l}

9: $tabl (ldtabl, 5)$ – Real (Kind=nag_wp) arrayOutput

On exit: the analysis of variance table. Column 1 contains the degrees of freedom, column 2 the sum of squares, and where appropriate, column 3 the mean squares, column 4 the

F

-statistic and column 5 the significance level of the

F

-statistic. Row 1 is for Blocks, row 2 for Treatments, row 3 for Residual and row 4 for Total. Mean squares are computed for all but the Total row;

F

-statistics and significance are computed for Treatments and Blocks, if present. Any unfilled cells are set to zero.

10: $ldtabl$ – IntegerInput

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

Constraint:

ldtabl \geq 4

11: $c (ldc, nt)$ – Real (Kind=nag_wp) arrayOutput

On exit: if

nt \geq 2

, the upper triangular part of c contains the variance-covariance matrix of the treatment effects, the strictly lower triangular part contains the standard errors of the difference between two treatment effects (means), i.e.,

c (i, j)

contains the covariance of treatment

i

and

j

j \geq i

and the standard error of the difference between treatment

i

and

j

j < i

, for

i = 1, 2, \dots, t

and

j = 1, 2, \dots, t

12: $ldc$ – IntegerInput

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

Constraint:

ldc \geq nt

13: $irep (nt)$ – Integer arrayOutput

On exit: if

nt \geq 2

, the treatment replications,

R_{l l}

, for

l = 1, 2, \dots, nt

14: $r (n)$ – Real (Kind=nag_wp) arrayOutput

On exit: the residuals,

r_{i}

, for

i = 1, 2, \dots, n

15: $ef (nt)$ – Real (Kind=nag_wp) arrayOutput

On exit: if

nt \geq 2

, the canonical efficiency factors.

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

On entry: the tolerance value used to check for zero eigenvalues of the matrix

Ω

. If

tol = 0.0

a default value of

10^{- 5}

is used.

Constraint:

tol \geq 0.0

17: $irdf$ – IntegerInput

On entry: an adjustment to the degrees of freedom for the residual and total.

$irdf \geq 1$: The degrees of freedom for the total is set to $n - irdf$ and the residual degrees of freedom adjusted accordingly.
$irdf = 0$: The total degrees of freedom for the total is set to $n - 1$ , as usual.

Constraint:

irdf \geq 0

18: $wk (3 \times nt)$ – Real (Kind=nag_wp) arrayWorkspace

19: $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, because for this routine the values of the output arguments may be useful even if

ifail \neq 0

on exit, the recommended value is

- 1

. 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).

Note: g04bbf may return useful information for one or more of the following detected errors or warnings.

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $irdf = 〈value〉$ .
Constraint: $irdf \geq 0$ .

On entry, $ldc = 〈value〉$ and $nt = 〈value〉$ .
Constraint: $ldc \geq nt$ .

On entry, $ldtabl = 〈value〉$ .
Constraint: $ldtabl \geq 4$ .

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

On entry, no blocks or treatments in model.

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

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

$ifail = 2$: On entry, $n = 〈value〉$ and $iblock = 〈value〉$ .
Constraint: $n \geq 2$ and if $abs (iblock) \geq 2$ , n must be a multiple of $abs (iblock)$ .

$ifail = 3$: On entry, at least one treatment is not present. Treatment $〈value〉$ does not appear in it.

On entry, $i = 〈value〉$ , $it (i) = 〈value〉$ and $nt = 〈value〉$ .
Constraint: $1 \leq it (i) \leq nt$ .

$ifail = 4$: On entry, the values in y are constant.

$ifail = 5$: A computed standard error is zero. This is due to rounding errors and is an unlikely error exit.

The computation of the eigenvalues has failed to converge. This is an unlikely error exit.

$ifail = 6$: The treatments are totally confounded with blocks. The treatment sum of squares and degrees of freedom are zero. The analysis of variance table is not computed, except for block and total sums of squares and degrees of freedom.

$ifail = 7$: The residual degrees of freedom is zero. Columns $3, 4$ and $5$ of the analysis of variance table will not be computed and the matrix of standard errors and covariances, c, will not be scaled by $s$ or $s^{2}$ .

The residual mean square is zero. Columns $3, 4$ and $5$ of the analysis of variance table will not be computed and the matrix of standard errors and covariances, c, will not be scaled by $s$ or $s^{2}$ .

$ifail = 8$: The design is disconnected. The standard errors may not valid. The design may be nested.

$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 algorithm used by g04bbf, described in Section 3, achieves greater accuracy than the traditional algorithms based on the subtraction of sums of squares.

8

Parallelism and Performance

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

g04bbf 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

To estimate missing values the Healy and Westmacott procedure or its derivatives may be used, see John and Quenouille (1977). This is an iterative procedure in which estimates of the missing values are adjusted by subtracting the corresponding values of the residuals. The new estimates are then used in the analysis of variance. This process is repeated until convergence. A suitable initial value may be the grand mean

\hat{μ}

. When using this procedure irdf should be set to the number of missing values plus one to obtain the correct degrees of freedom for the residual sum of squares.

For designs such as Graeco–Latin squares one or more of the blocking factors has to be removed in a preliminary analysis before the final analysis using calls to g04bbf or g04bcf. The residuals from the preliminary analysis are then input to g04bbf. In these cases irdf should be set to the difference between n and the residual degrees of freedom from preliminary analysis. Care should be taken when using this approach as there is no check on the orthogonality of the two analyses.

For analysis of covariance the residuals are obtained from an analysis of variance of both the response variable and the covariates. The residuals from the response variable are then regressed on the residuals from the covariates using, say, g02cbf or g02daf. The results from those routines can be used to test for the significance of the covariates. To test the significance of the treatment effects after fitting the covariate, the residual sum of squares from the regression should be compared with the residual sum of squares obtained from the equivalent regression but using the residuals from fitting blocks only.

10

Example

The data, given by John and Quenouille (1977), are for a balanced incomplete block design with

10

blocks and

6

treatments and with

3

plots per block. The observations are the degree of pain experienced and the treatments are penicillin of different potency. The data is input and the analysis of variance table and treatment means are printed.

NAG Library Routine Document

g04bbf (random)

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