Let w
be a design with information matrix M
, let n
be the number of design points and let m
be the number of
parameters of the model.
For w
, the value of the criterion of D-optimality is computed as (det(M))^(1/m)
and the value of the criterion
of A-optimality is computed as m/trace(M.inv)
, where M.inv
is the inverse of M
.
The IV-optimal design, sometimes called I-optimal or V-optimal, minimizes the integral of the variances
of the BLUEs of the response surface over a region R
, or the sum of the variances over R
, if R
is finite;
see Section 10.6 in Atkinson et al. Let the matrix L
be the integral (or the sum) of F[x,]%*%t(F[x,])
over x
in R
.
If the criterion of IV-optimality is selected, the region R
should be chosen such that the associated matrix L
is non-singular.
Then, let L=t(C)%*%C
be the Cholesky decomposition of L
. The design w
is IV-optimal in the model given by F
,
if and only if w
is A-optimal for the model with the regressors matrix F%*%C.inv
, where C.inv
is the inverse of C
.
For the purpose of this package, the value of the IV-criterion for w
is m/trace(N.inv)
,
where N.inv
is the inverse of the information matrix of w
in the model given by regressors matrix F%*%C.inv
, and
every computational problem of IV-optimality is converted to the corresponding problem of A-optimality. The argument
R
is assumed to be a subset of 1:n
. If the application requires that R
is not a subset of the set of design points,
the user should compute the matrix C
, transform the model as described above, and use the procedures for A-optimality.
If the information matrix is singular, the value of all three criteria is zero. An information matrix is considered
to be singular, if its minimal eigenvalue is smaller than m*tol
.