Satisfactory systems of confounding for symmetrical factorial experiments can be constructed oy the familiar methods, using the. theory of Galois fields. Although these methods can be extended to asymmetrical factorial experiments· (White and Hultquist, 1965; Raktoe, 1969) the actual construction of designs becomes much mor:e complicated for the general case and does not always lead to satisfactory plans. A different approach to this problem is to consider balanced factorial experiments (BFE), due to Shah (1958, 1960). Such BFE have a one-to-one relationship to EGD-PBIB designs given by Hinkelmann (1964). The problem of constructing BFE is then equivalent to constructing EGD-PBIB designs. A new method is proposed here to construct such designs. This method is based upon the so-called (1,1, ...,1)th-associate matrix and the operations symbolic direct product (SDP), generalized symbolic direct product (GSDP), symbolic direct multiplication (SDM), and generalized symbolic direct multiplication (GSDM). Let A₁ , A₂, ... , A<sub>n</sub> be n factors in a factorial experiment, with A<sub>i</sub> having t<sub>i</sub> levels (i = 1, 2, ... , n). It is shown that an EGD-PBIB design with blocks of size t<sub>i</sub> can be constructed, provided that t<sub>i</sub>ᵢ ≠ max ( t₁ , t₂, . . . , t<sub>n</sub> ). This method is more general and more flexible than the method of Aggarwal (1974) in that any two treatment combinations can be γ-th associates where γ has at least two unity components, and it can be shown the number of possible candidates for such is 2<sup>n-i l</sup> -1 for blocks of size t<sub>i</sub> (i = 1, 2, .. , n -1), where t₁ < t₂ <...< t<sub>n</sub>. This method is also more general than the Kronecker product method due to Vartak (1955}.
Two types of PBIB designs· are used for reducing the numbers of associa,te classes in EGD-PBIB designs. When the t<sub>i</sub> (i = 1, 2, ... , n) are equal, then some EGD-PBIB designs can be reduced to a hypercubic design. The EGD-PBIB designs with block size π [below jεA] t<sub>j</sub>, where A is an arbitrary subset of the set {1, 2, ... , n} can be reduced to newly introduced F<sub>A</sub><sup>(n)</sup>-type PBIR designs.
Since BFE results very often in designs with a large number of blocks, the notion of partial balanced factorial experiment (PBFE) has been introduced. It is investigated how such designs can be constructed and related to PBIB-designs similar to that between BFE and EGD-PBIB designs. Two new types of PBIB designs have been introduced in this context. / Ph. D.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/77763 |
| Date | January 1982 |
| Creators | Chang, Cheng-Tao |
| Contributors | Statistics |
| Publisher | Virginia Polytechnic Institute and State University |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Dissertation, Text |
| Format | vii, 245, [2] leaves, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | OCLC# 9309465 |
Page generated in 0.0021 seconds