Isomorphism check in fractional factorial designs via letter interaction pattern matrix

Two fractional factorial designs are considered isomorphic if one can be obtained from the other by relabeling the factors, reordering the runs, and/or switching the levels of factors. To identify the isomorphism of two designs is known as an NP hard problem. In this paper, we propose a three-dimensional matrix named the letter interaction pattern matrix (LIPM) to characterize the information contained in the defining contrast subgroup of a regular two-level design. We first show that an LIPM could uniquely determine a design under isomorphism and then propose a set of principles to rearrange an LIPM to a standard form. In this way, we can significantly reduce the computational complexity in isomorphism check, which could only take O(2^p)+O(3k³)+O(2^k) operations to check two 2^k−p designs in the worst case. We also find a sufficient condition for two designs being isomorphic to each other, which is very simple and easy to use. In the end, we list some designs with the maximum numbers of clear or strongly clear two-factor interactions which were not found before.     

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.     

Reverse Foldovers for Blocked 2 m−k Fractional Factorial Designs

Two-level regular fractional factorial designs are often used in industry as screening designs to help identify early on in an experimental process those experimental or system variables which have significant effects on the process being studied. When the experimental material to be used in the experiment is heterogenous or the experiment must be performed over several well-defined time periods, blocking is often used as a means to improve experimental efficiency by removing the possible effects of heterogenous experimental material or possible time period effects. In a recent article, Li and Jacroux (2007 Li , F. , Jacroux , M. (2007). Optimal foldover plans for blocked 2 ^m?k fractional factorial designs. J. Statsist. Plann. Infer 137:2434–2452. [Google Scholar]) suggested a strategy for constructing optimal follow-up designs for blocked fractional factorial designs using the well-known foldover technique in conjunction with several optimality criteria. In this article, we consider the reverse foldover problem for blocked fractional factorial designs. In particular, given a 2^(m+p)?(p+k) blocked fractional factorial design D, we derive simple sufficient conditions which can be used to determine if there exists a 2^{(m+p?1)?(p?1+k+1)} initial fractional factorial design d which yields D as a foldover combined design as well how to generate all such d. Such information is useful in developing an overall experimental strategy in situations where an experimenter wants an overall blocked fractional factorial design with “desirable” properties but also wants the option of analyzing the observed data at the halfway mark to determine if the significant experimental variables are obvious (and the experiment can be terminated) or if a different path of experimentation should be taken from that initially planned.     

Two-Level Designs in Blocks of Size Two in Which All Main Effects and Two-Factor Interactions Are Estimable

There are many problems in the real world for which it is necessary to perform two points in one block. In this situation, information about certain treatments may be indistinguishable from, or confounded with, blocks. If the experimenter wants to estimate all main effects and two-factor interactions in which two points are in one block, then how to perform the blocking schemes is an important topic to study. In this article, we combine several 2 ^k?p fractions from same or different family to obtain better combined designs requiring fewer runs than those appearing in the literature.     

On the determination and construction of E-optimal block designs in the presence of linear trends

In this paper we consider experimental situations in which v treatments are to be applied to experimental units arranged in b blocks of size k = 3 and where there may be unknown or uncontrollable linear trends (possibly different) within blocks. Methods are given here for determining and constructing E-optimal designs for such situations.     

2n−m designs with resolution III or IV containing clear two-factor interactions

For a fixed number of runs, not all 2^n−m designs with resolution III or IV have clear two-factor interactions. Therefore, it is highly desirable to know when resolution III or IV designs can have clear two-factor interactions. In this paper, we provide a unified geometrical study of this problem and give a complete classification of the existence of clear two-factor interactions in regular 2^n−m designs with resolution III or IV and reveal the structures of these designs.     

The Efficient Methods to Construct Two-Per-Block Design in 2 k Plans

There are many situations which require the performing of two points in one block. Two subjects, in which all effects are available to estimate free of blocks and all main effects and two-factor interactions are estimated free of blocks, are worth to pursue in the 2 ^k design. In this article, we precisely present the minimum number of necessary blocks that enable to estimate the required effects. We also give a methodology to construct the combined designs without using computer search.     

An MEP.2 plan in 3 factorial experiment and its probability of correct identification

The present work consider the problem of constructing search designs for searching at most two active hidden two-factor interactions in 3ⁿ factorial setup under the assumption that the three-factor and higher-order interactions are negligible. The designs presented here are also capable of estimating all the main effects, general mean and the effects of identified active two-factor interactions. The performance of the designs has been studied in the noisy case by computing probability of correct identification.     

On the Use of Semi-folding in Regular Blocked Two-level Factorial Designs

In this article, we consider experimental situations where a blocked regular two-level fractional factorial initial design is used. We investigate the use of the semi-fold technique as a follow-up strategy for de-aliasing effects that are confounded in the initial design as well as an alternative method for constructing blocked fractional factorial designs. A construction method is suggested based on the full foldover technique and sufficient conditions are obtained when the semi-fold yields as many estimable effects as the full foldover.     

Weakly resolvable IV.3 search designs for the pn factorial experiment

A series of weakly resolvable search designs for the pⁿ factorial experiment is given for which the mean and all main effects are estimable in the presence of any number of two-factor interactions and for which any combination of three or fewer pairs of factors that interact may be detected. The designs have N = p(p–1)n+p runs except in one case where additional runs are required for detection and one case where $\text{(p?1)}\text{2}$ additional runs are needed to estimate all (p–1)² degrees of freedom for each pair of detected interactions. The detection procedure is simple enough that computations can be carried out with hand calculations.     

Using orthogonal array for constructing three-level search designs

We consider the problem of constructing search designs for 3^m factorial designs. By using projection properties of some three-level orthogonal arrays, some search designs are obtained for 3 ? m ? 11. The new obtained orthogonal search designs are capable of searching and identifying up to four two-factor interactions and estimating them along with the general mean and main effects. The resulted designs have very high searching probabilities; it means that besides the well-known orthogonal structure, they have high ability in searching the true effects.     

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.     

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.      

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.     

A note on the selection of optimal foldover plans for 16- and 32-run fractional factorial designs

The minimum aberration criterion has been advocated for ranking foldovers of 2^k−p$2^{k-p}$ fractional factorial designs (Li and Lin, 2003); however, a minimum aberration design may not maximize the number of clear low-order effects. We propose using foldover plans that sequentially maximize the number of clear low-order effects in the combined (initial plus foldover) design and investigate the extent to which these foldover plans differ from those that are optimal under the minimum aberration criterion. A small catalog is provided to summarize the results.     

Existence conditions for balanced fractional 3m factorial designs of resolution R({00, 10, 01, 20, 11})

We consider a fractional 3^m factorial design derived from a simple array (SA) such that the non negligible factorial effects are the general mean, the linear and the quadratic components of the main effect, and the linear-by-linear and the linear-by-quadratic components of the two-factor interaction. If these effects are estimable, then a design is said to be of resolution R({00, 10, 01, 20, 11}). In this paper, we give a necessary and sufficient condition for an SA to be a balanced fractional 3^m factorial design of resolution R({00, 10, 01, 20, 11}). Such a design is concretely characterized by the suffixes of the indices of an SA.     

Modifying and using Yates' algorithm

It is well known that Yates' algorithm can be used to estimate the effects in a factorial design. We develop a modification of this algorithm and call it modified Yates' algorithm and its inverse. We show that the intermediate steps in our algorithm have a direct interpretation as estimated level-specific mean values and effects. Also we show how Yates' or our modified algorithm can be used to construct the blocks in a 2 ^k factorial design and to generate the layout sheet of a 2 ^k−p fractional factorial design and the confounding pattern in such a design. In a final example we put together all these methods by generating and analysing a 2^6-2 design with 2 blocks.     

Some MV-optimal group divisible type block designs for comparing a set of test treatments with a set of standard treatments

In this paper, we consider experimental situations in which it is desired to optimally compare t-test treatments to s standard treatments using a block design in which the experimental units are arranged in b blocks of size k. A method is given for generating an MV-optimal block design for such situations and sufficient conditions are derived which can often be used to establish the MV-optimality of reinforced group divisible designs which are often obtained using the process given.     

Characterization of information matrices for balanced two-level fractional factorial designs of odd resolution derived from two-symbol simple arrays

We consider a balanced fractional 2^m factorial design of resolution 2?+1 which permits estimation of all factorial effects up through ?-factor interactions under the situation in which all (?+1)-factor and higher order interactions are to be negligible for an integer satisfying [m/2]<lE;?m, where [x] denotes the greatest integer not exceeding x. This paper investigates algebraic structure of the information matrix of such a design derived from a simple array through that of an atomic array. We obtain an explicit expression for the irreducible matrix representation based on the above design and its algebraic properties. The results in this paper will be useful to characterize the designs under consideration.