Computation of the Optimum Designs Under Singular Information Matrices
Pazman, Andrej
Ann. Statist., Tome 6 (1978) no. 1, p. 465-467 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
The main result of this paper is that $g$-inverses are not needed for computing optimum designs when the singularity of the information matrix is unavoidable. They are, of course, needed for the analysis. It will be shown that it is possible to augment the experimental region so that procedures for computing optimum designs for $s$ out $k$ parameters $(s < k)$ which are developed for the nonsingular case may also be used for the singular case.
Publié le : 1978-03-14
Classification:  Experimental design,  singular information matrices,  $g$-inverses,  62K05 
@article{1176344137,
     author = {Pazman, Andrej},
     title = {Computation of the Optimum Designs Under Singular Information Matrices},
     journal = {Ann. Statist.},
     volume = {6},
     number = {1},
     year = {1978},
     pages = { 465-467},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176344137}
}

Pazman, Andrej. Computation of the Optimum Designs Under Singular Information Matrices. Ann. Statist., Tome 6 (1978) no. 1, pp.  465-467. http://gdmltest.u-ga.fr/item/1176344137/