International audienceIn this paper we study the problem of finding neighbor optimal designs for a general correlation structure. We give universal optimality conditions for nearest-neighbor (NN) balanced block designs when observations on the same block are modeled by an autoregressive AR(m) process with arbitrary order m. The cases m=1,2 have been studied by Grondona and Cressie (Sankhyā Indian J Stat Ser A 55(2):267–284, 1993) for AR(2) and by Gill and Shukla (Biometrika 72(3):539–544, 1985a, Commun Stat Theory Methods 14(9):2181–2197, 1985b) and Kunert (Biometrika 74(4):717–724, 1987) for AR(1); we extend these results to the cases m≥3
This paper deals with E-optimal incomplete block designs in blocks of size three when observations w...
AbstractThis paper deals with E-optimal incomplete block designs in blocks of size three when observ...
(Under the direction of INDRA M. CHAKRAVARTI) For a design with b blocks of k plots each, consecutiv...
This paper studies the optimality of circular neighbor-balanced designs (CNBDs) for total effects wh...
Block designs for observations correlated in one dimension are investigated. Nearest neighbour least...
Optimal designs under general dependence structures are usually difficult to specify theoretically o...
E-optimal designs for comparing three treatments in blocks of size three are identified, where intra...
E-optimal designs forcomparing three treatments in blocks of sizethree are identified, where intrabl...
Not AvailableIn this article, the exchange and interchange algorithm of Zergaw (1989, Austral. J. S...
This paper presents M V-optimal block designs for three treatments having b = 3 n + 1 blocks each of...
This paper presents M V-optimal block designs for three treatments having b = 3 n + 1 blocks each of...
This paper addresses the MV -optimality problem of block designs for three treatments in b = 3n ± 1 ...
This paper presents MV-optimal block designs for three treatments having b = 3n + 1 blocks each of s...
This paper deals with E-optimal incomplete block designs in blocks of size three when observations w...
This paper deals with E-optimal incomplete block designs in blocks of size three when observations w...
This paper deals with E-optimal incomplete block designs in blocks of size three when observations w...
AbstractThis paper deals with E-optimal incomplete block designs in blocks of size three when observ...
(Under the direction of INDRA M. CHAKRAVARTI) For a design with b blocks of k plots each, consecutiv...
This paper studies the optimality of circular neighbor-balanced designs (CNBDs) for total effects wh...
Block designs for observations correlated in one dimension are investigated. Nearest neighbour least...
Optimal designs under general dependence structures are usually difficult to specify theoretically o...
E-optimal designs for comparing three treatments in blocks of size three are identified, where intra...
E-optimal designs forcomparing three treatments in blocks of sizethree are identified, where intrabl...
Not AvailableIn this article, the exchange and interchange algorithm of Zergaw (1989, Austral. J. S...
This paper presents M V-optimal block designs for three treatments having b = 3 n + 1 blocks each of...
This paper presents M V-optimal block designs for three treatments having b = 3 n + 1 blocks each of...
This paper addresses the MV -optimality problem of block designs for three treatments in b = 3n ± 1 ...
This paper presents MV-optimal block designs for three treatments having b = 3n + 1 blocks each of s...
This paper deals with E-optimal incomplete block designs in blocks of size three when observations w...
This paper deals with E-optimal incomplete block designs in blocks of size three when observations w...
This paper deals with E-optimal incomplete block designs in blocks of size three when observations w...
AbstractThis paper deals with E-optimal incomplete block designs in blocks of size three when observ...
(Under the direction of INDRA M. CHAKRAVARTI) For a design with b blocks of k plots each, consecutiv...