Partially replicated two-level fractional factorial designs via semifoldover

Most fractional factorial designs have no replicated points and thus do not provide a reliable estimate for experimental error. The objective of this paper is to study the issue of partially replicated two-level fractional factorial (FF) designs, thereby allowing for the unbiased estimation of the experimental error while maintaining the orthogonality of the main effects. Through the tool of indicator function and the idea of semifoldover, we propose two simple and effective techniques to produce designs with partially replicated points in general two-level FF designs, whether they are regular or not. The related properties of constructed partially replicated designs are investigated. Our results indicate that partially replicated FF are competitive in practice.     

On sum composition of fractional factorial designs

Combinatorial extension and composition methods have been extensively used in the construction of block designs. One of the composition methods, namely the direct product or Kronecker product method was utilized by Chakravarti [1956] to produce certain types of fractional factorial designs. The present paper shows how the direct sum operation can be utilized in obtaining from initial fractional factorial designs for two separate symmetrical factorials a fractional factorial design for the corresponding asymmetrical factorial. Specifically, we provide some results which are useful in the construction of non-singular fractional factorial designs via the direct sum composition method. In addition a modified direct sum method is discussed and the consequences of imposing orthogonality are explored.     

Graph based isomorph-free generation of two-level regular fractional factorial designs

We provide a new necessary and sufficient check for testing the isomorphism of two 2-level regular fractional factorial designs. The approach is based on modeling fractional factorial designs as bipartite graphs. We employ an efficient canonical graph labeling approach to compare two designs for isomorphism. We then improve upon the existing non-isomorphic fractional factorial design generation algorithm by reducing the number of candidate designs from which isomorphs need to be removed. Not only does our method generate non-isomorphic designs much faster, it is also able to generate designs with run sizes of 2048 and 4096 runs, which were not generated by the existing methods.     

Some new augmented fractional Box–Behnken designs

The augmented Box–Behnken designs are used in the situations in which Box–Behnken designs (BBDs) could not estimate the response surface model due to the presence of third-order terms in the response surface models. These designs are too large for experimental use. Usually experimenters prefer small response surface designs in order to save time, cost, and resources; therefore, using combinations of fractional BBD points, factorial design points, axial design points, and complementary design points, we augment these designs and develop new third-order response surface designs known as augmented fractional BBDs (AFBBDs). These AFBBDs have less design points and are more efficient than augmented BBDs.     

Minimum aberration blocking schemes for 128-run designs

Several criteria have been proposed for ranking blocked fractional factorial designs. For large fractional factorial designs, the most appropriate minimum aberration criterion was one proposed by Cheng and Wu (2002). We justify this assertion and propose a novel construction method to overcome the computational challenge encountered in large fractional factorial designs. Tables of minimum aberration blocked designs are presented for N=128 runs and n=8–64 factors.     

D‐optimal minimax fractional factorial designs

The D‐optimal minimax criterion is proposed to construct fractional factorial designs. The resulting designs are very efficient, and robust against misspecification of the effects in the linear model. The criterion was first proposed by Wilmut & Zhou (2011); their work is limited to two‐level factorial designs, however. In this paper we extend this criterion to designs with factors having any levels (including mixed levels) and explore several important properties of this criterion. Theoretical results are obtained for construction of fractional factorial designs in general. This minimax criterion is not only scale invariant, but also invariant under level permutations. Moreover, it can be applied to any run size. This is an advantage over some other existing criteria. The Canadian Journal of Statistics 41: 325–340; 2013 © 2013 Statistical Society of Canada     

On equivalence of fractional factorial designs based on singular value decomposition

The singular value decomposition of a real matrix always exists and is essentially unique. Based on the singular value decomposition of the design matrices of two general 2-level fractional factorial designs, new necessary and sufficient conditions for the determination of combinatorial equivalence or non-equivalence of the corresponding designs are derived. Equivalent fractional factorial designs have identical statistical properties for estimation of factorial contrasts and for model fitting. Non-equivalent designs, however, may have the same statistical properties under one particular model but different properties under a different model. Results extend to designs with factors at larger number of levels.     

Optimal block sequences for blocked fractional factorial split-plot designs

