A class of space-filling designs and their projection properties
From MaRDI portal
Publication:722673
DOI10.1016/J.SPL.2018.06.002zbMATH Open1402.62181OpenAlexW2809443913MaRDI QIDQ722673FDOQ722673
Publication date: 27 July 2018
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2018.06.002
Box-Cox transformationcomputer experimentmaximin designlatin hypercube designmaximum projection design
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The design and analysis of computer experiments.
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Maximum projection designs for computer experiments
- Exploratory designs for computational experiments
- A generalized discrepancy and quadrature error bound
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Construction of nested space-filling designs
- Sliced space-filling designs
- Optimal Latin-hypercube designs for computer experiments
- Maximin Latin Hypercube Designs in Two Dimensions
- On algorithmic construction of maximin distance designs
Cited In (5)
- On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
- The Reconstruction Approach: From Interpolation to Regression
- Design and Analysis of Computer Experiments with both Numeral and Distributional Inputs
- Title not available (Why is that?)
- Sequential design of multi-fidelity computer experiments with effect sparsity
This page was built for publication: A class of space-filling designs and their projection properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722673)