Latin hypercube sampling: Difference between revisions

Revision as of 15:34, 13 September 2024

Revision as of 11:50, 30 September 2024

Line 28:

#In '''random sampling''' new sample points are generated without taking into account the previously generated sample points. One does not necessarily need to know beforehand how many sample points are needed.

#In '''Latin hypercube sampling''' one must first decide how many sample points to use and for each sample point remember in which row and column the sample point was taken. Such configuration is similar to having N [[Rook_(chess)|rooks]] on a chess board without threatening each other.

#In '''orthogonal sampling''', the sample space is dividedpartitioned into equally probable subspaces. All sample points are then chosen simultaneously making sure that the total set of sample points is a Latin hypercube sample and that each subspace is sampled with the same density.

Thus, orthogonal sampling ensures that the set of random numbers is a very good representative of the real variability, LHS ensures that the set of random numbers is representative of the real variability whereas traditional random sampling (sometimes called brute force) is just a set of random numbers without any guarantees.