Skip to main content
Log in

Abstract

This paper is concerned with augmented block designs for unreplicated trials for which the underlying model comprises fixed block and fixed treatment effects. Explicit expressions for the average scaled variances and the maximum variances of estimates of the pairwise differences between controls, between unreplicated test lines and between controls and unreplicated test lines are developed and demonstrate the crucial role of the control design in constructing the attendant A- and MV-optimal designs. The results extend quite naturally to p-rep block designs and a novel algorithm for generating such designs is introduced. Examples which illustrate the implications of the findings are also presented. Supplementary materials accompanying this paper appear online.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Bailey RA, Cameron PJ (2013) Using graphs to find the best block designs. Topics in Structural Graph Theory. Cambridge University Press, Cambridge, pp 282–317

    Google Scholar 

  • Butler DG, Smith AB, Cullis BR (2014) On the design of field experiments with correlated treatment effects. Journal of Agricultural, Biological, and Environmental Statistics 19:539–555

    Article  MathSciNet  Google Scholar 

  • Clarke GPY, Stefanova KT (2011) Optimal design for early-generation plant-breeding trials with unreplicated or partially replicated test lines. Australian & New Zealand Journal of Statistics 53:461–480

    Article  MathSciNet  Google Scholar 

  • Cullis BR, Smith AB, Cocks NA, Butler DG (2020) The design of early-stage plant breeding trials using genetic relatedness. Journal of Agricultural, Biological and Environmental Statistics 25:553–578

    Article  MathSciNet  Google Scholar 

  • Cullis BR, Smith AB, Coombes NE (2006) On the design of early generation variety trials with correlated data. Journal of Agricultural, Biological, and Environmental Statistics 11:381–393

    Article  Google Scholar 

  • Debusho LK, Gemechu DB, Haines LM (2019) Algorithmic construction of optimal block designs for two-colour cDNA microarray experiments using the linear mixed effects model. Communications in Statistics-Simulation and Computation 48:1948–1963

    Article  MathSciNet  Google Scholar 

  • Dey A (2010) Incomplete Block Designs. World Scientific, Singapore

    Book  Google Scholar 

  • Federer WT (1961) Augmented designs with one-way elimination of heterogeneity. Biometrics 17:447–473

    Article  MathSciNet  Google Scholar 

  • Federer WT, Raghavarao D (1975) On augmented designs. Biometrics 31:29–35

    Article  MathSciNet  Google Scholar 

  • Herzberg A, Jarrett R (2007) A-optimal block designs with additional singly replicated treatments. Journal of Applied Statistics 34:61–70

    Article  MathSciNet  Google Scholar 

  • John JA, Williams ER (1995) Cyclic and Computer Generated Designs. Chapman & Hall, London

    Book  Google Scholar 

  • Lin C-S, Poushinsky G (1985) A modified augmented design (type 2) for rectangular plots. Canadian Journal of Plant Science 65:743–749

    Article  Google Scholar 

  • Lu T-T, Shiou S-H (2002) Inverses of 2\(\times \) 2 block matrices. Computers & Mathematics with Applications 43:119–129

    Article  MathSciNet  Google Scholar 

  • Martin RJ, Eccleston JA, Chauhan N, Chan SP, B, (2006) Some results on the design of field experiments for comparing unreplicated treatments. Journal of Agricultural, Biological, and Environmental Statistics 11:394–410

  • Piepho H-P, Williams ER (2016) Augmented row-column designs for a small number of checks. Agronomy Journal 108:2256–2262

    Article  Google Scholar 

  • Pringle RM, Rayner AA (1971) Generalized Inverse Matrices with Applications to Statistics. Griffin, London

    MATH  Google Scholar 

  • Pronzato L, Müller WG (2012) Design of computer experiments: space filling and beyond. Statistics and Computing 22:681–701

    Article  MathSciNet  Google Scholar 

  • Shah KR, Sinha B (1989) Theory of Optimal Designs. Springer, New York

    Book  Google Scholar 

  • Vo-Thanh N, Piepho H-P (2020) Augmented quasi-sudoku designs in field trials. Computational Statistics & Data Analysis. https://doi.org/10.1016/j.csda.2020.106988

    Article  MathSciNet  MATH  Google Scholar 

  • Williams E, Piepho H-P, Whitaker D (2011) Augmented \(p\)-rep designs. Biometrical Journal 53:19–27

    Article  MathSciNet  Google Scholar 

  • Williams ER, John JA (2003) A note on the design of unreplicated trials. Biometrical Journal 45:751–757

    Article  MathSciNet  Google Scholar 

  • Williams ER, John JA, Whitaker D (2014) Construction of more flexible and efficient \(p\)-rep designs. Australian & New Zealand Journal of Statistics 56:89–96

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

