A series of search designs for 2mfactorial designs of resolution V which permit search of one or two unknown extra three-factor interactions
✍ Scribed by Teruhiro Shirakura; Shinsei Tazawa
- Book ID
- 104623456
- Publisher
- Springer Japan
- Year
- 1992
- Tongue
- English
- Weight
- 605 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0020-3157
No coin nor oath required. For personal study only.
✦ Synopsis
In the absence of four-factor and higher order interactions, we present a series of search designs for 2 TM factorials (m > 6) which allow the search of at most k (= 1, 2) nonnegligible three-factor interactions, and the estimation of them along with the general mean, main effects and two-factor interactions. These designs are derived from balanced arrays of strength 6. In particular, the nonisomorphic weighted graphs with 4 vertices in which two distinct vertices are assigned with integer weight oa (1 ~ w < 3), are useful in obtaining search designs for k = 2. Furthermore, it is shown that a search design obtained for each m > 6 is of the minimum number of treatments among balanced arrays of strength 6. By modifying the results for m > 6, we also present a search design for rn = 5 and k = 2.