Search designs for 2m factorials derived from balanced arrays of strength 2(l+1) and ad-optimal search designs

We consider a search design for the 2^m type such that at most knonnegative effects can be searched among (l+1)-factor interactions and estimated along with the effects up to l- factor interactions, provided (l+1)-factor and higher order interactions are negligible except for the k effects. We investigate some properties of a search design which is yielded by a balanced 2^m design of resolution 2l+1 derived from a balanced array of strength 2(l+1). A necessary and sufficient condition for the balanced design of resolution 2l+1 to be a search design for k=1 is given. Optimal search designs for k=1 in the class of the balanced 2^m designs of resolution V (l=2), with respect to the AD-optimality criterion given by Srivastava (1977), with N assemblies are also presented, where the range of (m,N) is (m=6; 28≤N≤41), (m=7; 35≤N≤63) and (m=8; 44≤N≤74).     

A-optimal partially balanced fractional 2m1+m2 factorial designs of resolution V,with 4≤m1>+m2≤6

By use of the algebraic structure, we obtain an explicit expression for the characteristic polynomial of the information matrix of a partially balanced fractional 2^m₁+m₂ factorial design of resolution V derived from a partially balanced array. For 4≤m₁+m₂≤6, A-optimal designs considered here are also presented for reasonable number of assemblies.     

On the norm of alias matrices in balanced fractional 2m factorial designs of resolution 2l + 1

The norm $\text{6A6 = {tr(A′A)}}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ of the alias matrix A of a design can be used as a measure for selecting a design. In this paper, an explicit expression for 6A6 will be given for a balanced fractional 2^m factorial design of resolution 2l + 1 which obtained from a simple array with parameters (m; λ₀, λ₁,…, λ_m). This array is identical with a balanced array of strength m, m constraints and index set {λ₀, λ₁,…, λ_m}. In the class of the designs of resolution V (l = 2) obtained from S-arrays, ones which minimize 6A6 will be presented for any fixed N assemblies satisfying (i) m = 4, 11 ? N ? 16, (ii) m = 5, 16 ? N ? 32, and (iii) m = 6, 22 ? N ? 40.     

Balanced arrays of strength 4 and balanced fractional 3m factorial designs

A connection between a balanced fractional 2^m factorial design of resolution 2l + 1 and a balanced array of strength 2l with index set {μ₀, μ₁,…, μ_2l} was established by Yamamoto, Shirakura and Kuwada (1975). The main purpose of this paper is to give a connection between a balanced fractional 3^m factorial design of resolution V and a balanced array of strength 4, size N, m constraints, 3 levels and index set {λ_l0l1l2}.     

Analysis of variance of balanced fractional 2n factorial designs of resolution 2l+1

By use of the algebraic structure of the triangular multidimensional partially balanced association scheme, we present the analysis of variance and the hypotheses testing of a balanced fractional 2ⁿfactorial design of resolution 2l+1, which is derived from a balanced array of strength 2l.     

Weighted A-optimality for fractional 2m factorial designs of resolution V

A weighted A-optimality (WA-optimality) criterion is discussed for selecting a fractional 2^m factorial design of resolution V. A WA-optimality criterion having one weight may be considered for designs. It is shown that designs derived from orthogonal arrays are WA-optimal for any weight. From a WA-optimal design, a procedure for finding WA-optimal designs for various weights is given. WA-optimal balanced designs are presented for 4 ⩽ m ⩽ 7 and for the values of n assemblies in certain ranges. It is pointed out that designs for m = 7 and for n = 41, 42 given in Chopra and Srivastava (1973a) or in the corrected paper by Chopra et al. (1986), are not A-optimal.     

Existence Conditions for Balanced Fractional 2m Factorial Designs of Resolution 2l + 1 Derived from Simple Arrays

We consider a fractional 2^m factorial design derived from a simple array (SA) such that the (? + 1)-factor and higher-order interactions are negligible, where 2? ? m. The purpose of this article is to give a necessary and sufficient condition for an SA to be a balanced fractional 2^m factorial design of resolution 2? + 1. Such a design is concretely characterized by the suffixes of the indices of an SA.     

New light on fractional 2m factorial designs