I would like to thank Professor Rosemary Bailey for introducing me to the topic of unreplicated trials and for many helpful discussions. I would also like to thank the Associate Editor and two anonymous referees for their constructive comments and insights which greatly improved the content and presentation of the paper. Finally, I would like to thank the University of Cape Town and the National Research Foundation (NRF) of South Africa, grant (UID) 119122, for financial support. Any opinion, finding and conclusion or recommendation expressed in this material is that of the author and the NRF does not accept liability in this regard.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Linda M. Haines.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary Information

Below is the link to the electronic supplementary material.

Supplementary material 1 (zip 70 KB)

Supplementary material 2 (zip 218 KB)

Appendix

Appendix

1.1 A.1 Derivation of the Generalized Inverse Matrix \(C^{-}\)

Consider the treatment information matrix C written in partitioned form as

$$\begin{aligned} C= \left[ \begin{array}{cc} C_{11} &{} C_{12} \\ C_{21} &{} C_{22} \\ \end{array} \right] = \left[ \begin{array}{cc} R - \displaystyle \frac{1}{k} N_c^T N_c &{} - \displaystyle \frac{1}{k} N_c^T \otimes 1_{k_s}^T \\ - \displaystyle \frac{1}{k} N_c \otimes 1_{k_s} &{} ~~~ I_b \otimes (I_{k_s} - \displaystyle \frac{1}{k} J_{k_s}) \\ \end{array} \right] . \end{aligned}$$

Following Pringle and Rayner (1971, p.46), the formula for a g-inverse of C is given by

$$\begin{aligned} C^{-} = \left[ \begin{array}{cc} (C_{11}^*)^{-} &{} -(C_{11}^*)^{-} \, C_{12} \, C_{22}^{-} \\ -C_{22}^{-} \, C_{21} \, (C_{11}^*)^{-} &{} ~~~C_{22}^{-} + C_{22}^{-} \, C_{21} \, (C_{11}^*)^{-} \, C_{12} \, C_{22}^{-} \end{array} \right] , \end{aligned}$$

where \(C_{11}^*=C_{11} - C_{12} C_{22}^{-} C_{21}\). Note that this inverse is of the same form as that of a nonsingular \(2 \times 2\) partitioned matrix. The formula for the latter is well-known and is stated, for example, in the paper by Lu and Shiou (2002, Theorem 2.1).

It now follows that, since estimates of pairwise differences of the standard varieties are not influenced by test lines, the matrix \((C_{11}^*)^-\) can be taken to be G, any generalized inverse of the information matrix for treatments in the control design. Note that this result can also be obtained formally. Specifically

