A simple approach to constructing quasi-Sudoku-based sliced space-filling designs

DOI10.1007/s10463-016-0565-xzbMath1421.62106arXiv1502.05522OpenAlexW1503899681MaRDI QIDQ2409398

Benjamin Haaland, David J. Nott, Diane M. Donovan

Publication date: 11 October 2017

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.05522

zbMATH Keywords

computer experimentsSudokuspace-filling designssliced experimental designs

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Statistical block designs (62K10)

Related Items (3)

Construction of incomplete Sudoku square and partially balanced incomplete block designs ⋮ Some results on the construction of sliced orthogonal arrays of parallel-flats type ⋮ Sudoku-like arrays, codes and orthogonality

Cites Work

• Sliced space-filling designs with different levels of two-dimensional uniformity
• Orthogonal arrays. Theory and applications
• Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling
• Designs for crossvalidating approximation models
• Sudoku-based space-filling designs
• Construction of sliced space-filling designs based on balanced sliced orthogonal arrays
• Sliced space-filling designs
• Orthogonal Array-Based Latin Hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple approach to constructing quasi-Sudoku-based sliced space-filling designs