NAG Library Routine Document

Integer, Intent (In)	::	nt, ldc
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	isig(nt*(nt-1)/2)
Real (Kind=nag_wp), Intent (In)	::	tmean(nt), rdf, c(ldc,nt), clevel
Real (Kind=nag_wp), Intent (Out)	::	cil(nt(nt-1)/2), ciu(nt(nt-1)/2)
Character (1), Intent (In)	::	typ

C Header Interface

#include <nagmk26.h>

void	g04dbf_ (const char typ, const Integer nt, const double tmean[], const double rdf, const double c[], const Integer ldc, const double clevel, double cil[], double ciu[], Integer isig[], Integer ifail, const Charlen length_typ)

3

Description

In the computation of analysis of a designed experiment the first stage is to compute the basic analysis of variance table, the estimate of the error variance (the residual or error mean square),

{\hat{σ}}^{2}

, the residual degrees of freedom,

ν

, and the (variance ratio)

F

-statistic for the

t

treatments. The second stage of the analysis is to compare the treatment means. If the treatments have no structure, for example the treatments are different varieties, rather than being structured, for example a set of different temperatures, then a multiple comparison procedure can be used.

A multiple comparison procedure looks at all possible pairs of means and either computes confidence intervals for the difference in means or performs a suitable test on the difference. If there are

t

treatments then there are

t (t - 1) / 2

comparisons to be considered. In tests the type

1

error or significance level is the probability that the result is considered to be significant when there is no difference in the means. If the usual

t

-test is used with, say, a

6 %

significance level then the type

1

error for all

k = t (t - 1) / 2

tests will be much higher. If the tests were independent then if each test is carried out at the

100 α

percent level then the overall type

1

error would be

α^{*} = 1 - {(1 - α)}^{k} ≃ k α

. In order to provide an overall protection the individual tests, or confidence intervals, would have to be carried out at a value of

α

such that

α^{*}

is the required significance level, e.g., five percent.

The

100 (1 - α)

percent confidence interval for the difference in two treatment means,

{\hat{τ}}_{i}

and

{\hat{τ}}_{j}

is given by

({\hat{τ}}_{i} - {\hat{τ}}_{j}) \pm T_{(α, ν, t)}^{*} s e ({\hat{τ}}_{i} - {\hat{τ}}_{j}),

where

s e ()

denotes the standard error of the difference in means and

T_{(α, ν, t)}^{*}

is an appropriate percentage point from a distribution. There are several possible choices for

T_{(α, ν, t)}^{*}

. These are:

(a)	$\frac{1}{2} q_{(1 - α, ν, t)}$ , the studentized range statistic, see g01fmf. It is the appropriate statistic to compare the largest mean with the smallest mean. This is known as Tukey–Kramer method.
(b)	$t_{(α / k, ν)}$ , this is the Bonferroni method.
(c)	$t_{(α_{0}, ν)}$ , where $α_{0} = 1 - {(1 - α)}^{1 / k}$ , this is known as the Dunn–Sidak method.
(d)	$t_{(α, ν)}$ , this is known as Fisher's LSD (least significant difference) method. It should only be used if the overall $F$ -test is significant, the number of treatment comparisons is small and were planned before the analysis.
(e)	$\sqrt{(k - 1) F_{1 - α, k - 1, ν}}$ where $F_{1 - α, k - 1, ν}$ is the deviate corresponding to a lower tail probability of $1 - α$ from an $F$ -distribution with $k - 1$ and $ν$ degrees of freedom. This is Scheffe's method.

In cases (b), (c) and (d),

t_{(α, ν)}

denotes the

α

two tail significance level for the Student's

t

-distribution with

ν

degrees of freedom, see g01fbf.

The Scheffe method is the most conservative, followed closely by the Dunn–Sidak and Tukey–Kramer methods.

To compute a test for the difference between two means the statistic,

\frac{{\hat{τ}}_{i} - {\hat{τ}}_{j}}{s e ({\hat{τ}}_{i} - {\hat{τ}}_{j})}

is compared with the appropriate value of

T_{(α, ν, t)}^{*}

4

References

Kotz S and Johnson N L (ed.) (1985a) Multiple range and associated test procedures Encyclopedia of Statistical Sciences 5 Wiley, New York

Kotz S and Johnson N L (ed.) (1985b) Multiple comparison Encyclopedia of Statistical Sciences 5 Wiley, New York

