Block-circulant matrices for constructing optimal Latin hypercube designs

Computer simulations are usually needed to study a complex physical process. In this paper, we propose new procedures for constructing orthogonal or low-correlation block-circulant Latin hypercube designs. The basic concept of these methods is to use vectors with a constant periodic autocorrelation function to obtain suitable block-circulant Latin hypercube designs. A general procedure for constructing orthogonal Latin hypercube designs with favorable properties and allowing run sizes being different from a power of 2 (or a power of 2 plus 1), is presented here for the first time. In addition, an expansion of the method is given for constructing Latin hypercube designs with low correlation. This expansion is useful when orthogonal Latin hypercube designs do not exist. The properties of the generated designs are further investigated. Some examples of the new designs, as generated by the proposed procedures, are tabulated. In addition, a brief comparison with the designs that appear in the literature is given.     

Orthogonal Latin hypercube designs for Fourier-polynomial models

Latin hypercube designs (LHDs) are widely used in computer experiments because of their one-dimensional uniformity and other properties. Recently, a number of methods have been proposed to construct LHDs with properties that all linear effects are mutually orthogonal and orthogonal to all second-order effects, i.e., quadratic effects and bilinear interactions. This paper focuses on the construction of LHDs with the above desirable properties under the Fourier-polynomial model. A convenient and flexible algorithm for constructing such orthogonal LHDs is provided. Most of the resulting designs have different run sizes from that of Butler (2001), and thus are new and very suitable for factor screening and building Fourier-polynomial models in computer experiments as discussed in Butler (2001).     

Construction of nested space-filling designs using difference matrices

Experiments that study complex real world systems in business, engineering and sciences can be conducted at different levels of accuracy or sophistication. Nested space-filling designs are suitable for such multi-fidelity experiments. In this paper, we propose a systematic method to construct nested space-filling designs for experiments with two levels of accuracy. The method that makes use of nested difference matrices can be easily performed, many nested space-filling designs for experiments with two levels of accuracy can thus be constructed, and the resulting designs achieve stratification in low dimensions. In addition, the proposed method can also be used to obtain sliced space-filling designs for conducting computer experiments with both qualitative and quantitative factors.     

Some new constructions of strength 3 mixed orthogonal arrays

Orthogonal arrays of strength 3 permit estimation of all the main effects of the experimental factors free from confounding or contamination with 2-factor interactions. We introduce methods of using arithmetic formulations and Latin squares to construct mixed orthogonal arrays of strength 3. Although the methods could be well extended to computing larger arrays, we confine computing to at most 100 run orthogonal arrays for practical uses. We find new arrays with run sizes 80 and 96, each has many distinct factor levels.     

Projection array based designs for computer experiments

In this paper we define a new class of designs for computer experiments. A projection array based design defines sets of simulation runs with properties that extend the conceptual properties of orthogonal array based Latin hypercube sampling, particularly to underlying design structures other than orthogonal arrays. Additionally, we illustrate how these designs can be sequentially augmented to improve the overall projection properties of the initial design or focus on interesting regions of the design space that need further exploration to improve the overall fit of the underlying response surface. We also illustrate how an initial Latin hypercube sample can be expressed as a projection array based design and show how one can augment these designs to improve higher dimensional space filling properties.     

Space-filling orthogonal arrays of strength two

This paper considers the use of orthogonal arrays of strength two as experimental designs for fitting a surrogate model. Contrary to standard space-filling designs or Latin hypercube designs, the points of an orthogonal array of strength two are well distributed when they are projected on the two-dimensional faces of the unit cube. The aim is to determine if this property allows one to fit an accurate surrogate model when the computer response is governed by second-order interactions of some input variables. The first part of the paper is devoted to the construction of orthogonal arrays with space-filling properties. In the second part, orthogonal arrays are compared with standard designs for fitting a Gaussian process model.     

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 incomplete Latin square designs

Latin squares have been widely used to design an experiment where the blocking factors and treatment factors have the same number of levels. For some experiments, the size of blocks may be less than the number of treatments. Since not all the treatments can be compared within each block, a new class of designs called balanced incomplete Latin squares (BILS) is proposed. A general method for constructing BILS is proposed by an intelligent selection of certain cells from a complete Latin square via orthogonal Latin squares. The optimality of the proposed BILS designs is investigated. It is shown that the proposed transversal BILS designs are asymptotically optimal for all the row, column and treatment effects. The relative efficiencies of a delete-one-transversal BILS design with respect to the optimal designs for both cases are also derived; it is shown to be close to 100%, as the order becomes large.     

