International Journal of Statistics and Applications
p-ISSN: 2168-5193 e-ISSN: 2168-5215
2019; 9(3): 74-78
doi:10.5923/j.statistics.20190903.02

Sunita Khurana, Shakti Banerjee
School of Statistics, Devi Ahilya University, Indore, M.P., India
Correspondence to: Shakti Banerjee, School of Statistics, Devi Ahilya University, Indore, M.P., India.
| Email: | ![]() |
Copyright © 2019 The Author(s). Published by Scientific & Academic Publishing.
This work is licensed under the Creative Commons Attribution International License (CC BY).
http://creativecommons.org/licenses/by/4.0/

Orthogonal arrays such as factorial and fractional factorial designs of experimental plans are used for identifying important factors to improve quality of an experiment. Super Saturated designs are very cost-effective in the stage of scientific investigations. Nearly-Orthogonal arrays that can construct a variety of small-run designs with different levels have good statistical properties. In the present paper Super Saturated design and Nearly Orthogonal design are constructed with Orthogonal design. It is a great deal of interest in the development of factor screening experiments that are optimal or highly efficient under the E (s2) and J2 criterion.
Keywords: Orthogonal design, Nearly Orthogonal design, Super saturated design, Hadamard matrix, D-optimality, J2-optimality
Cite this paper: Sunita Khurana, Shakti Banerjee, A Method for Constructing Super Saturated Design and Nearly Orthogonal Design with Mixed Level Orthogonal Design, International Journal of Statistics and Applications, Vol. 9 No. 3, 2019, pp. 74-78. doi: 10.5923/j.statistics.20190903.02.
and
Now in an ordinary factorial experiment, where we assume interactions being ignored, the efficient and simple estimation of main effects by calculating the orthogonality of all design columns (Plackett & Burman, 1946) [1] is ensured. So, the condition required is,![]() | (1) |
![]() | (2) |
|
|
Clearly the orthogonal design ave(S2)=0.The rationale of the Booth-Cox criterion can be explained by using the singular value decomposition to decompose X as UA1/2V’ where matrices U and V are orthogonal and A is diagonal. It can be shown that X’X and XX’ share the same set of non-zero eigenvalues (λ1, ..., λr). Where, r =rank(X’X)=rank(XX’). Moreover
Thus, minimizing
which is equivalent to minimizing tr (X’X)2), is the same as making the λi ‘s equal as possible with
= constant.This in a sense is an approximation of the A-Optimality criterion, which requires the maximization of
Because the sum of each column of X is 0, the sum of the elements of XX’ is 0 i.e. the sum of the off diagonal elements of XX’ equal to –np (np is the sum of the diagonal elements of XX’).Thus, the sum of square of elements of XX’ and X’X will reach the minimum if XX’ is of the form (p-x) In+Jn where x=-p/n-1 (assuming p is divisible by n-1), In is the identity matrix and Jn is the n*n matrix of 1’s.In this case ave (S2) = n (p2+ (n-1) x2-pn)/p (p-1) = n2(p-n+1)/(n-1)(p-1).
|
matrix d=[xik], weight wk>0 is assigned for column k, which has sk levels. For 1≤ i< j≤ N, let
, where
if x=y and 0 otherwise. The
value measures the similarity between the ith and jth rows of d. In particular, if wk=1 is chosen for all k, then
is the number of coincidences between the ith and jth rows.Define
A design is optimal if it minimizes J2. By minimizing J2(d), it is desired that the rows of d be as dissimilar as possible. The following lemma shows an important lower bound of J2.Lemma: For an
matrix d whose kth column has sk levels and weight wk,![]() | (3) |
It is easy to verify that J2=330 and that the lower bound in (3) is also 330 for one factor have 3 level and four factor have 2 level column with wk=1. Therefore, we consider the first five columns from OA (12, 31, 29), because the J2 value equals the lower bound.Next, consider the whole array, comprising all 10 columns. Same calculation shows that J2= 1284 and that the lower bound of (3) is 1260. Therefore, the whole array is not an OA because the J2 value is greater than the lower bound.