DSpace Repository

Extended Latin Hypercube Sampling for Integration and Simulation

Show simple item record

dc.contributor.author Venkiteswaran, G.
dc.date.accessioned 2023-08-18T06:45:28Z
dc.date.available 2023-08-18T06:45:28Z
dc.date.issued 2013-01
dc.identifier.uri https://link.springer.com/chapter/10.1007/978-3-642-41095-6_13
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11501
dc.description.abstract We analyze an extended form of Latin hypercube sampling technique that can be used for numerical quadrature and for Monte Carlo simulation. The technique utilizes random point sets with enhanced uniformity over the s-dimensional unit hypercube. A sample of N = n s points is generated in the hypercube. If we project the N points onto their ith coordinates, the resulting set of values forms a stratified sample from the unit interval, with one point in each subinterval [(k−1)/N,k/N). The scheme has the additional property that when we partition the hypercube into N subcubes ∏si=1[(ℓi−1)/n,ℓi/n), each one contains exactly one point. We establish an upper bound for the variance, when we approximate the volume of a subset of the hypercube, with a regular boundary. Numerical experiments assess that the bound is tight. It is possible to employ the extended Latin hypercube samples for Monte Carlo simulation. We focus on the random walk method for diffusion and we show that the variance is reduced when compared with classical random walk using ordinary pseudo-random numbers. The numerical comparisons include stratified sampling and Latin hypercube sampling. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.subject Mathematics en_US
dc.subject Random Walk en_US
dc.subject Monte Carlo en_US
dc.subject Orthogonal Array en_US
dc.subject Latin Hypercube Sampling en_US
dc.subject Simple Random Walk en_US
dc.title Extended Latin Hypercube Sampling for Integration and Simulation en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account