Nested Maximum Entropy Designs for Computer Experiments

Author:

Mu Weiyan1,Liu Chengxin1,Xiong Shifeng2ORCID

Affiliation:

1. School of Science, Beijing University of Civil Engineering and Architecture, Beijing 100044, China

2. NCMIS, KLSC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China

Abstract

Presently, computer experiments with multiple levels of accuracy are widely applied in science and engineering. This paper introduces a class of nested maximum entropy designs for such computer experiments. A multi-layer DETMAX algorithm is proposed to construct nested maximum entropy designs. Based on nested maximum entropy designs, we also propose an integer-programming procedure to specify the sample sizes in multi-fidelity computer experiments. Simulated annealing techniques are used to tackle complex optimization problems in the proposed methods. Illustrative examples show that the proposed nested entropy designs can yield better prediction results than nested Latin hypercube designs in the literature and that the proposed sample-size determination method is effective.

Funder

National Key R&D Program of China

National Natural Science Foundation of China

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference39 articles.

1. Design and analysis of computer experiments;Sacks;Stat. Sci.,1989

2. Santner, T.J., Williams, B.J., and Notz, W.I. (2018). The Design and Analysis of Computer Experiments, Springer.

3. Space-filling designs for multi-layer nested factors;Gryder;Qual. Eng.,2019

4. Best Linear Unbiased Prediction for Multifidelity Computer Experiments;Mu;Math. Probl. Eng.,2018

5. Fully-sequential space-filling design algorithms for computer experiments;Shang;J. Qual. Technol.,2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3