LATIN HYPERCUBE AND IMPORTANCE SAMPLING ALGORITHMS FOR MULTIDIMENSIONAL INTEGRALS
LATIN HYPERCUBE AND IMPORTANCE SAMPLING ALGORITHMS FOR MULTIDIMENSIONAL INTEGRALS
DOI:
https://doi.org/10.46687/jsar.v10i1.201Keywords:
Monte Carlo algorithms, multidimensional integrals, Latin hypercube sampling, Importance samplingAbstract
Monte Carlo method is the only viable method for high-dimensional problems since its convergence is independent of the dimension. In this paper we implement and analyze the computational complexity of the Latin hypercube sampling algorithm. We compare the results with Importance sampling algorithm which is the most widely used variance reduction Monte Carlo method. We show that the Latin hypercube sampling has some advantageous over the importance sampling technique.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 JOURNAL SCIENTIFIC AND APPLIED RESEARCH
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.