Hostname: page-component-76fb5796d-22dnz Total loading time: 0 Render date: 2024-04-26T05:13:00.573Z Has data issue: false hasContentIssue false
  • English
  • Français

An algorithm to generate designs for variety trials

Published online by Cambridge University Press:  27 March 2009

L. J. Paterson ,
P. Wild  and
E. R. Williams
L. J. Paterson
Affiliation:
Department of Actuarial Mathematics and Statistics, Heriot-Watt University, Edinburgh EH14 4AS
P. Wild
Affiliation:
Department of Mathematics, Royal Holloway and Bedford New College, University of London, Egham, TW20 0EX
E. R. Williams
Affiliation:
CSIRO Division of Mathematics and Statistics, GPO Box 1965, Canberra, ACT 2601
Get access Rights & Permissions [Opens in a new window]

Summary

We describe a computer algorithm to generate efficient incomplete-block designs for any number of varieties, any number of replicates, and any number of plots per block. It considerably extends an earlier catalogue published in this Journal by Patterson, Williams & Hunter (1978). We describe also some uses of the algorithm for which no efficient designs are available from existing sources.

Type
Research Article
Information
The Journal of Agricultural Science , Volume 111 , Issue 1 , August 1988 , pp. 133 - 136
Copyright
Copyright © Cambridge University Press 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Eccleston, J. A. & Hedayat, A. (1974). On the theory of connected designs: characterisation and optimality. Annals of Statistics 2, 1238–1255.CrossRefGoogle Scholar
Jarrett, R. G. (1983). Definitions and properties for m-concurrence designs Journal of the Royal Statistical Society B 45, 1–10.Google Scholar
John, J. A. & Eccleston, J. A. (1980). Classes of rowcolumn design derived from generalized cyclic incomplete block designs. Biometrika 73, 301–306.Google Scholar
John, J. A. & Mitchell, T. J. (1977). Optimal incomplete block designs. Journal of the Royal Statistical Society B 39, 39–43.Google Scholar
Paterson, L. J. (1983). Circuits and efficiency in incomplete block designs. Biometrika 70, 215–225.CrossRefGoogle Scholar
Paterson, L. J. & Patterson, H. D. (1983). An algorithm for generating alpha-lattice designs. Ars Combinatoria 16A, 87–98.Google Scholar
Paterson, L. J. & Wild, P. (1986). Triangles and efficiency factors. Biometrika 73, 289–299.CrossRefGoogle Scholar
Patterson, H. D. & Hunter, E. A. (1983). The efficiency of incomplete block designs in national list and recommended list cereal variety trials. Journal of Agricultural Science, Cambridge 101, 427–433.CrossRefGoogle Scholar
Patterson, H. D. & Silvey, V. (1980). Statutory and recommended list trials of crop varieties in the United Kingdom. Journal of the Royal Statistical Society A 143, 219–252.CrossRefGoogle Scholar
Patterson, H. D., Williams, E. R. & Hunter, E. A. (1978). Block designs for variety trials. Journal of Agricultural Science, Cambridge 90, 395–400.CrossRefGoogle Scholar
Pearce, S. C. (1983). The Agricultural Field Experiment. New York: John WileyGoogle Scholar
Shah, K. R. (1960). Optimality criteria for incomplete block designs. Annals of Mathematical Statistics 31, 791–794.CrossRefGoogle Scholar
Wild, P. & Williams, E. R. (1987). The construction of neighbour designs. Biometrika 74, 871–876.CrossRefGoogle Scholar
Williams, E. R. (1975). A new class of resolvable block designs. Ph.D. thesis, University of Edinburgh.Google Scholar
Williams, E. R. (1985). A criterion for the construction of optimal neighbour designs. Journal of the Royal Statistical Society B 47, 489–597.Google Scholar
Williams, E. R. (1986). Row and column designs with contiguous replicates. Australian Journal of Statistics 28, 154–163.CrossRefGoogle Scholar
Yates, F. (1936). A new method of arranging variety trials involving a large number of varieties. Journal of Agricultural Science, Cambridge 26, 424–455.CrossRefGoogle Scholar