Skip to main content

2018 | OriginalPaper | Buchkapitel

5. Space-Filling Designs for Computer Experiments

verfasst von : Thomas J. Santner, Brian J. Williams, William I. Notz

Erschienen in: The Design and Analysis of Computer Experiments

Verlag: Springer New York

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This chapter and the next discuss how to select inputs at which to compute the output of a computer experiment to achieve specific goals. The inputs one selects constitute the “experimental design.” As in previous chapters, the inputs are referred to as “runs.” The region corresponding to the values of the inputs that is to be studied is called the experimental region. A point in this region corresponds to a specific set of values of the inputs. Thus, an experimental design is a specification of points (runs) in the experimental region at which the response is to be computed.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Atkinson AC, Donev AN (1992) Optimum experimental designs. Clarendon Press, OxfordMATH Atkinson AC, Donev AN (1992) Optimum experimental designs. Clarendon Press, OxfordMATH
Zurück zum Zitat Bates RA, Buck RJ, Riccomagno E, Wynn HP (1996) Experimental design and observation for large systems. J R Stat Soc Ser B 58:77–94MathSciNetMATH Bates RA, Buck RJ, Riccomagno E, Wynn HP (1996) Experimental design and observation for large systems. J R Stat Soc Ser B 58:77–94MathSciNetMATH
Zurück zum Zitat Bernardo MC, Buck RJ, Liu L, Nazaret WA, Sacks J, Welch WJ (1992) Integrated circuit design optimization using a sequential strategy. IEEE Trans Comput Aided Des 11:361–372CrossRef Bernardo MC, Buck RJ, Liu L, Nazaret WA, Sacks J, Welch WJ (1992) Integrated circuit design optimization using a sequential strategy. IEEE Trans Comput Aided Des 11:361–372CrossRef
Zurück zum Zitat Box GE, Draper NR (1987) Empirical model-building and response surfaces. Wiley, New York, NYMATH Box GE, Draper NR (1987) Empirical model-building and response surfaces. Wiley, New York, NYMATH
Zurück zum Zitat Box G, Hunter W, Hunter J (1978) Statistics for experimenters. Wiley, New York, NYMATH Box G, Hunter W, Hunter J (1978) Statistics for experimenters. Wiley, New York, NYMATH
Zurück zum Zitat Bratley P, Fox BL, Niederreiter H (1994) Algorithm 738: programs to generate Niederreiter’s low-discrepancy sequences. ACM Trans Math Softw 20:494–495CrossRef Bratley P, Fox BL, Niederreiter H (1994) Algorithm 738: programs to generate Niederreiter’s low-discrepancy sequences. ACM Trans Math Softw 20:494–495CrossRef
Zurück zum Zitat Butler NA (2001) Optimal and orthogonal Latin hypercube designs for computer experiments. Biometrika 88:847–857MathSciNetCrossRef Butler NA (2001) Optimal and orthogonal Latin hypercube designs for computer experiments. Biometrika 88:847–857MathSciNetCrossRef
Zurück zum Zitat Chapman WL, Welch WJ, Bowman KP, Sacks J, Walsh JE (1994) Arctic sea ice variability: model sensitivities and a multidecadal simulation. J Geophys Res 99(C1):919–935CrossRef Chapman WL, Welch WJ, Bowman KP, Sacks J, Walsh JE (1994) Arctic sea ice variability: model sensitivities and a multidecadal simulation. J Geophys Res 99(C1):919–935CrossRef
Zurück zum Zitat Chen RB, Wang W, Wu CFJ (2011) Building surrogates with overcomplete bases in computer experiments with applications to bistable laser diodes. IEE Trans 182:978–988 Chen RB, Wang W, Wu CFJ (2011) Building surrogates with overcomplete bases in computer experiments with applications to bistable laser diodes. IEE Trans 182:978–988
Zurück zum Zitat Cioppa TM, Lucas TW (2007) Efficient nearly orthogonal and space-filling Latin hypercubes. Technometrics 49:45–55MathSciNetCrossRef Cioppa TM, Lucas TW (2007) Efficient nearly orthogonal and space-filling Latin hypercubes. Technometrics 49:45–55MathSciNetCrossRef
Zurück zum Zitat Craig PC, Goldstein M, Rougier JC, Seheult AH (2001) Bayesian forecasting for complex systems using computer simulators. J Am Stat Assoc 96:717–729MathSciNetCrossRef Craig PC, Goldstein M, Rougier JC, Seheult AH (2001) Bayesian forecasting for complex systems using computer simulators. J Am Stat Assoc 96:717–729MathSciNetCrossRef
Zurück zum Zitat Dean AM, Voss D, Draguljic D (2017) Design and analysis of experiments, 2nd edn. Springer, New York, NYCrossRef Dean AM, Voss D, Draguljic D (2017) Design and analysis of experiments, 2nd edn. Springer, New York, NYCrossRef
Zurück zum Zitat Dette H, Pepelyshev A (2010) Generalized Latin hypercube designs for computer experiments. Technometrics 52:421–429MathSciNetCrossRef Dette H, Pepelyshev A (2010) Generalized Latin hypercube designs for computer experiments. Technometrics 52:421–429MathSciNetCrossRef
Zurück zum Zitat Draguljić D, Santner TJ, Dean AM (2012) Non-collapsing spacing-filling designs for bounded polygonal regions. Technometrics 54:169–178MathSciNetCrossRef Draguljić D, Santner TJ, Dean AM (2012) Non-collapsing spacing-filling designs for bounded polygonal regions. Technometrics 54:169–178MathSciNetCrossRef
Zurück zum Zitat Fang KT, Lin DKJ, Winker P, Zhang Y (2000) Uniform design: theory and application. Technometrics 42:237–248MathSciNetCrossRef Fang KT, Lin DKJ, Winker P, Zhang Y (2000) Uniform design: theory and application. Technometrics 42:237–248MathSciNetCrossRef
Zurück zum Zitat Fang KT, Li R, Sudjianto A (2006) Design and modeling for computer experiments. Chapman & Hall/CRC, Boca Raton, FL Fang KT, Li R, Sudjianto A (2006) Design and modeling for computer experiments. Chapman & Hall/CRC, Boca Raton, FL
Zurück zum Zitat Halton JH (1960) On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer Math 2(1):84–90MathSciNetCrossRef Halton JH (1960) On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer Math 2(1):84–90MathSciNetCrossRef
Zurück zum Zitat Handcock MS (1991) On cascading Latin hypercube designs and additive models for experiments. Commun Stat Theory Methods 20(2):417–439MathSciNetCrossRef Handcock MS (1991) On cascading Latin hypercube designs and additive models for experiments. Commun Stat Theory Methods 20(2):417–439MathSciNetCrossRef
Zurück zum Zitat Hayeck GT (2009) The kinematics of the upper extremity and subsequent effects on joint loading and surgical treatment. PhD thesis, Cornell University, Ithaca, NY Hayeck GT (2009) The kinematics of the upper extremity and subsequent effects on joint loading and surgical treatment. PhD thesis, Cornell University, Ithaca, NY
Zurück zum Zitat Hedayat A, Sloane N, Stufken J (1999) Orthogonal arrays. Springer, New York, NYCrossRef Hedayat A, Sloane N, Stufken J (1999) Orthogonal arrays. Springer, New York, NYCrossRef
Zurück zum Zitat John PWM (1980) Incomplete block designs. M. Dekker, Inc., New York, NYMATH John PWM (1980) Incomplete block designs. M. Dekker, Inc., New York, NYMATH
Zurück zum Zitat Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Glob Optim 13:455–492MathSciNetCrossRef Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Glob Optim 13:455–492MathSciNetCrossRef
Zurück zum Zitat Joseph VR, Gul E, Ba S (2015) Maximum projection designs for computer experiments. Biometrika 102(2):371–380MathSciNetCrossRef Joseph VR, Gul E, Ba S (2015) Maximum projection designs for computer experiments. Biometrika 102(2):371–380MathSciNetCrossRef
Zurück zum Zitat Kennedy MC, O’Hagan A (2000) Predicting the output from a complex computer code when fast approximations are available. Biometrika 87:1–13MathSciNetCrossRef Kennedy MC, O’Hagan A (2000) Predicting the output from a complex computer code when fast approximations are available. Biometrika 87:1–13MathSciNetCrossRef
Zurück zum Zitat Kennedy MC, O’Hagan A (2001) Bayesian calibration of computer models (with discussion). J R Stat Soc Ser B 63:425–464MathSciNetCrossRef Kennedy MC, O’Hagan A (2001) Bayesian calibration of computer models (with discussion). J R Stat Soc Ser B 63:425–464MathSciNetCrossRef
Zurück zum Zitat Liefvendahl M, Stocki R (2006) A study on algorithms for optimization of Latin hypercubes. J Stat Plann Inf 136:3231–3247MathSciNetCrossRef Liefvendahl M, Stocki R (2006) A study on algorithms for optimization of Latin hypercubes. J Stat Plann Inf 136:3231–3247MathSciNetCrossRef
Zurück zum Zitat Loeppky JL, Sacks J, Welch WJ (2009) Choosing the sample size of a computer experiment: a practical guide. Technometrics 51(4):366–376MathSciNetCrossRef Loeppky JL, Sacks J, Welch WJ (2009) Choosing the sample size of a computer experiment: a practical guide. Technometrics 51(4):366–376MathSciNetCrossRef
Zurück zum Zitat Loeppky JL, Moore LM, Williams BJ (2012) Projection array based designs for computer experiments. J Stat Plann Inf 142:1493–1505MathSciNetCrossRef Loeppky JL, Moore LM, Williams BJ (2012) Projection array based designs for computer experiments. J Stat Plann Inf 142:1493–1505MathSciNetCrossRef
Zurück zum Zitat McKay MD, Beckman RJ, Conover WJ (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21:239–245MathSciNetMATH McKay MD, Beckman RJ, Conover WJ (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21:239–245MathSciNetMATH
Zurück zum Zitat Morris MD, Mitchell TJ (1995) Exploratory designs for computational experiments. J Stat Plann Inf 43:381–402CrossRef Morris MD, Mitchell TJ (1995) Exploratory designs for computational experiments. J Stat Plann Inf 43:381–402CrossRef
Zurück zum Zitat Niederreiter H (1992) Random number generation and quasi-Monte Carlo methods. SIAM, Philadelphia, PACrossRef Niederreiter H (1992) Random number generation and quasi-Monte Carlo methods. SIAM, Philadelphia, PACrossRef
Zurück zum Zitat Owen AB (1992a) A central limit theorem for Latin hypercube sampling. J R Stat Soc Ser B Methodol 54:541–551MathSciNetMATH Owen AB (1992a) A central limit theorem for Latin hypercube sampling. J R Stat Soc Ser B Methodol 54:541–551MathSciNetMATH
Zurück zum Zitat Owen AB (1992b) Orthogonal arrays for computer experiments, integration and visualization. Stat Sinica 2:439–452MathSciNetMATH Owen AB (1992b) Orthogonal arrays for computer experiments, integration and visualization. Stat Sinica 2:439–452MathSciNetMATH
Zurück zum Zitat Owen AB (1995) Randomly permuted (t, m, s)-nets and (t, s) sequences. In: Niederreiter H, Shiue PJS (eds) Monte Carlo and quasi-Monte Carlo methods in scientific computing. Springer, New York, NY, pp 299–317CrossRef Owen AB (1995) Randomly permuted (t, m, s)-nets and (t, s) sequences. In: Niederreiter H, Shiue PJS (eds) Monte Carlo and quasi-Monte Carlo methods in scientific computing. Springer, New York, NY, pp 299–317CrossRef
Zurück zum Zitat Pukelsheim F (1993) Optimal design of experiments. Wiley, New York, NYMATH Pukelsheim F (1993) Optimal design of experiments. Wiley, New York, NYMATH
Zurück zum Zitat Qian PZ, Seepersad CC, Joseph VR, Allen JK, Wu CFJ (2006) Building surrogate models with details and approximate simulations. ASME J Mech Des 128:668–677CrossRef Qian PZ, Seepersad CC, Joseph VR, Allen JK, Wu CFJ (2006) Building surrogate models with details and approximate simulations. ASME J Mech Des 128:668–677CrossRef
Zurück zum Zitat Qian PZG, Wu CFJ (2008) Bayesian hierarchical modeling for integrating low-accuracy and high-accuracy experiments. Technometrics 50(2):192–204MathSciNetCrossRef Qian PZG, Wu CFJ (2008) Bayesian hierarchical modeling for integrating low-accuracy and high-accuracy experiments. Technometrics 50(2):192–204MathSciNetCrossRef
Zurück zum Zitat Raghavarao D (1971) Constructions and combinatorial problems in design of experiments. Wiley, New York, NYMATH Raghavarao D (1971) Constructions and combinatorial problems in design of experiments. Wiley, New York, NYMATH
Zurück zum Zitat Silvey SD (1980) Optimal design: an introduction to the theory for parameter estimation. Chapman & Hall, New York, NYCrossRef Silvey SD (1980) Optimal design: an introduction to the theory for parameter estimation. Chapman & Hall, New York, NYCrossRef
Zurück zum Zitat Sobol´ IM (1967) On the distribution of points in a cube and the approximate evaluation of integrals. USSR Comput Math Math Phys 7(4):86–112MathSciNetCrossRef Sobol´ IM (1967) On the distribution of points in a cube and the approximate evaluation of integrals. USSR Comput Math Math Phys 7(4):86–112MathSciNetCrossRef
Zurück zum Zitat Sobol´ IM (1976) Uniformly distributed sequences with an additional uniform property. USSR Comput Math Math Phys 16(5):236–242CrossRef Sobol´ IM (1976) Uniformly distributed sequences with an additional uniform property. USSR Comput Math Math Phys 16(5):236–242CrossRef
Zurück zum Zitat Stein ML (1987) Large sample properties of simulations using Latin hypercube sampling. Technometrics 29:143–151MathSciNetCrossRef Stein ML (1987) Large sample properties of simulations using Latin hypercube sampling. Technometrics 29:143–151MathSciNetCrossRef
Zurück zum Zitat Stinstra E, den Hertog D, Stehouwer P, Vestjens A (2003) Constrained maximin designs for computer experiments. Technometrics 45(4):340–346MathSciNetCrossRef Stinstra E, den Hertog D, Stehouwer P, Vestjens A (2003) Constrained maximin designs for computer experiments. Technometrics 45(4):340–346MathSciNetCrossRef
Zurück zum Zitat Street AP, Street DJ (1987) Combinatorics of experimental design. Oxford University Press, OxfordMATH Street AP, Street DJ (1987) Combinatorics of experimental design. Oxford University Press, OxfordMATH
Zurück zum Zitat Trosset MW (1999) Approximate maximin distance designs. In: ASA Proceedings of the section on physical and engineering sciences. American Statistical Association, Alexandria, VA, pp 223–227 Trosset MW (1999) Approximate maximin distance designs. In: ASA Proceedings of the section on physical and engineering sciences. American Statistical Association, Alexandria, VA, pp 223–227
Zurück zum Zitat Vazquez E, Bect J (2011) Sequential search based on kriging: convergence analysis of some algorithms. Proceedings of the 58th world statistical congress of the ISI, pp 1241–1250 Vazquez E, Bect J (2011) Sequential search based on kriging: convergence analysis of some algorithms. Proceedings of the 58th world statistical congress of the ISI, pp 1241–1250
Zurück zum Zitat Welch WJ (1985) ACED: algorithms for the construction of experimental designs. Am Stat 39:146CrossRef Welch WJ (1985) ACED: algorithms for the construction of experimental designs. Am Stat 39:146CrossRef
Zurück zum Zitat Welch WJ, Buck RJ, Sacks J, Wynn HP, Mitchell TJ, Morris MD (1992) Screening, predicting, and computer experiments. Technometrics 34:15–25CrossRef Welch WJ, Buck RJ, Sacks J, Wynn HP, Mitchell TJ, Morris MD (1992) Screening, predicting, and computer experiments. Technometrics 34:15–25CrossRef
Zurück zum Zitat Wiens DP (1991) Designs for approximately linear regression: Two optimality properties of uniform designs. Stat Probab Lett 12:217–221MathSciNetCrossRef Wiens DP (1991) Designs for approximately linear regression: Two optimality properties of uniform designs. Stat Probab Lett 12:217–221MathSciNetCrossRef
Zurück zum Zitat Williams BJ, Loeppky JL, Moore LM, Macklem MS (2011) Batch sequential design to achieve predictive maturity with calibrated computer models. Reliab Eng Syst Saf 96(9):1208–1219CrossRef Williams BJ, Loeppky JL, Moore LM, Macklem MS (2011) Batch sequential design to achieve predictive maturity with calibrated computer models. Reliab Eng Syst Saf 96(9):1208–1219CrossRef
Zurück zum Zitat Wu CFJ, Hamada M (2009) Experiments: planning, analysis, and parameter design optimization, 2nd edn. Wiley, New York, NYMATH Wu CFJ, Hamada M (2009) Experiments: planning, analysis, and parameter design optimization, 2nd edn. Wiley, New York, NYMATH
Zurück zum Zitat Ye KQ (1998) Orthogonal column Latin hypercubes and their application in computer experiments. J Am Stat Assoc 93:1430–1439MathSciNetCrossRef Ye KQ (1998) Orthogonal column Latin hypercubes and their application in computer experiments. J Am Stat Assoc 93:1430–1439MathSciNetCrossRef
Zurück zum Zitat Ye KQ, Li W, Sudjianto A (2000) Algorithmic construction of optimal symmetric Latin hypercube designs. J Stat Plann Inf 90(1):145–159MathSciNetCrossRef Ye KQ, Li W, Sudjianto A (2000) Algorithmic construction of optimal symmetric Latin hypercube designs. J Stat Plann Inf 90(1):145–159MathSciNetCrossRef
Metadaten
Titel
Space-Filling Designs for Computer Experiments
verfasst von
Thomas J. Santner
Brian J. Williams
William I. Notz
Copyright-Jahr
2018
Verlag
Springer New York
DOI
https://doi.org/10.1007/978-1-4939-8847-1_5