A fast general extension algorithm of Latin hypercube sampling

A fast general extension algorithm of Latin hypercube sampling (LHS) is proposed, which reduces the time consumption of basic general extension and preserves the most original sampling points. The extension algorithm starts with an original LHS of size m and constructs a new LHS of size m?+?n that remains the original points. This algorithm is the further research of basic general extension, which cost too much time to get the new LHS. During selecting the original sampling points to preserve, time consumption is cut from three aspects. The first measure of the proposed algorithm is to select isolated vertices and divide the adjacent matrix into blocks. Secondly, the relationship of original LHS structure and new LHS structure is discussed. Thirdly, the upper and lower bounds help reduce the time consumption. The proposed algorithm is applied for two functions to demonstrate the effectiveness.     

On the construction of orthogonal factorial designs of resolution 11

A new method of construction of orthogonal resolution IV designs for symmetrical and asymmetrical factorials has been presented. Many new series of orthogonal factorial designs of resolution IV can be obtained by the above general method.     

Some robust parameter designs from orthogonal arrays

Robust parameter design, originally proposed by Taguchi [System of Experimental Design, Vols. I and II, UNIPUB, New York, 1987], is an offline production technique for reducing variation and improving a product's quality by using product arrays. However, the use of the product arrays results in an exorbitant number of runs. To overcome this drawback, several scientists proposed the use of combined arrays, where the control and noise factors are combined in a single array. In this paper, we use non-isomorphic orthogonal arrays as combined arrays, in order to identify a model that contains all the main effects (control and noise), their control-by-noise interactions and their control-by-control interactions with high efficiency. Some cases where the control-by-control-noise are of interest are also considered.     

Statistical properties of Rechtschaffner designs

Rechtschaffner designs are saturated designs of resolution V   in which main effects and two-factor interactions are estimable if three-factor and higher order interactions are negligible. Statistical properties of Rechtschaffner designs are studied in this paper. Best linear unbiased estimators of main effects and two-factor interactions are given explicitly and asymptotic properties of correlations between these estimators are studied as well. It is shown that designs recommended by Rechtschaffner [1967. Saturated fractions of 2ⁿ$2^n$ and 3ⁿ$3^n$ factorial designs, Technometrics 9, 569–576] are not only A-optimal but also D-optimal. Comparisons of Rechtschaffner designs with other A- and D-optimal designs of resolution V are also discussed.     

A class of asymmetrical orthogonal resolution-IV designs

The concept of d-resolvability of orthogonal arrays of strength (d+1) is introduced. This is used to construct orthogonal resolution-IV plans of the type $\text{nt·n·2}{}^{\mathrm{n(m?1)}}\text{mn}{}^2\text{t}$. These plans are minimal and a large number of these plans are new.     

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.     

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.     

Construction of some new families of nested orthogonal arrays

Nested orthogonal arrays have been used in the design of an experimental setup consisting of two experiments, the expensive one of higher accuracy being nested in a larger and relatively less expensive one of lower accuracy. In this paper, we provide new methods for constructing two types of nested orthogonal arrays.     

Some important classes of generalized neighbor designs for linear blocks

In this paper, some infinite series of generalized neighbor designs are constructed for the linear blocks which are useful to balance out the neighbor effects for the cases where (a) one of the v treatments has some neighbor effects with other treatments, while remaining (v – 1) treatments have half of that neighbor effect among selves, (b) some of the v treatments have some neighbor effect with other treatments, while remaining treatments have half of that neighbor effect among themselves, (c) one of the v treatments has some neighbor effect with other treatments, while remaining (v – 1) treatments have double of that effect among themselves, and (d) some of the v treatments have some neighbor effect with other, while remaining treatments have double of it among themselves.     

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.     

A note on the minimum size of an orthogonal array

It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.

We refer to an array of size less than L_k as a proper fraction. Guided by our main result, we construct a variety of mixed-level proper fractions of strength k ? 1 that also satisfy a certain group-theoretic condition.