Monte Carlo and Quasi-Monte Carlo Methods.¶
Caflisch, R. E. (1998). Monte Carlo and Quasi-Monte Carlo Methods. Acta Numerica, 7, 1-49.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Curse Of Dimensionality
- In numerical analysis, deterministic quadrature scales exponentially in dimension, which is precisely why Monte Carlo and quasi-Monte Carlo methods exist.
This sourceExplains the exponential cost of deterministic quadrature in dimension and why Monte Carlo and quasi-Monte Carlo methods escape it.
Supported in partVerified against the work's full text
Supplies Monte Carlo's dimension-independent O(N^-1/2) convergence rate and quasi-Monte Carlo as a deterministic alternative; it says nothing about Bellman, dynamic programming, or mitigation families.
“Its convergence rate, O ( N −1/2 ), is independent of dimension, which shows Monte Carlo to be very robust but also slow. ... Accelerated convergence for Monte Carlo quadrature is attained using quasi-random (also called low-discrepancy) sequences, which are a deterministic alternative to random or pseudo-random sequences.”
- In numerical analysis, deterministic quadrature scales exponentially in dimension, which is precisely why Monte Carlo and quasi-Monte Carlo methods exist.
Domain-specific¶
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:960d2682899e · see in the full table