Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
Authors:
- Zeping WuZWZeping Wu
- Donghui WangDWDonghui Wang
- Patrick N. OkoloPOPatrick N. Okolo
- Kun ZhaoKZKun Zhao
- Weihua ZhangWZWeihua Zhang
- 1 September 2017
- journal article
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 324, 348-365
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- A novel algorithm of maximin Latin hypercube design using successive local enumerationEngineering Optimization, 2011
- Algorithms for Generating Maximin Latin Hypercube and Orthogonal DesignsJournal of Statistical Theory and Practice, 2011
- Construction of orthogonal Latin hypercube designsBiometrika, 2009
- Efficient Nearly Orthogonal and Space-Filling Latin HypercubesTechnometrics, 2007
- Refinement strategies for stratified sampling methodsReliability Engineering & System Safety, 2006
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimatesMathematics and Computers in Simulation, 2001
- Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designsMathematics of Computation, 2000
- Orthogonal Column Latin Hypercubes and Their Application in Computer ExperimentsJournal of the American Statistical Association, 1998
- A generalized discrepancy and quadrature error boundMathematics of Computation, 1998
- Minimax and maximin distance designsJournal of Statistical Planning and Inference, 1990