$$\begin{aligned} C_{11}^*= & {} R - \frac{1}{k} N_c^{T} N_c - \frac{1}{k} (N_c^{T} \otimes 1_{k_s}^{T}) [I_b \otimes (I_{k_s} + \frac{1}{k_c} J_{k_s}) \frac{1}{k} (N_c \otimes 1_{k_s})\\= & {} R - \frac{1}{k} N_c^{T} N_c - \frac{1}{k^2} (k_s+\frac{1}{k_c} k_s^2) N_c^{T} N_c\\= & {} R - \frac{1}{k_c} N_c^{T} N_c. \end{aligned}$$

Furthermore the inverse of the matrix \(C_{22}\) is readily derived as

$$\begin{aligned} C_{22}^{-1} = I_b \otimes (I_{k_s} - \displaystyle \frac{1}{k} \, J_{k_s})^{-1} = I_b \otimes (I_{k_s} + \displaystyle \frac{1}{(k-k_s)} \, J_{k_s}) = I_b \otimes (I_{k_s} + \displaystyle \frac{1}{k_c} \, J_{k_s}) \end{aligned}$$

and thus \(C_{22}^{-}\) is simply \(C_{22}^{-1}\). In addition, it follows from straightforward algebra involving Kronecker products that

$$\begin{aligned} -(C_{11}^*)^{-} \, C_{12} \, C_{22}^{-}= & {} \left( G \otimes 1 \right) \, ( \displaystyle \frac{1}{k} \, N_c^T \otimes 1_{k_s}^T ) \, [ I_b \otimes (I_{k_s} + \displaystyle \frac{1}{k_c} \, J_{k_s}) ] \\= & {} \displaystyle \frac{1}{k} \, (G \, N_c^T) \otimes [1_{k_s}^T \, (I_{k_s} + \displaystyle \frac{1}{k_c} \, J_{k_s}) ]\\= & {} \displaystyle \frac{1}{k_c} \, (G \, N_c^T) \otimes 1_{k_s}^T \end{aligned}$$

and that

$$\begin{aligned} C_{22}^{-} + C_{22}^{-} C_{21} (C_{11}^*)^- C_{12} C_{22}^{-}= & {} I_b \otimes (I_{k_s} + \displaystyle \frac{1}{k_c} J_{k_s}) + \displaystyle \frac{1}{k_c} (N_c \otimes 1_{k_s}) [\displaystyle \frac{1}{k_c} (G N_c^T) \otimes 1_{k_s}^T]\\= & {} I_{t_s} + I_b \otimes \displaystyle \frac{1}{k_c} J_{k_s} + \displaystyle \frac{1}{k_c} [( N_c G N_c^T) \otimes \displaystyle \frac{1}{k_c} J_{k_s}]\\= & {} I_{t_s} + [I_b + \displaystyle \frac{1}{k_c} ( N_c G N_c^T)] \otimes \displaystyle \frac{1}{k_c} J_{k_s}. \end{aligned}$$

Thus the partitioned g-inverse of the information matrix C can be assembled as

$$\begin{aligned} C^{-} = \left[ \begin{array}{cc} G &{} \displaystyle \frac{1}{k_c} (G N_c^T) \otimes 1_{k_s}^T \\ \displaystyle \frac{1}{k_c} (G N_c) \otimes 1_{k_s} &{} ~~~I_{t_s} + [I_b + \displaystyle \frac{1}{k_c} ( N_c G N_c^T)] \otimes \displaystyle \frac{1}{k_c} J_{k_s} \\ \end{array} \right] . \end{aligned}$$

1.2 A.2 Derivation of the A-optimality Criteria \(A_{tt}\), \(A_{cc}\) and \(A_{ct}\)

1.2.1 A.2.1 The Criterion \(A_{cc}\)

Consider the \(\left( {\begin{array}{c}t_c\\ 2\end{array}}\right) \times t_c\) matrix \(T_c\) with rows comprising an element 1, an element -1 and all other elements 0 and constructed in such a way that the matrix represents all pairwise treatment differences between the controls. Then \(T_c^T T_c =t_c I - J\) (Dey 2010, p.39) and

$$\begin{aligned} A_{cc} = \frac{1}{\left( {\begin{array}{c}t_c\\ 2\end{array}}\right) } tr(T_c G T_c^T) = \frac{1}{\left( {\begin{array}{c}t_c\\ 2\end{array}}\right) } tr(G \; T_c^T T_c) = \frac{2}{t_c-1} tr[G ( I - \frac{1}{t_c} J)]. \end{aligned}$$

1.2.2 A.2.2 The Criterion \(A_{tt}\)

Consider the \(\left( {\begin{array}{c}t_s\\ 2\end{array}}\right) \times t_s\) matrix H which represents all pairwise treatment differences between the test lines in the same way as \(T_c\) for pairwise differences between controls. Then \(H^T H = t_s I_{t_s}-J_{t_s}\) and \(A_{tt}= \displaystyle \frac{1}{\left( {\begin{array}{c}t_s\\ 2\end{array}}\right) } tr(H C_{22}^{-} H^T ) = \displaystyle \frac{1}{\left( {\begin{array}{c}t_s\\ 2\end{array}}\right) } tr(C_{22}^{-} H^T H)\). Thus

$$\begin{aligned} A_{tt}= \displaystyle \frac{1}{\left( {\begin{array}{c}t_s\\ 2\end{array}}\right) } tr \left\{ \left[ I_{t_s} + (I_b + \displaystyle \frac{1}{k_c} N_c \, G \, N_c^T) \otimes \displaystyle \frac{1}{k_c} J_{k_s} \right] \; (t_s I_{t_s}-J_{t_s}) \right\} . \end{aligned}$$

Consider now terms in \(A_{tt}\) identified as

$$\begin{aligned} t_1=tr[I_{t_s} (t_s I_{t_s}-J_{t_s})] = t_s (t_s-1) \end{aligned}$$

and, by taking \(t_s I_{t_s}-J_{t_s} = t_s I_b \otimes I_{k_s} - J_b \otimes J_{k_s}\), as

$$\begin{aligned} t_2 = tr[I_b \otimes \frac{1}{k_c} J_{k_s} ) (t_s I_b \otimes I_{k_s} - J_b \otimes J_{k_s}) ] = \frac{t_s^2 (b-1)}{b k_c} \end{aligned}$$

