Answers are grounded in this paper and cite their sources.
High dimensional integrals are usually solved with Monte Carlo algorithms and quasi Monte Carlo algorithms. We are doing numerical testing which compare low discrepancy and Monte Carlo algorithms. It is well known that Sobol algorithm has some advantageous over the other low discrepancy sequences, that’s why we use this algorithm for our numerical example. The obtained relative error confirms this superiority of the presented Monte Carlo and quasi Monte Carlo algorithms even when small number of sample points are used. It is very interesting that the presented high dimensional integral gives very low relative error even for computational time less than one second which shows the great importance of the developed algorithms.
No takes yet. Share an insight, caveat, or question.
Venelin Todorov (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: