Space-filling orthogonal arrays of strength two
From MaRDI portal
Publication:5220794
DOI10.1080/00949655.2014.973880zbMath1457.62241OpenAlexW2014828174MaRDI QIDQ5220794
Publication date: 27 March 2020
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2014.973880
Design of statistical experiments (62K99) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exploratory designs for computational experiments
- Point sets and sequences with small discrepancy
- Design of computer experiments: space filling and beyond
- Factorial design and Abelian groups
- Orthogonal arrays. Theory and applications
- On difference schemes and orthogonal arrays of strength \(t\)
- The design and analysis of computer experiments.
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Optimal Latin hypercube designs for the Kullback-Leibler criterion
- An efficient algorithm for constructing optimal design of computer experiments
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Optimal orthogonal-array-based latin hypercubes
- Orthogonal Array-Based Latin Hypercubes
This page was built for publication: Space-filling orthogonal arrays of strength two