Construction of space-filling designs using WSP algorithm for high dimensional spaces

Chemometrics and Intelligent Laboratory Systems

Volumn 113, Issue , 2012, Pages 26-31

  Santiago, J ^a,b   Claeys Bruno, M ^a   Sergent, M ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

^b CSTJF   (France)

Author keywords

Computer experiment; Experimental design; High dimensional space; Numerical simulation; Space filling design

Indexed keywords

ALGORITHM; ARTICLE; CALCULATION; COMPARATIVE STUDY; COMPUTER MODEL; COMPUTER SIMULATION; CONTROLLED STUDY; EXPERIMENTAL DESIGN; HIGH DIMENSIONAL SPACE; PRIORITY JOURNAL; QUALITY CONTROL PROCEDURES; SPACE; SPACE FILLING DESIGN; WSP ALGORITHM;

EID: 84860494343     PISSN: 01697439     EISSN: 18733239     Source Type: Journal    
DOI: 10.1016/j.chemolab.2011.06.003     Document Type: Article

References (35)

1. Fang K.T., Runze L., Sudjianto A. Design and Modeling for Computer Experiments 2006, Boca Raton, London, New York.
2. Santner T.J., Williams B.J., Notz W.I. The Design and Analysis of Computer Experiments 2003, New York, Berlin, Heidelberg.
3. Faure H. Discrépance de suites associées à un système de numération (en dimensions). Acta Arith. 1982, 41:337-351.
4. Halton J.H. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. mathematik 1960, 2:84-90.
5. Hammersley J.M. Monte carlo methods for solving multivariables problems. Ann. N. Y. Acad. Sci. 1960, 86:844-874.
6. Sobol I.M. The distribution of points in a cube and the approximate evaluation of integrals, U.S.S.R. Comput. Math. Math. Phys. 1967, 7:86-112.
7. Sobol I.M. Uniformity distributed sequences with an additional uniform property, U.S.S.R. Comput. Math. Math. Phys. 1976, 16:236-242.
8. Bates R.A., Buck R.J., Riccomagno E., Wynn H.P. Experimental design and observation for large systems. Journal of the Royal Statistical Society B 1996, 58:77-94.
9. Korobov N.M. The approximate computation of multiple integrals. Dokl. Akad. Nauk. SSSR 1959, 124:1207-1210.
10. Korobov N.M. Computation of multiple integrals by the method of optimal coefficients. Vestnik Moskow Univ. Sec. Math. Astr. Fiz. Him. 1959, 4:19-25.
11. Neiderreiter H. Random Number Generation and Quasi-Monte Carlo Methods, Philadelphia 1992.
12. Bernado M.C., Buck R.J., Liu L., Nazaret W., Sacks J., Welch W.J. Integrated circuit design optimization using a sequential strategy. IEEE Transactions on Computer-Aided Design 1992, 11:361-372.
13. Butler N.A. Optimal and orthogonal latin hypercube designs for computer experiments. Biometrika 2001, 88:847-857.
14. Kennedy M.C., O'Hagan A. Bayesian calibration of computer models. Journal of the Royal Statistical Society B 2001, 63:425-464.
15. Stein M. Large sample properties of simulations using latin hypercube sampling. Technometrics 1987, 29:143-151.
16. Welch W.J., Buck R.J., Sacks J., Wynn H.P., Mitchell T.J., Morris M.D. Screening, predicting and computer experiments. Technometrics 1992, 34:15-25.
17. Owen A.B. Orthogonal arrays for computer experiments, integration and visualization. Stat. Sin. 1992, 2.
18. Raghavarao D. Constructions and Combinatorial Problems in Design of Experiments 1971, New York.
19. Wu C.F.J., Hamada M. Experiments: Planning, Analysis and parameter design optimization 2000, New York.
20. Vasseur O., Claeys-Bruno M., Cathelinaud M., Sergent M. High-dimensional sensitivity analysis of complex optronic systems by experimental design: applications to the case of the designs and the robustness of optical coatings. Chin. Opt. Lett. 2010, 8(s1):21-24.
21. Chen V.C.P., Tsui K.-L., Barton R.R., Meckesheimer M. A review on design, modeling and applications of computer experiments. IIE Transaction 2006, 38:273-291.
22. Johnson M.E., Moore L.M., Ylvisaker D. Minimax and maximin distance designs. J. of Statistical Planning and Inference 1990, 26:131-148.
23. M. Gunzburger and J. Burkardt, burkardt/pdf/ptmeas.pdf, 2004. https://people.scs.fsu.edu/.
24. Franco J., Vasseur O., Corre B., Sergent M. Minimum spanning tree: a new approach to assess the quality of the design of computer experiments. Chemometrics and intelligent laboratory system 2009, 97:164-169.
25. Sergent M. Contribution de la Méthodologie de la Recherche Expérimentale à l'élaboration de matrices uniformes: application aux effets de solvants et de substituants. Thesis 1989.
26. Sergent M., Phan-Tan-Luu R., Elguero J. Statistical analysis of solvent scales, part 1. Anales de Quimica Int. Ed. 1997, 93:71-75.
27. Sergent M., Phan-Tan-Luu R., Elguero J. Statistical analysis of solvent scales, part 2. Anales de Quimica Int. Ed. 1997, 93:295-300.
28. Franco J. Planification d'expériences numériques en phase exploratoire pour des codes de calculs simulant des phénomènes complexes. Ecole Nationale Supérieure des Mines de Saint-Etienne, Thesis 2008.
29. Handcock M.S. On cascading latin hypercube designs and additive models for experiments. Communications in Statics - Theory and Methods 1991, 20:417-439.
30. Loh W.L. On latin hypercube sampling. Ann. Stat. 1996, 24:2058-2080.
31. McKay M.D., Beckman R.J., Conover W.J. A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 1979, 21:239-245.
32. Owen A.B. Controlling correlations in latin hypercube samples. J. Am. Stat. Assoc. 1994, 89:1517-1522.
33. Tang B. Orthogonal array-based latin hypercubes. J. Am. Stat. Assoc. 1993, 88:1392-1397.
34. Tang B. A theorem for selecting OA-based latin hypercubes using a distance criterion. Communications in Statics - Theory and Methods 1994, 23:2047-2058.
35. Ye K.Q. Orthogonal column latin hypercubes and their application in computer experiments. J. Am. Stat. Assoc. 1998, 36:1430-1439.