A study on the use of kriging models to approximate deterministic computer models

Jay D. Martin, Timothy W. Simpson

Research output: Contribution to conferencePaperpeer-review

102 Scopus citations

Abstract

The use of kriging models for approximation and global optimization has been steadily on the rise in the past decade. The standard approach used in the Design and Analysis of Computer Experiments (DACE) is to use an Ordinary kriging model to approximate a deterministic computer model. Universal and Detrended kriging are two alternative types of kriging models. In this paper, a description on the basics of kriging is given, highlighting the similarities and differences between these three different types of kriging models and the underlying assumptions behind each. A comparative study on the use of three different types of kriging models is then presented using six test problems. The methods of Maximum Likelihood Estimation (MLE) and Cross-Validation (CV) for model parameter estimation are compared for the three kriging model types. A one-dimension problem is first used to visualize the differences between the different models. In order to show applications in higher dimensions, four two-dimension and a 5-dimension problem are also given.

Original languageEnglish (US)
Pages567-576
Number of pages10
DOIs
StatePublished - 2003
Event2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference - Chicago, IL, United States
Duration: Sep 2 2003Sep 6 2003

Other

Other2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference
Country/TerritoryUnited States
CityChicago, IL
Period9/2/039/6/03

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Mechanical Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'A study on the use of kriging models to approximate deterministic computer models'. Together they form a unique fingerprint.

Cite this