Space-filling orthogonal arrays of strength two

References

• McKay MD, Beckman RJ, Conover WJ. A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics. 1979;21(2):239–245.
   Web of Science ®Google Scholar
• Hedayat AS, Sloane NJA, Stufken J. Orthogonal arrays: theory and applications. New York: Springer; 1999.
   Google Scholar
• Owen AB. Orthogonal arrays for computer experiments, integration and visualization. Statist Sin. 1992;2:439–452.
   Web of Science ®Google Scholar
• Morris MD, Moore LM, McKay MD. Using orthogonal arrays in the sensitivity analysis of computer models. Technometrics. 2008;50:205–215. doi: 10.1198/004017008000000208
   Web of Science ®Google Scholar
• Tang B. Orthogonal array-based Latin hypercubes. J Am Statist Assoc. 1993;88:1392–1397. doi: 10.1080/01621459.1993.10476423
   Web of Science ®Google Scholar
• Sacks J, Welch WJ, Mitchell TJ, Wynn HP. Design and analysis of computer experiments. Statist Sci. 1989;4:409–423. doi: 10.1214/ss/1177012413
   Google Scholar
• Hedayat AS, Stufken J, Su G. On difference schemes and orthogonal arrays of strength t. Journal of Statist Plan Inference. 1996;56:307–324. doi: 10.1016/S0378-3758(96)00026-2
   Web of Science ®Google Scholar
• Bailey RA. Factorial designs and Abelian groups. Linear Algebra Appl. 1985;70:349–368. doi: 10.1016/0024-3795(85)90064-3
   Web of Science ®Google Scholar
• Leary S, Bhaskar A, Keane A. Optimal orthogonal-array-based Latin hypercubes. J Appl Stat. 2003;30:585–598. doi: 10.1080/0266476032000053691
   Web of Science ®Google Scholar
• Morris MD, Mitchell TJ. Exploratory designs for computational experiments. J Statist Plan Inference. 1995;43:381–402. doi: 10.1016/0378-3758(94)00035-T
   Web of Science ®Google Scholar
• Ye KQ, Li W, Sudjianto A. Algorithmic construction of optimal symmetric Latin hypercube designs. J Statist Plan Inference. 2000;90:145–159. doi: 10.1016/S0378-3758(00)00105-1
   Web of Science ®Google Scholar
• Jin R, Chen W, Sudjianto A. An efficient algorithm for constructing optimal design for computer experiments. J Statist Plan Inference. 2005;134:268–287. doi: 10.1016/j.jspi.2004.02.014
   Web of Science ®Google Scholar
• Fang KT, Li R, Sudjianto A. Design and modeling for computer experiments, Computer science and data analysis series. London: Chapman & Hall/CRC; 2006.
   Google Scholar
• Franco J, Vasseur O, Corre B, Sergent M. Minimum spanning tree: a new approach to assess the quality of the design of computer experiments. Chemometr Intell Lab Syst. 2009;97:164–169. doi: 10.1016/j.chemolab.2009.03.011
   Web of Science ®Google Scholar
• Santner TJ, Williams BJ, Notz WI. The design and analysis of computer experiments, Springer series in statistics. New York: Springer; 2003.
   Google Scholar
• Saltelli A, Chan K, Scott M, editors. Sensitivity analysis. New York: Wiley; 2000.
   Google Scholar
• Niederreiter H. Point sets and sequences with small discrepancy. Monatsh Math. 1987;104:273–337. doi: 10.1007/BF01294651
   Web of Science ®Google Scholar
• Owen AB. Randomly permuted (t,m,s)-nets and (t,s)-sequences. In: Niederreiter H, Shiue PJ-S, editors. Monte Carlo and quasi-Monte Carlo methods in scientific computing. New York: Springer; 1995. p. 299–317.
   Google Scholar
• Sloan IH, Joe S. Lattice methods for multiple integration. Oxford: Oxford University Press; 1994.
   Google Scholar
• Johnson ME, Moore LM, Ylvisaker D. Minimax and maximin distance designs. J Statist Plan Inference. 1990;26:131–148. doi: 10.1016/0378-3758(90)90122-B
   Web of Science ®Google Scholar
• Shewry MC, Wynn HP. Maximum entropy sampling. J Appl Stat. 1987;14:165–170. doi: 10.1080/02664768700000020
   Google Scholar
• Audze P, Eglais V. New approach for planning out of experiments. Problems of dynamics and strengths. 1997;35:104–107.
   Google Scholar
• Jourdan A, Franco J. Optimal Latin hypercube designs for the Kullback–Leibler criterion. AStA Adv Statist Anal. 2010;94(4):341–351. doi: 10.1007/s10182-010-0145-y
   Web of Science ®Google Scholar
• Pronzato L, Müller WG. Design of computer experiments: space filling and beyond. Stat Comput. 2012;22:681–701. doi: 10.1007/s11222-011-9242-3
   Web of Science ®Google Scholar
• Mullen GL, Mahalanabis A, Niederreiter H. Tables of (t,m,s)-net and (t,s)-sequence parameters. In: Niederreiter H, Shiue PJ-S, editors. Monte Carlo and quasi-Monte Carlo methods in scientific computing. New York: Springer; 1995. p. 299–317.
   Google Scholar
• Surjanovic S, Bingham D. Virtual library of simulation experiments: test functions and datasets. Website of Simon Fraser University; 2013. http://www.sfu.ca/~ssurjano/index.html
   Google Scholar