Orthogonal and nearly orthogonal designs for computer experiments

DOI10.1093/BIOMET/ASN057MaRDI QIDQ3613152zbMATH OpenOpenAlexFDO

Authors Randy R. Sitter, Boxin Tang, Derek Bingham

Publication date 11 March 2009

Published in Biometrika (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/58bf0508c2f67bb7f5b7765f9c9b8b5ac691c740

zbMATH Keywords

fractional factorialHadamard matrixJ-characteristicKronecker productLatin hypercubeorthogonal arrayresolution IV design

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15)

Recommendations

• Orthogonal designs for computer experiments
• A new and flexible method for constructing designs for computer experiments
• Construction of orthogonal and nearly orthogonal designs for computer experiments
• scientific article; zbMATH DE number 7295794
• Construction of nested (nearly) orthogonal designs for computer experiments

Cited in

(82)

• Minimum projection uniformity for computer experiment with quantitative factors
• Construction of column-orthogonal designs for computer experiments
• Computer experiments: a review
• Column-orthogonal designs with multi-dimensional stratifications
• Multiple doubling: a simple effective construction technique for optimal two-level experimental designs
• Connecting U-type designs before and after level permutations and expansions
• Flexible sliced Latin hypercube designs with slices of different sizes
• Construction of orthogonal marginally coupled designs
• Construction of column-orthogonal strong orthogonal arrays
• Construction of group strong orthogonal arrays of strength two plus
• Using nonregular designs to generate space-filling designs
• On maximin distance and nearly orthogonal Latin hypercube designs
• Column-orthogonal nearly strong orthogonal arrays
• Construction results for strong orthogonal arrays of strength three
• Optimal maximin \(L_2\)-distance Latin hypercube designs
• Column-orthogonal and nearly column-orthogonal designs for models with second-order terms
• Construction of sliced (nearly) orthogonal Latin hypercube designs
• Optimal and orthogonal Latin hypercube designs for computer experiments
• Nearly orthogonal arrays mappable into fully orthogonal arrays
• A framework for controlling sources of inaccuracy in Gaussian process emulation of deterministic computer experiments
• Construction of orthogonal and nearly orthogonal designs for computer experiments
• Orthogonal Latin hypercube designs with special reference to four factors
• Resolvable partially pairwise balanced designs and their applications in computer experiments
• Nearly orthogonal Latin hypercube designs for many design columns
• scientific article; zbMATH DE number 1247728 (Why is no real title available?)
• scientific article; zbMATH DE number 472934 (Why is no real title available?)
• Projection array based designs for computer experiments
• scientific article; zbMATH DE number 1131779 (Why is no real title available?)
• Some new classes of orthogonal Latin hypercube designs
• Accurate emulators for large-scale computer experiments
• On the existence and constructions of orthogonal designs
• U-type and column-orthogonal designs for computer experiments
• Construction of nested (nearly) orthogonal designs for computer experiments
• Construction of second-order orthogonal sliced Latin hypercube designs
• Sliced Latin Hypercube Designs
• Algorithmic construction of nearly column-orthogonal designs
• On second order orthogonal Latin hypercube designs
• Nearly column-orthogonal designs based on leave-one-out good lattice point sets
• Algorithms for generating maximin Latin hypercube and orthogonal designs
• Orthogonal designs via computational algebra
• Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains
• On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
• Construction of nearly orthogonal Latin hypercube designs
• Construction of nearly orthogonal Latin hypercube designs
• Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs
• A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs
• A unifying implementation of stratum (aka strong) orthogonal arrays
• Theory of J-characteristics of four-level designs under quaternary codes
• On the maximin distance properties of orthogonal designs via the rotation
• Orthogonal designs for computer experiments
• Block-circulant matrices for constructing optimal Latin hypercube designs
• Creating catalogues of two-level nonregular fractional factorial designs based on the criteria of generalized aberration
• A class of space-filling designs with low-dimensional stratification and column orthogonality
• Latin hypercube sampling with multidimensional uniformity
• New bounds and search for maximin distance U-type designs
• Construction of high-dimensional high-separation distance designs
• A new class of strong orthogonal arrays of strength three
• Column expanded Latin hypercube designs
• Strong orthogonal Latin hypercubes for computer experiments
• Direct constructions of column-orthogonal strong orthogonal arrays
• Mixed-level designs with orthogonality and relatively optimal run order
• A Projection Space-Filling Criterion and Related Optimality Results
• On construction of sliced orthogonal Latin hypercube designs
• A construction method for column-orthogonal strong orthogonal arrays
• Grouped orthogonal arrays for computer experiments with grouped inputs
• A new class of orthogonal designs with good low dimensional space-filling properties
• Constructing orthogonal maximin distance uniform projection designs for computer experiments
• Robust Design for Order-of-Addition Experiments
• Construction of mixed-level column-orthogonal strong orthogonal arrays of strength two plus
• On construction of strong orthogonal arrays and column-orthogonal strong orthogonal arrays of strength two plus
• On construction of mappable nearly orthogonal arrays with column-orthogonality
• Construction of designs with space-filling and orthogonal property
• Group strong orthogonal arrays and their construction methods
• Orthogonal designs for computer experiments constructed from sequences with zero autocorrelation
• Construction of doubly coupled designs with desirable space-filling properties
• Construction of column-orthogonal strong orthogonal arrays of strength 3
• Construction of grouped (nearly) orthogonal Latin hypercube designs
• Construction of Asymmetric Nested Orthogonal Arrays
• Cascaded binary-to-hexadecimal gray maps for high-dimensional space-filling designs
• Construction of space-filling orthogonal designs
• A new and flexible method for constructing designs for computer experiments
• Construction of orthogonal Latin hypercube designs with flexible run sizes

This page was built for publication: Orthogonal and nearly orthogonal designs for computer experiments

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