Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Quasi-Monte Carlo method
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Monte Carlo and quasi-Monte Carlo for multidimensional integrations == For one-dimensional integration, quadrature methods such as the [[trapezoidal rule]], [[Simpson's rule]], or [[Newton–Cotes formulas]] are known to be efficient if the function is smooth. These approaches can be also used for multidimensional integrations by repeating the one-dimensional integrals over multiple dimensions. However, the number of function evaluations grows exponentially as ''s'', the number of dimensions, increases. Hence, a method that can overcome this [[curse of dimensionality]] should be used for multidimensional integrations. The standard Monte Carlo method is frequently used when the quadrature methods are difficult or expensive to implement.<ref name="morokoffNcaflisch">William J. Morokoff and [[Russel E. Caflisch]], ''Quasi-Monte Carlo integration'', J. Comput. Phys. '''122''' (1995), no. 2, 218–230. ''(At [[CiteSeer]]: [http://citeseer.ist.psu.edu/morokoff95quasimonte.html])''</ref> Monte Carlo and quasi-Monte Carlo methods are accurate and relatively fast when the dimension is high, up to 300 or higher.<ref>Rudolf Schürer, ''A comparison between (quasi-)Monte Carlo and cubature rule based methods for solving high-dimensional integration problems'', Mathematics and Computers in Simulation, Volume 62, Issues 3–6, 3 March 2003, 509–517</ref> Morokoff and Caflisch <ref name="morokoffNcaflisch" /> studied the performance of Monte Carlo and quasi-Monte Carlo methods for integration. In the paper, Halton, Sobol, and Faure sequences for quasi-Monte Carlo are compared with the standard Monte Carlo method using pseudorandom sequences. They found that the Halton sequence performs best for dimensions up to around 6; the Sobol sequence performs best for higher dimensions; and the Faure sequence, while outperformed by the other two, still performs better than a pseudorandom sequence. However, Morokoff and Caflisch <ref name="morokoffNcaflisch" /> gave examples where the advantage of the quasi-Monte Carlo is less than expected theoretically. Still, in the examples studied by Morokoff and Caflisch, the quasi-Monte Carlo method did yield a more accurate result than the Monte Carlo method with the same number of points. Morokoff and Caflisch remark that the advantage of the quasi-Monte Carlo method is greater if the integrand is smooth, and the number of dimensions ''s'' of the integral is small.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)