Winer B J (1970) Statistical Principles in Experimental Design McGraw–Hill

5

Arguments

1: $typ$ – Character(1)Input

On entry: indicates which method is to be used.

$typ ='T'$: The Tukey–Kramer method is used.
$typ ='B'$: The Bonferroni method is used.
$typ ='D'$: The Dunn–Sidak method is used.
$typ ='L'$: The Fisher LSD method is used.
$typ ='S'$: The Scheffe's method is used.

Constraint:

typ ='T'

'B'

'D'

'L'

'S'

2: $nt$ – IntegerInput

On entry:

t

, the number of treatment means.

Constraint:

nt \geq 2

3: $tmean (nt)$ – Real (Kind=nag_wp) arrayInput

On entry: the treatment means,

{\hat{τ}}_{i}

, for

i = 1, 2, \dots, t

4: $rdf$ – Real (Kind=nag_wp)Input

On entry:

ν

, the residual degrees of freedom.

Constraint:

rdf \geq 1.0

5: $c (ldc, nt)$ – Real (Kind=nag_wp) arrayInput

On entry: the strictly lower triangular part of c must contain the standard errors of the differences between the means as returned by g04bbf and g04bcf. That is

c (i, j)

i > j

, contains the standard error of the difference between the

i

th and

j

th mean in tmean.

Constraint:

c (i, j) > 0.0

, for

i = 2, 3, \dots, t

and

j = 1, 2, \dots, i - 1

6: $ldc$ – IntegerInput

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

Constraint:

ldc \geq nt

7: $clevel$ – Real (Kind=nag_wp)Input

On entry: the required confidence level for the computed intervals, (

1 - α

Constraint:

0.0 < clevel < 1.0

8: $cil (nt \times (nt - 1) / 2)$ – Real (Kind=nag_wp) arrayOutput

On exit: the

((i - 1) (i - 2) / 2 + j)

th element contains the lower limit to the confidence interval for the difference between

i

th and

j

th means in tmean, for

i = 2, 3, \dots, t

and

j = 1, 2, \dots, i - 1

9: $ciu (nt \times (nt - 1) / 2)$ – Real (Kind=nag_wp) arrayOutput

On exit: the

((i - 1) (i - 2) / 2 + j)

th element contains the upper limit to the confidence interval for the difference between

i

th and

j

th means in tmean, for

i = 2, 3, \dots, t

and

j = 1, 2, \dots, i - 1

10: $isig (nt \times (nt - 1) / 2)$ – Integer arrayOutput

On exit: the

((i - 1) (i - 2) / 2 + j)

th element indicates if the difference between

i

th and

j

th means in tmean is significant, for

i = 2, 3, \dots, t

and

j = 1, 2, \dots, i - 1

. If the difference is significant then the returned value is

1

; otherwise the returned value is

0

11: $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, $clevel = 〈value〉$ .
Constraint: $0.0 < clevel < 1.0$ .

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

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

On entry, $rdf = 〈value〉$ .
Constraint: $rdf \geq 1.0$ .

On entry, $typ = 〈value〉$ .
Constraint: $typ ='T'$ , $'B'$ , $'D'$ , $'L'$ or $'S'$ .

$ifail = 2$: On entry, $i = 〈value〉$ and $j = 〈value〉$ .
Constraint: $c (i, j) > 0.0$ .

$ifail = 3$: There has been a failure in the computation of the studentized range statistic. This is an unlikely error exit. Try using a small value of clevel.

$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

For the accuracy of the percentage point statistics see g01fbf and g01fmf.

8

Parallelism and Performance

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

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

If the treatments have a structure then the use of linear contrasts as computed by g04daf may be more appropriate.

An alternative approach to one used in g04dbf is the sequential testing of the Student–Newman–Keuls procedure. This, in effect, uses the Tukey–Kramer method but first ordering the treatment means and examining only subsets of the treatment means in which the largest and smallest are significantly different. At each stage the third argument of the Studentized range statistic is the number of means in the subset rather than the total number of means.

10

Example

In the example taken from Winer (1970) a completely randomized design with unequal treatment replication is analysed using g04bbf and then confidence intervals are computed by g04dbf using the Tukey–Kramer method.

NAG Library Routine Document

g04dbf (confidence)

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