A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs

Related Items (1)

A sequential designing-modeling technique when the input factors are not equally important

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
An effective approach for the optimum addition of runs to three-level uniform designs
A new and flexible method for constructing designs for computer experiments
Construction of orthogonal Latin hypercube designs with flexible run sizes
Orthogonal Latin hypercube designs from generalized orthogonal designs
The design and analysis of computer experiments.
Construction of column-orthogonal designs for computer experiments
Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
Multiple doubling: a simple effective construction technique for optimal two-level experimental designs
New recommended designs for screening either qualitative or quantitative factors
Designing optimal large four-level experiments: a new technique without recourse to optimization softwares
Asymptotically optimal maximin distance Latin hypercube designs
Improving the space-filling behavior of multiple triple designs
New foundations for designing U-optimal follow-up experiments with flexible levels
Construction of uniform designs via an adjusted threshold accepting algorithm
Optimum addition of information to computer experiments in view of uniformity and orthogonality
Cross-entropy loss for recommending efficient fold-over technique
A general construction for space-filling Latin hypercubes
A new look on optimal foldover plans in terms of uniformity criteria
A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
Construction of orthogonal and nearly orthogonal latin hypercube designs from orthogonal designs
Maximin Latin Hypercube Designs in Two Dimensions
Nearly orthogonal latin hypercube designs for many design columns
Space-filling properties of good lattice point sets
Orthogonal and nearly orthogonal designs for computer experiments
Construction of orthogonal and nearly orthogonal Latin hypercubes
Construction of orthogonal Latin hypercube designs
Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
Uniform Design: Theory and Application
A theorem for selecting oa-based latin hypercubes using a distance criterion
A catalog of optimal foldover plans for constructing U-uniform minimum aberration four-level combined designs
Constructing optimal projection designs
Maximum projection designs for computer experiments
A closer look at de-aliasing effects using an efficient foldover technique
On the connection between maximin distance designs and orthogonal designs
Some classes of orthogonal Latin hypercube designs
A construction method for orthogonal Latin hypercube designs
On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
A note on generalized aberration in factorial designs
Degree of isomorphism: a novel criterion for identifying and classifying orthogonal designs
New non-isomorphic detection methods for orthogonal designs

This page was built for publication: A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs