On the E-optimality of PBIB designs with a small number of blocks

DOI10.1214/aos/1176345896zbMath0489.62067OpenAlexW2013922506MaRDI QIDQ1166872

Gregory M. Constantine

Publication date: 1982

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1176345896

zbMATH Keywords

information matrixeigenvalueefficiencyE-optimalitypartial geometryPBIB designssmall number of blocks

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Statistical block designs (62K10)

Related Items

On the efficiency of regular generalized line graph designs ⋮ Some sufficient conditions for the E- and MV-optimality of block designs having blocks of unequal size ⋮ On the construction of E- and MV-optimal group divisible designs with unequal block sizes ⋮ On the E-optimality of some two-way elimination of heterogeneity designs ⋮ Graph complexity and the laplacian matrix in blocked experiments ⋮ On the E- and MV-optimality of block designs having k\(\geq v\) ⋮ On the E-Optimality of Block Designs with Unequal Block Sizes ⋮ Optimal regular graph designs ⋮ On the E-optimality of a certain class of block designs. ⋮ A note on the \(E\)-optimality of block designs ⋮ E-optimal block designs under heteroscedastic model ⋮ Some E and MV-optimal designs for the two-way elimination of heterogeneity ⋮ Lower bounds on the spectra of symmetric matrices with nonnegative entries