New shortcut formulas evaluate space-filling criteria of lattice-based LHDs in O(n) or O(log n) time, and the new RLHDs enable fast local Gaussian process emulation with one matrix inversion.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ME 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimized and regularly repeated lattice-based Latin hypercube designs for large-scale computer experiments
New shortcut formulas evaluate space-filling criteria of lattice-based LHDs in O(n) or O(log n) time, and the new RLHDs enable fast local Gaussian process emulation with one matrix inversion.