and as

$$\begin{aligned}&t_3 = tr [ (\frac{1}{k_c} (N_c G N_c^T) \otimes \frac{1}{k_c} J_{k_s} ) (t_s I_b \otimes I_{k_s} - J_b \otimes J_{k_s} )]\\&\quad = \frac{t_s^2}{b k_c^2} [ tr(N_c G N_c^T) - \frac{1}{b} 1_b^T (N_c G N_c^T) 1_b]. \end{aligned}$$

Then

$$\begin{aligned}&A_{tt} = \frac{2}{t_s (t_s -1)} (t_1+t_2+t_3)\\&\quad = 2 \left\{ 1 + \frac{t_s (b-1)}{ (t_s-1) b k_c} + \frac{t_s}{ (t_s-1) b k_c^2 } \left[ tr( N_c \, G \, N_c^T) - \frac{1}{b} 1_b^T ( N_c \, G \, N_c^T) 1_b \right] \right\} . \end{aligned}$$

1.2.3 A.2.3 The Criterion \(A_{ct}\)

The matrix defining pairwise differences between controls and unreplicated test lines is given by \( A= \left[ I_{t_c} \otimes 1_{t_s} ~~~ - 1_{t_c} \otimes I_{t_s} \right] . \) Thus

$$\begin{aligned} A^T A = \left[ \begin{array}{cc} t_s I_{t_c} &{} -J_{t_c \times t_s} \\ -J_{t_s \times t_c} &{} ~~~ t_c I_{t_s} \end{array} \right] \end{aligned}$$

and an expression for \(tr(A \, C^- \, A^T )=tr(C^- A^T \, A)\) is required. Consider therefore the matrix product

$$\begin{aligned} M = \left[ \begin{array}{cc} G &{} \displaystyle \frac{1}{k_c} (G \, N_c^T) \otimes 1_{k_s}^T \\ \displaystyle \frac{1}{k_c} (N_c \, G) \otimes 1_{k_s} &{} ~~~~ I_{t_s} + [I_b + \displaystyle \frac{1}{k_c} ( N_c \, G \, N_c^T)] \otimes \displaystyle \frac{1}{k_c} J_{k_s} \\ \end{array} \right] \left[ \begin{array}{cc} t_s I_{t_c} &{} -J_{t_c \times t_s} \\ -J_{t_s \times t_c} &{} ~~~ t_c I_{t_s} \end{array} \right] . \end{aligned}$$

Now

$$\begin{aligned} M_{11}= & {} t_s G - [\displaystyle \frac{1}{k_c} (G \, N_c^T) \otimes 1_{k_s}^T] J_{t_s \times t_c} \\= & {} t_s G - [\displaystyle \frac{1}{k_c} (G \, N_c^T) \otimes 1_{k_s}^T] (J_{b \times t_c} \otimes 1_{k_s}) \\= & {} t_s G - \displaystyle \frac{k_s}{k_c} \, G \, N_c^T J_{b \times t_c} \end{aligned}$$

and thus \(tr (M_{11})=t_s \, tr(G) - \displaystyle \frac{k_s}{k_c} \, 1_{t_c}^T \, G \, N_c^T \, 1_{b}\). Further

