Decomposability of the C-matrix of a two-way elimination of heterogeneity design

DOI10.1016/0378-3758(93)90132-PMaRDI QIDQ689400zbMATH OpenOpenAlexFDO

Authors Jerzy K. Baksalary, Idzi Siatkowski

Publication date 5 December 1993

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0378-3758(93)90132-p

zbMATH Keywords

\(C\)-matrixdecomposabilitygeneral two-way elimination of heterogeneity designlinear modelnecessary conditionsrow-and-column designsufficient conditions

Mathematics Subject Classification ID

Design of statistical experiments (62K99)

Recommendations

• Decomposable three-way layouts
• Balanced factorial designs with two-way elimination of heterogeneity
• Some bounds for balanced two-way elimination of heterogeneity designs
• On the E-optimality of some two-way elimination of heterogeneity designs
• Some E and MV-optimal designs for the two-way elimination of heterogeneity

Cites work

• A rank characterization of linear models with nuisance parameters and its application to block designs
• scientific article; zbMATH DE number 3700060 (Why is no real title available?)
• On connectedness in two-way elimination of heterogeneity designs
• On connectedness of ordinary two-way elimination of heterogeneity designs
• On Designs with One–Way and Two–Way Elimination of Heterogeneity
• Three-Factor Additive Designs More General Than the Latin Square

Cited in

(2)

• On some of Jerzy Baksalary's contributions to the theory of block designs
• Decomposable three-way layouts

This page was built for publication: Decomposability of the C-matrix of a two-way elimination of heterogeneity design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689400)