It is known that for blocked 2^n-k$2^{n-k}$ designs a judicious sequencing of blocks may allow one to obtain early and insightful results regarding influential parameters in the experiment. Such findings may justify the early termination of the experiment thereby producing cost and time savings. This paper introduces an approach for selecting the optimal sequence of blocks for regular two-level blocked fractional factorial split-plot screening experiments. An optimality criterion is developed so as to give priority to the early estimation of low-order factorial effects. This criterion is then applied to the minimum aberration blocked fractional factorial split-plot designs tabled in McLeod and Brewster [2004. The design of blocked fractional factorial split-plot experiments. Technometrics 46, 135–146]. We provide a catalog of optimal block sequences for 16 and 32-run minimum aberration blocked fractional factorial split-plot designs run in either 4 or 8 blocks.     

Catalogue of Group Structures for Three-level Fractional Factorial Designs

Taguchi (1959) introduced the concept of split-unit design to sort the factors into different groups depending upon the difficulties involved in changing the levels of factors. Li et al. (1991) renamed it as split-plot design. Chen et al. (1993) have given a catalogue of small designs for two- and three-level fractional factorial designs pertaining to a single type of factors. Aggarwal et al. (1997) have given a catalogue of group structure for two-level fractional factorial designs developed under the concept of split-plot design. In this paper, an algorithm has been developed for generating group structure and possible allocations for various 3^n-k fractional factorial designs.     

On the equivalence of definitions for regular fractions of mixed-level factorial designs

The notion of regularity for fractional factorial designs was originally defined only for two-level factorial designs. Recently, rather different definitions for regular fractions of mixed-level factorial designs have been proposed by Collombier [1996. Plans d’Expérience Factoriels. Springer, Berlin], Wu and Hamada [2000. Experiments. Wiley, New York] and Pistone and Rogantin [2008. Indicator function and complex coding for mixed fractional factorial designs. J. Statist. Plann. Inference 138, 787–802]. In this paper we prove that, surprisingly, these definitions are equivalent. The proof of equivalence relies heavily on the character theory of finite Abelian groups. The group-theoretic framework provides a unified approach to deal with mixed-level factorial designs and treat symmetric factorial designs as a special case. We show how within this framework each regular fraction is uniquely characterized by a defining relation as for two-level factorial designs. The framework also allows us to extend the result that every regular fraction is an orthogonal array of a strength that is related to its resolution, as stated in Dey and Mukerjee [1999. Fractional Factorial Plans. Wiley, New York] to mixed-level factorial designs.     

On Exact K-optimal Designs Minimizing the Condition Number

A new design criterion based on the condition number of an information matrix is proposed to construct optimal designs for linear models, and the resulting designs are called K-optimal designs. The relationship between exact and asymptotic K-optimal designs is derived. Since it is usually hard to find exact optimal designs analytically, we apply a simulated annealing algorithm to compute K-optimal design points on continuous design spaces. Specific issues are addressed to make the algorithm effective. Through exact designs, we can examine some properties of the K-optimal designs such as symmetry and the number of support points. Examples and results are given for polynomial regression models and linear models for fractional factorial experiments. In addition, K-optimal designs are compared with A-optimal and D-optimal designs for polynomial regression models, showing that K-optimal designs are quite similar to A-optimal designs.     

Orthogonal three-level parallel flats designs for user-specified resolution

Orthogonal factorial and fractional factorial designs are very popular in many experimental studies, particularly the two-level and three-level designs used in screening experiments. When an experimenter is able to specify the set of possibly nonnegligible factorial effects, it is sometimes possible to obtain an orthogonal design belonging to the class of parallel flats designs, that has a smaller run-size than a suitable design from the class of classical fractional factorial designs belonging to the class of single flat designs. Sri-vastava and Li (1996) proved a fundamental theorem of orthogonal s-level, s being a prime, designs of parallel flats type for the user-specified resolution. They also tabulated a series of orthogonal designs for the two-level case. No orthogonal designs for three-level case are available in their paper. In this paper, we present a simple proof for the theorem given in Srivastava and Li (1996) for the three-level case. We also give a dual form of the theorem, which is more useful for developing an algorithm for construction of orthogonal designs. Some classes of three-level orthogonal designs with practical run-size are given in the paper.     

Classification of efficient two-level fractional factorial designs of resolution IV or more

