This paper introduces, constructs and studies a new class of arrays, called strong orthogonal arrays, as suitable designs for computer experiments. A strong orthogonal array of strength <it>t</it> enjoys better space-filling properties than a comparable orthogonal array in all dimensions lower than <it>t</it> while retaining the space-filling properties of the latter in <it>t</it> dimensions. Latin hypercubes based on strong orthogonal arrays of strength <it>t</it> are more space-filling than comparable orthogonal array-based Latin hypercubes in all <it>g</it> dimensions for any 2 ≤ <it>g</it> ≤ <it>t</it> − 1.
Giacomo Grassi, G.J. Nabuurs, Pierre Regnier, Ronny Lauerwald, Matthias Kuhnert, Juraj Balkovič, M.J. Schelhaas, Hugo Denier van der Gon, Efisio Solazzo, Chunjing Qiu, Roberto Pilli, I. B. Konovalov, R. A. Houghton, Dirk Günther, Lucia Perugini, Monica Crippa, Raphael Ganzenmüller, Ingrid T. Luijkx, Pete Smith, Saqr Munassar, Rona L. Thompson, Giulia Conchedda, Guillaume Monteil, Marko Scholze, ,
Discussion(0)
No comments yet. Be the first to comment.