Sequential good lattice point sets for computer experiments

DOI10.1007/s11425-021-2087-2MaRDI QIDQ6608131

Xue-Ru Zhang, Yong-Dao Zhou, Dennis K. J. Lin, Min-Qian Liu

Publication date: 19 September 2024

Published in: Science China. Mathematics (Search for Journal in Brave)

zbMATH Keywords

space-filling designmaximin distancesequential designnested Latin hypercube designcontracting space

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Factorial statistical designs (62K15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nested maximin Latin hypercube designs
• On the construction of nested space-filling designs
• Model selection for support vector machines via uniform design
• Construction of nested space-filling designs
• The design and analysis of computer experiments
• Flexible sliced designs for computer experiments
• Theory and application of uniform experimental designs
• Batch sequential designs for computer experiments
• Mixture discrepancy for quasi-random point sets
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Space-filling properties of good lattice point sets
• Localization of Search in Quasi-Monte Carlo Methods for Global Optimization
• Space-Filling Fractional Factorial Designs
• Construction of nested orthogonal latin hypercube designs

This page was built for publication: Sequential good lattice point sets for computer experiments