Two-level fractional factorial designs that are efficient in terms of aberration or other aliasing properties are classified into four types of designs of resolution IV or more: the half-fraction designs, the even designs, the five-column designs and the join designs. The designs are shown to have concise grid representations which provide simple interpretations of their aliasing structure. New efficient 128-run designs are presented and blocking of the designs is considered.     

Singular factorial designs resulting from missing pairs of design points

In industry, experiments are often conducted sequentially due to equipment limitations dictating that only one or two simultaneous runs may be made. In this situation, early termination of the experiment results in missing points, leading to a loss in efficiency or, worse, to a singular subdesign with nonestimable model parameters. We investigate the specific problem of singularity when two points are lost from a factorial design based on n two-level factors. The method is based on the inner products of the coordinate vectors of the omitted design points and leads to some results on the nonexistence of fractional factorial designs.     

Balanced arrays and main-effect plans from regular group-divisible designs

A method of constructing balanced arrays of strength two and corresponding main-effect fractional factorial plans from some regular group-divisible designs is presented. Main-effect fractional factorial plans for three-level factorial experiments are constructed. The plans have reasonably high efficiencies for different single degree of freedom effects.     

Designing fractional factorial split-plot experiments with few whole-plot factors

Summary.  When it is impractical to perform the experimental runs of a fractional factorial design in a completely random order, restrictions on the randomization can be imposed. The resulting design is said to have a split-plot, or nested, error structure. Similarly to fractional factorials, fractional factorial split-plot designs can be ranked by using the aberration criterion. Techniques that generate the required designs systematically presuppose unreplicated settings of the whole-plot factors. We use a cheese-making experiment to demonstrate the practical relevance of designs with replicated settings of these factors. We create such designs by splitting the whole plots according to one or more subplot effects. We develop a systematic method to generate the required designs and we use the method to create a table of designs that is likely to be useful in practice.     

Irregular Four-level Response Surface Designs

Four-level response surface designs based on regular two-level fractional factorial designs were introduced by Edmondson (1991). Here, the methods are extended to include designs based on irregular two-level fractional factorials. These designs allow orthogonal blocking and require fewer experimental units than the regular designs.     

Experimentation order in factorial designs: new findings

Under some very reasonable hypotheses, it becomes evident that randomizing the run order of a factorial experiment does not always neutralize the effect of undesirable factors. Yet, these factors do have an influence on the response, depending on the order in which the experiments are conducted. On the other hand, changing the factor levels is many times costly; therefore it is not reasonable to leave to chance the number of changes necessary. For this reason, run orders that offer the minimum number of factor level changes and at the same time minimize the possible influence of undesirable factors on the experimentation have been sought. Sequences which are known to produce the desired properties in designs with 8 and 16 experiments can be found in the literature. In this paper, we provide the best possible sequences for designs with 32 experiments, as well as sequences that offer excellent properties for designs with 64 and 128 experiments. The method used to find them is based on a mixture of algorithmic searches and an augmentation of smaller designs.     

2(n1+n2)-(k1+k2) Fractional factorial split-plot designs containing clear effects

Whole-plot (WP) factors and sub-plot (SP) factors play different roles in fractional factorial split-plot (FFSP) designs. In this paper, we consider FFSP designs with resolution III or IV from the viewpoint of clear factorial effects, classify two-factor interactions (2FIs) into three types, and give sufficient and necessary conditions for the existence of FFSP designs containing various clear factorial effects, including two types of main effects and three types of 2FIs. The structures of these designs are also shown and illustrated with examples.     

Equivalence of factorial designs with qualitative and quantitative factors

Two symmetric fractional factorial designs with qualitative and quantitative factors are equivalent if the design matrix of one can be obtained from the design matrix of the other by row and column permutations, relabeling of the levels of the qualitative factors and reversal of the levels of the quantitative factors. In this paper, necessary and sufficient methods of determining equivalence of any two symmetric designs with both types of factors are given. An algorithm used to check equivalence or non-equivalence is evaluated. If two designs are equivalent the algorithm gives a set of permutations which map one design to the other. Fast screening methods for non-equivalence are considered. Extensions of results to asymmetric fractional factorial designs with qualitative and quantitative factors are discussed.