Equineighboured balanced nested row-column designs

This paper presents equineighboured balanced nested row-column designs for v treatments arranged in b blocks each comprising pq units further grouped into p rows and q columns. These are two-dimensional designs with the property that all pairs of treatments are neighbours equally frequently at all levels in both rows and columns. Methods of construction are given both for designs based on Latin squares and those where pq≤v. Cyclic equineighboured designs are defined and tabulated for 5≤v≤10, p≤3, q≤5, where r=bpq/v is the number of replications of each treatment.     

Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.     

E-optimal designs for three treatments

E-optimality is studied for three treatments in an arbitrary n-way heterogeneity setting. In some cases maximal trace designs cannot be E-optimal. When there is more than one E-optimal design for a given setting, the best with respect to all reasonable criteria is determined.     

Computing E-optimal polynomial regression designs

We consider the problem of computing E-optimal designs in heteroscedastic polynomial regression with not necessarily strictly positive efficiency function. Based on a relation between E- and c-optimal designs, a reasonable candidate for E-optimality is obtained from equioscillating weighted polynomials. Optimality of that candidate is easily checked, at least numerically. Moreover, nonoptimality of that design has some interesting consequences, e.g. on the support, which might be helpful to obtain the optimal design also in this case.For computing the candidate numerically we propose a procedure based on Remez's second algorithm. Convergence of that procedure is verified, extending a result of Studden and Tsay (1976). Numerical examples are presented for some efficiency functions.     

E-optimal block designs under heteroscedastic model

This paper mainly studies the E-optimality of block designs under a general heteroscedastic setting. The C-matrix of a block design under a heteroscedastic setting is obtained by using generalized least squares. Some bounds for the smallest positive eigenvalue of C-matrix are obtained in some general classes of connected designs. Use of these bounds is then made to obtain certain E-optimal block designs in various classes of connected block designs.     

Efficient two-replicate resolvable row-column designs

We relate the efficiency factors of a two-replicate resolvable row-column design to those of a reduced design. This provides a method to search for efficient designs via the reduced design. By choosing the row-component and column-components as generalised cyclic designs, the method is easily implemented and produces efficient designs.     

E-optimal designs for polynomial regression without intercept

We give all E-optimal designs for the mean parameter vector in polynomial regression of degree d without intercept in one real variable. The derivation is based on interplays between E-optimal design problems in the present and in certain heteroscedastic polynomial setups with intercept. Thereby the optimal supports are found to be related to the alternation points of the Chebyshev polynomials of the first kind, but the structure of optimal designs essentially depends on the regression degree being odd or even. In the former case the E-optimal designs are precisely the (infinitely many) scalar optimal designs, where the scalar parameter system refers to the Chebyshev coefficients, while for even d there is exactly one optimal design. In both cases explicit formulae for the corresponding optimal weights are obtained. Remarks on extending the results to E-optimality for subparameters of the mean vector (in heteroscdastic setups) are also given.     

Optimal row-column designs for complete diallel crosses

Universally optimal row-column designs for complete, diallel crosses are investigated. Three series of designs that require just one replication of the crosses are provided. A series of designs having two replications of each cross is also provided.     

(M,S)-optimal row-column designs

Row-column designs may be considered to have two blocking schemes, namely the treatments by rows and treatments by columns component block designs. The (M,S)-optimality criterion is applied to row-column designs, and che connection between the (M,S)-optimal design and its component block designs is demonstrated.     

Some partially variance balanced structurally incomplete row-column designs

Earlier results by the authors are used to provide the intrablock analysis for row-column designs that have observations at nodes of the row-column lattice, the design being structurally incomplete when some nodes are empty. Construction, properties, and intrablock analyses of some special b× b row-column designs with b empty nodes taken along the principal diagonal of the lattice are developed. The designs discussed have m > 1 associate classes and are said to be partially variance balanced. The special designs fall in two classes and are shown to be nearly optimal in a specified class of designs. A small catalog of designs constructed is provided and they should be useful when empty nodes do not represent wasted experimental units, perhaps because the row and column assignments of treatments are sequenced.     

E-optimal incomplete block designs with two distinct block sizes

Sufficient conditions are derived for the determination of E-optimal designs in the class D(v,b₁,b₂,k₁,k₂) of incomplete block designs for v treatments in b₁ blocks of size k₁ each and b₂ blocks of size k₂ each. Some constructions for E-optimal designs that satisfy the sufficient conditions obtained here are given. In particular, it is shown that E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by augmenting b₂ blocks, with k₂ − k₁ extra plots each, of a BIBD(v,b = b₁ + b₂,k₁,λ) and GDD(v,b = b₁ + b₂,k₁,λ₁,λ₂). It is also shown that equireplicate E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by combining disjoint blocks of BIBD(v,b,k₁,λ) and GDD(v,b,k₁,λ₁,λ₂) into larger blocks. As applications of the construction techniques, several infinite series of E-optimal designs with small block sizes differing by at most two are given. Lower bounds for the A-efficiency are derived and it is found that A-efficiency exceeds 99% for v ⩾ 10, and at least 97.5% for 5 ⩽v < 10.     

On the construction of a class of efficient row-column designs

In this paper a method for the construction of a class of row-column designs with good statistical properties and high efficiency is presented. The class of designs produced is shown to exhibit balance, orthogonality and adjusted orthogonality. The efficiencies of these designs are investigated in detail, and they are shown to be very high, and possibly maximal in some cases.     

The connectedness and optimality of a class of row-column designs

Balanced Incomplete Block Designs have been employed as row-column designs by a number of researchers. In this paper necessary and sufficient conditions for the connectedness of such designs are obtained, and methods for their optimisation are presented. The optimal design is shown to be always connected.     

Computing A-optimal and E-optimal designs for regression models via semidefinite programming

In semidefinite programming (SDP), we minimize a linear objective function subject to a linear matrix being positive semidefinite. A powerful program, SeDuMi, has been developed in MATLAB to solve SDP problems. In this article, we show in detail how to formulate A-optimal and E-optimal design problems as SDP problems and solve them by SeDuMi. This technique can be used to construct approximate A-optimal and E-optimal designs for all linear and nonlinear regression models with discrete design spaces. In addition, the results on discrete design spaces provide useful guidance for finding optimal designs on any continuous design space, and a convergence result is derived. Moreover, restrictions in the designs can be easily incorporated in the SDP problems and solved by SeDuMi. Several representative examples and one MATLAB program are given.     

A survey of nested designs

A nest with parameters (r,k,λ)→(r′,k′,λ′) is a BIBD on (b,v,r,k,λ) where each block has a distinguished sublock of cardinality k, the sublocks forming a (b,v,r,k,λ)-design.These designs are ‘nested’ in the sense of W.T. Federer (1972), who recommended the use of these designs for the sequential addition of periods in marketing experiments in order to retain Youden design properties as rows are added. Note that for a Youden design, the b columns and v treatments are in an SBIBD arrangement with parameters v=b, k=r, and λ.     

On nested block designs geometry

Nested block designs and block designs properties such as orthogonality, orthogonal block structure and general balance are examined using the concept of a commutative quadratic subspace and standard properties of orthogonal projectors. In this geometrical context conditions for existence of the best linear unbiased estimators of treatment contrasts are also discussed.     

On uniformly better combined estimates in row-column designs with adjusted orthogonality

In this note we present a simple procedure for obtaining combined estimates of treatment effects in row-column designs with adjusted orthogonality which are better than the fixed effects model estimates in the sense of having a smaller variance uniformly for all values of the variance components.     

A comparison of six methods of analysing row-column designs with inter-block information

Six methods of obtaining estimates of treatment effects in a row-column design are considered. Five methods use estimates of inter-row and inter-column variation, and the remaining method is Ordinary Least Squares. Using simulation, these methods are examined to see which are most appropriate for minimising the sum of the squared differences between the estimates of the elementary treatment contrasts and their true values. Recommendations are made of which methods to use.     

An infinite class of PBIB designs

In this paper, an infinite class of partially balanced incomplete block (PBIB) designs of m+1 associate classes is constructed through the use of a series of row-orthogonal matrices known as partially balanced orthogonal designs (PBOD) of m-associate classes. For the purpose, a series of PBOD is obtained through a method described herein. An infinite class of regular GD designs is also reported.     

Recursive formulae for the average efficiency factor in block and row-column designs

Interchange algorithms are widely used to construct efficient block and row-column designs. We provide simple recursive formulae for updating this average efficiency factor, so that it is no longer computationally expensive to calculate it after each possible interchange.