Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Theses
      • Higher Degree Theses
      • View Item
      •   Research Commons
      • University of Waikato Theses
      • Higher Degree Theses
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Variety trials in two-dimensional layouts

      Wright, Carole
      Thumbnail
      Files
      thesis.pdf
      7.433Mb
      Citation
      Export citation
      Wright, C. (2004). Variety trials in two-dimensional layouts (Thesis, Doctor of Philosophy (PhD)). The University of Waikato, Hamilton, New Zealand. Retrieved from https://hdl.handle.net/10289/13233
      Permanent Research Commons link: https://hdl.handle.net/10289/13233
      Abstract
      This thesis shows that efficient resolvable row-column designs can be constructed quickly by using properties of both the contraction and the dual design. The method of constructing the contraction of a r-replicate resolvable row-column design is described and is an extension of the research undertaken by Bailey and Patterson (1991) and Jarrett, Piper and Wild (1997). The structural properties of the contraction are investigated, including the row and column incidence matrices. It is shown that the information matrix for the dual design can be expressed in terms of the row and column incidence matrices for the contraction.

      A connection is made between the eigenvalues of the resolvable row-column design and the dual design. This relationship can be used to enable the average efficiency factor of the resolvable row-column design to be expressed in terms of the canonical efficiency factors of the dual design.

      Existing optimisation algorithms available for the construction of resolvable row-column designs work well for small experiments. For experiments with a large number of treatments they are computationally expensive. The dimensionality of the problem of constructing resolvable row-column designs is reduced by working with the dual design. By expressing the information matrix for the dual design in terms of the contraction, the result is a computationally faster algorithm. For large designs it is shown to be quicker to update properties of the contraction than those of the resolvable row-column design. The computational effort required for generating resolvable row-column designs with a large number of treatments can be reduced further by using the (M,S)-optimality criterion.

      When generating resolvable row-column designs using an optimisation algorithm, it is helpful to have a tight upper bound for the average efficiency factor. By comparing the average efficiency factor with the upper bound it is possible to determine when a good design has been obtained and a decision can then be made on whether to terminate the algorithm. Upper bounds for resolvable row-column designs are known not to be tight and a new upper bound is developed by exploiting some of the properties of the contraction and dual design.
      Date
      2004
      Type
      Thesis
      Degree Name
      Doctor of Philosophy (PhD)
      Supervisors
      John, J.A.
      Whitaker, David
      Publisher
      The University of Waikato
      Rights
      All items in Research Commons are provided for private study and research purposes and are protected by copyright with all rights reserved unless otherwise indicated.
      Collections
      • Higher Degree Theses [1714]
      Show full item record  

      Usage

      Downloads, last 12 months
      14
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement