Sequential good lattice point sets for computer experiments

扫码查看

原文链接

万方数据

外文摘要：Sequential Latin hypercube designs(SLHDs)have recently received great attention for computer experiments,with much of the research restricted to invariant spaces.The related systematic construction methods are inflexible,and algorithmic methods are ineffective for large designs.For designs in contracting spaces,systematic construction methods have not been investigated yet.This paper proposes a new method for constructing SLHDs via good lattice point sets in various experimental spaces.These designs are called sequential good lattice point(SGLP)sets.Moreover,we provide efficient approaches for identifying the(nearly)optimal SGLP sets under a given criterion.Combining the linear level permutation technique,we obtain a class of asymptotically optimal SLHDs in invariant spaces,where the L1-distance in each stage is either optimal or asymptotically optimal.Numerical results demonstrate that the SGLP set has a better space-filling property than the existing SLHDs in invariant spaces.It is also shown that SGLP sets have less computational complexity and more adaptability.

外文关键词：

contracting spacemaximin distancenested Latin hypercube designsequential designspace-filling design

作者：

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

展开 >

作者单位：

NITFID,LPMC & KLMDASR,School of Statistics and Data Science,Nankai University,Tianjin 300071,China

Department of Statistics,Purdue University,West Lafayette,IN 47907,USA

基金：

National Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaNational Ten Thousand Talents ProgramFundamental Research Funds for the Central UniversitiesChina Scholarship CouncilU.S.National Science Foundation

项目编号：

118712881213100112226343DMS-18102925

出版年：

2024

DOI：

10.1007/s11425-021-2087-2

中国科学:数学(英文版)

中国科学院

中国科学:数学(英文版)

CSTPCD

影响因子：0.36

ISSN：1674-7283

年,卷(期)：2024.67(9)