For many expensive deterministic computer simulators, the outputs do not have
replication error and the desired metamodel (or emulator) is an interpolator of
the observed data. Realizations of Gaussian spatial processes (GP) are commonly
used to model such simulator outputs. Fitting a GP model to $n$ data points
requires inversion of $n \times n$ correlation matrices, $R$, that are
sometimes computationally unstable due to near-singularity of $R$. This happens
if any pair of design points are very close together in the input space.
Deterministic computer simulations are often used as a replacement for
complex physical experiments. Although less expensive than physical
experimentation, computer codes can still be time-consuming to run. An
effective strategy for exploring the response surface of the deterministic
simulator is the use of an approximation to the computer code, such as a
Gaussian process (GP) model, coupled with a sequential sampling strategy for
choosing design points that can be used to build the GP model.
Regular factorial designs with randomization restrictions are widely used in
practice. This paper provides a unified approach to the construction of such
designs using randomization defining contrast subspaces for the representation
of randomization restrictions. We use finite projective geometry to determine
the existence of designs with the required structure and develop a systematic
approach for their construction. An attractive feature is that commonly used
factorial designs with randomization restrictions are special cases of this
general representation.