Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
From MaRDI portal
Publication:4541190
DOI10.2307/2670057zbMath1064.62553OpenAlexW4229696631WikidataQ56428720 ScholiaQ56428720MaRDI QIDQ4541190
Publication date: 30 July 2002
Full work available at URL: https://doi.org/10.2307/2670057
Related Items (60)
On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments ⋮ Construction of column-orthogonal strong orthogonal arrays ⋮ Samurai Sudoku-Based Space-Filling Designs for Data Pooling ⋮ A fast optimal Latin hypercube design method using an improved translational propagation algorithm ⋮ Generalized good lattice point sets ⋮ An overview of the design and analysis of simulation experiments for sensitivity analysis ⋮ LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model ⋮ Orthogonal Latin hypercube designs with special reference to four factors ⋮ Using nonregular designs to generate space-filling designs ⋮ Algorithmic construction of nearly column-orthogonal designs ⋮ On the construction of nested orthogonal Latin hypercube designs ⋮ Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions ⋮ Construction of column-orthogonal designs for computer experiments ⋮ A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs ⋮ Orthogonal designs for computer experiments ⋮ Optimal progressive interval censoring plan under accelerated life test with limited budget ⋮ A unifying implementation of stratum (aka strong) orthogonal arrays ⋮ Setting targets for surrogate-based optimization ⋮ Construction of orthogonal general sliced Latin hypercube designs ⋮ A new rotation method for constructing orthogonal Latin hypercube designs ⋮ Block-circulant matrices for constructing optimal Latin hypercube designs ⋮ Isovolumetric adaptations to space-filling design of experiments ⋮ Construction of maximin \(L_1\)-distance Latin hypercube designs ⋮ A new class of Latin hypercube designs with high-dimensional hidden projective uniformity ⋮ Some new classes of orthogonal Latin hypercube designs ⋮ Accurate emulators for large-scale computer experiments ⋮ Construction of sliced (nearly) orthogonal Latin hypercube designs ⋮ MILP models for the selection of a small set of well-distributed points ⋮ U-type and column-orthogonal designs for computer experiments ⋮ Uniform projection designs ⋮ Construction of second-order orthogonal sliced Latin hypercube designs ⋮ Column-orthogonal nearly strong orthogonal arrays ⋮ Non-intrusive uncertainty quantification using reduced cubature rules ⋮ On second order orthogonal Latin hypercube designs ⋮ Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs ⋮ Nearly column-orthogonal designs based on leave-one-out good lattice point sets ⋮ Rapid design of metamaterials via multitarget Bayesian optimization ⋮ Surrogate-Based Methods ⋮ Orthogonal-column Latin hypercube designs with small samples ⋮ Algorithms for generating maximin Latin hypercube and orthogonal designs ⋮ A new and flexible method for constructing designs for computer experiments ⋮ Pitfalls of using a single criterion for selecting experimental designs ⋮ Construction of orthogonal Latin hypercube designs with flexible run sizes ⋮ Construction results for strong orthogonal arrays of strength three ⋮ Recent advances in space-mapping-based modeling of microwave devices ⋮ Orthogonal Latin hypercube designs from generalized orthogonal designs ⋮ Column-orthogonal designs with multi-dimensional stratifications ⋮ A Note on the Construction of Orthogonal Latin Hypercube Designs ⋮ Construction of nearly orthogonal Latin hypercube designs ⋮ Construction of nearly orthogonal Latin hypercube designs ⋮ PLS-Based Multivariate Metamodeling of Dynamic Systems ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Connecting U-type designs before and after level permutations and expansions ⋮ Flexible sliced Latin hypercube designs with slices of different sizes ⋮ A note on near-orthogonal Latin hypercubes with good space-filling properties ⋮ Construction of nested space-filling designs ⋮ Algorithmic construction of optimal symmetric Latin hypercube designs. ⋮ Maximum expected entropy transformed Latin hypercube designs ⋮ A study of orthogonal array-based designs under a broad class of space-filling criteria
This page was built for publication: Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
