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.     

Balanced and partially balanced incomplete block designs with autocorrelation errors

The paper aims to find variance balanced and variance partially balanced incomplete block designs when observations within blocks are autocorrelated and we call them BIBAC and PBIBAC designs. Orthogonal arrays of type I and type II when used as BIBAC designs have smaller average variance of elementary contrasts of treatment effects compared to the corresponding Balanced Incomplete Block (BIB) designs with homoscedastic, uncorrelated errors. The relative efficiency of BIB designs compared to BIBAC designs depends on the block size k and the autocorrelation ρ and is independent of the number of treatments. Further this relative efficiency increases with increasing k. Partially balanced incomplete block designs with autocorrelated errors are introduced using partially balanced incomplete block designs and orthogonal arrays of type I and type II.     

On some new search designs for 2m factorial experiments

In this paper, we obtain search designs with reasonably small number of treatments which permit the estimation of the general mean and main effects and search of one more unknown possible nonzero effect among two and three factor interactions in 2^m factorial experiments, 3 ? m ? 8.     

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.     

Balanced fractional factorial designs of resolution 2l+1 for interesting effects orthogonal to some nuisance parameters: 2m1+m2 series

For 2^m₁+m₂ factorial designs, this paper investigates balanced fractional 2^m₁ factorial designs of resolution 2l+1 with some nuisance parameters concerning the second factors. They are derivable from partially balanced arrays and further permit estimation of the effects up to the l-factor interactions concerning the first factors orthogonally to the nuisance parameters.     

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.     

Search designs for 2m factorial experiments

Theorems 5, 6 and 10, and Tables 1–2 in Ghosh (1981) are corrected. These are concerned with search designs which permit the estimation of the general mean and main effects, and allow the search and estimation of one possibly unknown nonzero effect among the two- and three-factor interactions in 2^m factorial experiments. Some new results are presented.     

Constructing non-regular robust parameter designs

In recent years there has been considerable attention paid to robust parameter design as a strategy for variance reduction. Of particular concern is the selection of a good experimental plan in light of the two different types of factors in the experiment (control and noise) and the asymmetric manner in which effects of the same order are treated. Recent work has focussed on the selection of regular fractional factorial designs in this setting. In this article, we consider the construction and selection of optimal non-regular experiment plans for robust parameter design. Our approach defines the word-length pattern for non-regular fractional factorial designs with two different types of factors which allows for the choice of optimal design to emphasize the estimation of the effects of interest. We use this new word-length pattern to rank non-regular robust parameter designs. We show that one can easily find minimum aberration robust parameter designs from existing orthogonal arrays. The methodology is demonstrated by finding optimal assignments for control and noise factors for 12, 16 and 20-run orthogonal arrays.     

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.     

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.     

Indicator function and complex coding for mixed fractional factorial designs

In a general fractional factorial design, the n levels of a factor are coded by the nth roots of the unity. This device allows a full generalization to mixed-level designs of the theory of the polynomial indicator function which has already been introduced for two-level designs in a joint paper with Fontana. The properties of orthogonal arrays and regular fractions are discussed.     

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.     

Mixture designs with orthogonal blocks

Constructions of blocked mixture designs are considered in situations where BLUEs of the block effect contrasts are orthogonal to the BLUEs of the regression coefficients. Orthogonal arrays (OA), Balanced Arrays (BAs), incidence matrices of balanced incomplete block designs (BIBDs), and partially balanced incomplete block designs (PBIBDs) are used. Designs with equal and unequal block sizes are considered. Also both cases where the constants involved in the orthogonality conditions depend and do not depend on the factors have been taken into account. Some standard (already available) designs can be obtained as particular cases of the designs proposed here.     

The lattice of N-run orthogonal arrays

If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice structure, induced by the “expansive replacement” construction method. In particular the dual atoms in this lattice are the most important parameter sets, since any other parameter set for an N-run orthogonal array can be constructed from them. To get a sense for the number of dual atoms, and to begin to understand the lattice as a function of N, we investigate the height and the size of the lattice. It is shown that the height is at most ⌊c(N−1)⌋, where c=1.4039…, and that there is an infinite sequence of values of N for which this bound is attained. On the other hand, the number of nodes in the lattice is bounded above by a superpolynomial function of N (and superpolynomial growth does occur for certain sequences of values of N). Using a new construction based on “mixed spreads”, all parameter sets with 64 runs are determined. Four of these 64-run orthogonal arrays appear to be new.     

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 simple method to obtain minimum aberration split-plot designs

ABSTRACT

Split-plot designs have been utilized in factorial experiments with some factors applied to larger units and others to smaller units. Such designs with low aberration are preferred when the experimental size and the number of factors considered in both whole plot and subplot are determined. The minimum aberration split-plot designs can be obtained using either computer algorithms or the exhausted search. In this article, we propose a simple, easy-to-operate approach by using two ordered sequences of columns from two orthogonal arrays in obtaining minimum aberration split-plot designs for experiments of sizes 16 and 32.     

An isomorphism check for two-level fractional factorial designs

Two fractional factorial designs are isomorphic if one can be obtained from the other by reordering the treatment combinations, relabelling the factor levels and relabelling the factors. By defining a word-pattern matrix, we are able to create a new isomorphism check which is much faster than existing checks for certain situations. We combine this with a new, extremely fast, sufficient condition for non-isomorphism to avoid checking certain cases. We then create a faster search algorithm by combining the Bingham and Sitter [1999. Minimum aberration fractional factorial split-plot designs. Technometrics 41, 62–70] search algorithm, the isomorphism check algorithm of Clark and Dean [2001. Equivalence of fractional factorial designs. Statist. Sinica 11, 537–547] with our proposed isomorphism check. The algorithm is used to extend the known set of existing non-isomorphic 128-run two-level regular designs with resolution ?4$?4$ to situations with 12, 13, 14, 15 and 16 factors, 256- and 512-run designs with resolution ?5$?5$ and ?17$?17$ factors and 1024-run even designs with resolution ?6$?6$ and ?18$?18$ factors.     

Three-factor symmetrical balanced designs with full efficiency for main effects

Some methods for constructing balanced design for 3-factor symmetrical factorial experiments in which all the main effects are completely unconfounded by using balanced arrays and BIB designs are proposed. The method is flexible in terms of selecting block size.     

Some mixed orthogonal arrays obtained by orthogonal projection matrices

The method of orthogonal decomposition of projection matrices is used to construct mixed orthogonal arrays of strength two. Several series of tight orthogonal arrays are constructed by using difference schemes. This method is also used to obtain some new 72-run, 100-run, and 108-run orthogonal arrays.     

On the construction of balanced and orthogonal arrays

Two series of three symbol balanced arrays of strength two are constructed. Using special classes of BIB designs, two classes of two symbol orthogonal arrays of strength three are constructed.