$$\begin{aligned} M_{22}= & {} - [\displaystyle \frac{1}{k_c} ( N_c \, G) \otimes 1_{k_s}] J_{t_c \times t_s} + t_c \left[ I_{t_s} + [I_b + \displaystyle \frac{1}{k_c} ( N_c \, G \, N_c^T)] \otimes \displaystyle \frac{1}{k_c} J_{k_s} \right] \\= & {} - [ \displaystyle \frac{1}{k_c} ( N_c \, G) \otimes 1_{k_s}] (J_{t_c \times b} \otimes 1_{k_s}^T) + t_c \left[ I_{t_s} + [I_b + \displaystyle \frac{1}{k_c} ( N_c \, G \, N_c^T)] \otimes \displaystyle \frac{1}{k_c} J_{k_s} \right] \\= & {} t_c \left[ I_{t_s} + [I_b + \displaystyle \frac{1}{k_c} ( N_c \, G \, N_c^T)] \otimes \displaystyle \frac{1}{k_c} J_{k_s} \right] - \displaystyle \frac{1}{k_c} ( N_c \, G J_{t_c \times b}) \otimes J_{k_s} \end{aligned}$$

and thus \(tr (M_{22})=t_c \, t_s + \displaystyle \frac{t_c \, t_s}{k_c} + \displaystyle \frac{t_c k_s}{k_c^2} tr(N_c \, G \, N_c^T) - \displaystyle \frac{k_s}{k_c} 1_{b}^T \, N_c G \,1_{t_c}\). Overall therefore

$$\begin{aligned} A_{ct}= & {} \frac{1}{t_c \, t_s} \left[ t_c \, t_s + \displaystyle \frac{t_c \, t_s}{k_c} + t_s \, tr(G) + \displaystyle \frac{t_c \, k_s}{k_c^2} tr(N_c G N_c^T) - \displaystyle 2 \frac{k_s}{k_c} tr(1_{t_c}^T \, G \, N_c^T \, 1_b) \right] \\= & {} 1 + \displaystyle \frac{1}{k_c} + \displaystyle \frac{1}{t_c} \, tr(G) + \displaystyle \frac{1}{b k_c^2} tr(N_c G N_c^T) - \displaystyle \frac{2}{t_c^2 } 1_{t_c}^T \, G \, N_c^T \, 1_b. \end{aligned}$$

1.3 A.3 Variances of the Estimates of Pairwise Treatment Differences

It follows straightforwardly from the g-inverse of the information matrix for the controls, that is the matrix G, that the variance of estimates of pairwise comparisons between the controls is given by

$$\begin{aligned} g_{ii}+g_{jj} - 2 g_{ij}, \end{aligned}$$

where the terms \(g_{ij}, i,j=1, \ldots , t_c,\) denote elements of the g-inverse G. In addition, the variance of the estimate of the pairwise difference between two test lines in the same block is precisely 2.

In order to obtain variances of the estimates for pairwise differences between the unreplicated test lines in different blocks and between the controls and the unreplicated test lines, consider a design comprising the controls and a single test line in each block. Then the g-inverse of the treatment information matrix C is given by

$$\begin{aligned} C_{1}^{-} = \left[ \begin{array}{cc} G &{} \displaystyle \frac{1}{k_c} G N_c^T \\ \displaystyle \frac{1}{k_c} N_c G &{} ~~~ (1+ \displaystyle \frac{1}{k_c}) I_b + \displaystyle \frac{1}{k_c^2} ( N_c G N_c^T) \\ \end{array} \right] \end{aligned}$$

and hence by

$$\begin{aligned} C_{1}^{-} = \left[ \begin{array}{cc} 0 &{} 0 \\ 0 &{} ~~~ (1+ \displaystyle \frac{1}{k_c}) I_b \\ \end{array} \right] + \left[ \begin{array}{c} I \\ \displaystyle \frac{1}{k_c} N_c \end{array} \right] G \left[ \begin{array}{cc} I&\displaystyle \frac{1}{k_c} N_c^T \end{array} \right] . \end{aligned}$$

It thus follows that the variance of the estimate of a pairwise difference between test lines in different blocks \(d_1\) and \(d_2\) is given by the \(\left( {\begin{array}{c}b\\ 2\end{array}}\right) \) expressions

$$\begin{aligned} 2 + \frac{2}{k_c} + \frac{1}{k_c^2} (n_{d_1} - n_{d_2})^T G (n_{d_1} - n_{d_2}) \end{aligned}$$

and that between the ith control and a test line in block d by the \(b \times t_c\) expressions

$$\begin{aligned} 1 +\frac{1}{k_c} + (e_{t_c,i} - \frac{1}{k_c} n_d)^T G (e_{t_c,i} - \frac{1}{k_c} n_d), \end{aligned}$$

