Orthogonal space-filling designs for computer experiments
From MaRDI portal
Publication:2993355
zbMATH Open1349.62347MaRDI QIDQ2993355FDOQ2993355
Authors: Weiyan Mu, Dongli Cui, Shifeng Xiong
Publication date: 10 August 2016
Recommendations
Cited In (9)
- Efficient designs based on orthogonal arrays of type I and type II for experiments using units ordered over time or space
- On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
- A spectral approach for the design of experiments: design, analysis and algorithms
- A class of space-filling designs and their projection properties
- Isovolumetric adaptations to space-filling design of experiments
- A note on automatic construction algorithms for orthogonal designs of experiments using error correcting codes
- Space-filling designs on Riemannian manifolds
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Construction of column-orthogonal designs for computer experiments
This page was built for publication: Orthogonal space-filling designs for computer experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993355)