New fractional 2^m factorial designs obtained by assigning factors to fractions of m columns of new saturated two symbol orthogonal arrays which are not isomorphic to the usual ones are proposed. Contrary to the usual assignment, examples show that some main effects are not totally but partially confounded with several two-factor interactions. Moreover, the recovery of the former from such partial confounding is possible in some cases by eliminating the latter.     

A series of single array 2m factorial search designs for even m

By means of a search design one is able to search for and estimate a small set of non‐zero elements from the set of higher order factorial interactions in addition to estimating the lower order factorial effects. One may be interested in estimating the general mean and main effects, in addition to searching for and estimating a non‐negligible effect in the set of 2‐ and 3‐factor interactions, assuming 4‐ and higher‐order interactions are all zero. Such a search design is called a ‘main effect plus one plan’ and is denoted by MEP.1. Construction of such a plan, for 2^m factorial experiments, has been considered and developed by several authors and leads to MEP.1 plans for an odd number m of factors. These designs are generally determined by two arrays, one specifying a main effect plan and the other specifying a follow‐up. In this paper we develop the construction of search designs for an even number of factors m, m≠6. The new series of MEP.1 plans is a set of single array designs with a well structured form. Such a structure allows for flexibility in arriving at an appropriate design with optimum properties for search and estimation.     

On some optimal fractional 2m factorial designs of resolution V

This paper presents the trace of the covariance matrix of the estimates of effects based on a fractional 2^m factorial (2^m-FF) design T of resolution V for the following two cases: One is the case where T is constructed by adding some restricted assemblies to an orthogonal array. The other is one where T is constructed by removing some restricted assemblies from an orthogonal array of index unity. In the class of 2^m-FF designs of resolution V considered here, optimal designs with respect to the trace criterion, i.e. A-optimal, are presented for m = 4, 5, and 6 and for a range of practical values of N (the total number of assemblies). Some of them are better than the corresponding A-optimal designs in the class of balanced fractional 2^m factorial designs of resolution V obtained by Srivastava and Chopra (1971b) in such a sense that the trace of the covariance matrix of the estimates is small.     

Construction of main effect plus two plans for 2m factorials

This paper gives a main effect plus two plan (MEP.2 plan) for 2^m factorials (m⩾4) in the same setup as in Mukerjee and Chatterjee (Utilitas Math. 45 (1994) 213) in a smaller number of treatments. For a certain design T₁, combinatorial properties on a design T₂ are presented so that the design T=T₁+T₂ is a MEP.2 plan, where “+” stands for a union of two designs. Our results are more flexible for the choice of T₂ than the results of Mukerjee and Chatterjee (Utilitas Math. 45 (1994) 213).     

Some determinant optimality aspects of main effect fold-over designs

Saha and Mohanty (1970) presented a main effect fold-over design consisting of 14 treatment combinations of the 24×33 factorial, which had the nice property of being even balanced. Calling this design DSM, this paper establishes the following specific results: (i) DSM is not d-optimal in the subclass Δe of all 14 point even balanced main effect fold-over designs of the 24×33 factorial; (ii) DSM is not d-optimal in the subclass $\text{Δ}{}^1\text{?Δ}{}^{\mathrm{e}}$ of all 14 point even and odd balanced main effect fold-over designs of the 24×33 factorial; (iii) DSM is even optimal in $\text{Δ}{}^1$ and Δe. In addition to these results two 14 point designs in $\text{Δ}{}^1$ are presented which are d-optimal and via a counter example it is shown that these designs are not odd optimal. Finally, several general matrix algebra results are given which should be useful in resolving d-optimality problems of fold-over designs of the kn11×kn22 factorial.     

Characterization of Balanced Fractional 3 m Factorial Designs of Resolution III

We consider a fractional 3 ^m factorial design derived from a simple array (SA), which is a balanced array of full strength, where the non negligible factorial effects are the general mean and the linear and quadratic components of the main effect, and m ≥ 2. In this article, we give a necessary and sufficient condition for an SA to be a balanced fractional 3 ^m factorial design of resolution III. Such a design is characterized by the suffixes of indices of an SA.     

Main effect plan for 2m factorials which allow search and estimation of one unknown effect

In this paper, we discuss resolution III plans for 2^m factorial experiments which have an additional property. We relax the classical assumption that all the interactions are negligible by assuming that (at most) one of them may be nonnegligible. Which interaction is nonnegligible is unknown. We discuss designs which allow the search and estimation of this interaction, along with the estimation of the general mean and the main effects as in the classical resolution III designs.     

Some new factor screening designs using the search linear model

Factor screening designs for searching two and three effective factors using the search linear model are discussed. The construction of such factor screening designs involved finding a fraction with small number of treatments of a 2^m factorial experiment having the property P_2t (no 2t columns are linearly dependent) for t=2 and 3. A ‘Packing Problem’ is introduced in this connection. A complete solution of the problem in one case and partial solutions for the other cases are presented. Many practically useful new designs are listed.     

Optimality aspects of 3-concurrence most balanced designs

Takcuchi (1961,1963) established E-optimality of Group Divisible Designs (GDDs) with λ₂=λ₁+1. Much later, Cheng (1980) and Jacroux (1980,1983) demonstrated E-optimality property of the GDDs with n=2,λ₁=λ₂+1 or with m=2,λ₂=λ₁+2. The purpose of this paper is to provide a unified approach for identifying certain classes of designs as E-optimal. In the process, we come up with a complete characterization of all E-optimal designs attaining a specific bound for the smallest non-zero eigenvalue of the underlying C-matrices. This establishes E-optimality of a class of 3-concurrence most balanced designs with suitable intra- and inter-group balancing. We also discuss the MV-optimality aspect of such designs.     

Optimal design results for 2n factorial paired comparison experiments

Four general classes of partially balanced designs for 2ⁿ factorials, corresponding to four different forms of a general null hypothesis H on factorial effects, are presented. For the typical design in each class, the simplified form of the non-centrality parameter λ² of the asymptotic chi-square distribution of the likelihood ratio statistic for testing the corresponding form of H₀ is derived under defined local alternatives. Optimal designs d₁ maximizing λ² in the i-th class and minimizing the trace, determinant and largest eigenvalue of a defined covariance matrix, i =1,…,4, are determined.     

2 m 4 n designs with resolution III or IV containing clear two-factor interaction components

The orthogonal arrays with mixed levels have become widely used in fractional factorial designs. It is highly desirable to know when such designs with resolution III or IV have clear two-factor interaction components (2fic’s). In this paper, we give a complete classification of the existence of clear 2fic’s in regular 2 ^m 4 ⁿ designs with resolution III or IV. The necessary and sufficient conditions for a 2 ^m 4 ⁿ design to have clear 2fic’s are given. Also, 2 ^m 4 ⁿ designs of 32 runs with the most clear 2fic’s are given for n = 1,2.      

On the use of partial confounding for the construction of alternative regular two-level blocked fractional factorial designs

In this paper, we consider experimental situations in which a regular fractional factorial design is to be used to study the effects of m two-level factors using n=2^m−k experimental units arranged in 2^p blocks of size 2^m−k−p. In such situations, two-factor interactions are often confounded with blocks and complete information is lost on these two-factor interactions. Here we consider the use of the foldover technique in conjunction with combining designs having different blocking schemes to produce alternative partially confounded blocked fractional factorial designs that have more estimable two-factor interactions or a higher estimation capacity or both than their traditional counterparts.     

Balanced 2m factorial designs of resolution v which allow search and estimation of one extra unknown effect, 4 ≤ m ≤ 8

In this paper, we obtain balanced resolution V plans for 2^m factorial experiments (4 ≤ m ≤ 8), which have an additional feature. Instead of assuming that the three factor and higher order effects are all zero, we assume that there is at most one nonnegligible effect among them; however, we do not know which particular effect is nonnegligible. The problem is to search which effect is non-negligible and to estimate it, along with estimating the main effects and two factor interactions etc., as in an ordinary resolution V design. For every value of N (the number of treatments) within a certain practical range, we present a design using which the search and estimation can be carried out. (Of course, as in all statistical problems, the probability of correct search will depend upon the size of “error” or “noise” present in the observations. However, the designs obtained are such that, at least in the noiseless case, this probability equals 1.) It is found that many of these designs are identical with optimal balanced resolution V designs obtained earlier in the work of Srivastava and Chopra.