where \(n_d^T\) represents the dth row of the incidence matrix of the control treatments \(N_c\), \(d=1, \ldots , b\) and \(i=1, \ldots , t_c\). Note that, in the latter expression, \(e_{t_c,i} - \frac{1}{k_c} n_d\) is the coefficient of a contrast of control treatment effects and, more specifically,

$$\begin{aligned} e_{t_c,i} - \frac{1}{k_c} n_d = \frac{1}{k_c} \sum _{j \in B_d\setminus i} ( e_{t_c,i} - e_{t_c,j} ), \end{aligned}$$

where \(B_d\) is the set of all treatments in block d. Thus if the control treatment and the test line are in the same block, the set \(B_d\setminus i\) comprises \(k_c-1\) treatments and if the control treatment and the test line are in different blocks it comprises \(k_c\) treatments.

1.4 A.4 Globally A-optimal Designs

1.4.1 A.4.1 The Setting \(v=b (k-1)+1\)

The globally A-optimal block designs of Bailey and Cameron (2013, Sect. 10.1) with b blocks of size k and the number of treatments v equal to the maximum permitted for connectivity, that is \(v=b (k-1)+1\), are ‘queen-bee’ designs with one treatment occurring in all b blocks and the remaining treatments occurring precisely once. The incidence matrices of these designs can thus be written compactly as \( N=\left[ \begin{array}{cc} 1_b &{} 1_{k-1}^T \otimes I_b\\ \end{array} \right] \) and can be readily partitioned to yield \(A_{tot}\)-optimal augmented block designs for the setting with \(t_c = b (k_c-1)+1\). For example, if the number of controls in each block is two, that is \(k_c=2\), the \(b \times (b+1)\) incidence matrix for the \(b+1\) controls can be taken to be \(N_c= \left[ \begin{array}{cc} 1_b &{} I_b\\ \end{array} \right] \) and that for the test lines to be \(N_s = \left[ 1_{k-2}^T \otimes I_b \right] \). More generally, the incidence matrix for the setting with \(k_c\) controls in each block is given by \(N_c= \left[ \begin{array}{cc} 1_b &{} 1_{k_c-1}^T \otimes I_b\\ \end{array} \right] \) and that for the unreplicated test lines by \(N_s= \left[ \begin{array}{c} 1_{k-k_c}^T \otimes I_b\\ \end{array} \right] . \)

1.4.2 A.4.2 The Setting \(v=b (k-1)\)

The designs of Bailey and Cameron (2013, Sect. 10.2) for \(v=b (k-1)\) are somewhat more complicated than those for \(v=b (k-1)+1\) in that their structures depend on both b and k. For example, consider a setting with \(b \ge 5\) and \(k \ge 6\). Then the globally A-optimal block designs have incidence matrices of the form

$$\begin{aligned} N= \left[ \begin{array}{cc} 1_2 &{}1_2\\ 1_{b-2} &{} 0_{b-2}\\ \end{array} \begin{array}{c} 0_{2,(k-1)(b-2)}\\ 1_{k-1}^T \otimes I_{b-2} \\ \end{array} \begin{array}{c} 1_{k-2}^T \otimes I_2\\ 0_{(b-2),2 (k-2)} \\ \end{array} \right] . \end{aligned}$$

Thus, for an \(A_{tot}\)-optimal augmented block design with \(k_c=2\), the \(b \times b\) incidence matrix for the controls can be extracted from N and is given by \(N_c = \left[ \begin{array}{cc} 1_2 &{}1_2\\ 1_{b-2} &{} 0_{b-2}\\ \end{array} \begin{array}{c} 0_{2,(b-2)}\\ I_{b-2} \\ \end{array} \right] \) and that for the unreplicated test lines by \(N_s = \left[ \begin{array}{c} 0_{2,(k-2)(b-2)}\\ 1_{k-2}^T \otimes I_{b-2} \\ \end{array} \begin{array}{c} 1_{k-2}^T \otimes I_2\\ 0_{(b-2),2 (k-2)} \\ \end{array}\right] .\) The structure of \(N_c\) is interesting in that one treatment occurs in all b blocks and one block is repeated twice. For general \(k_c \ge 3\), the incidence matrix for the controls, \(N_c\), mirrors that of the original block design but with \(k_c\) replacing k.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Haines, L.M. Augmented Block Designs for Unreplicated Trials. JABES 26, 409–427 (2021). https://doi.org/10.1007/s13253-021-00445-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13253-021-00445-3

Keywords

Navigation