Refine
Year of publication
- 1998 (1)
Document Type
- Report (1)
Language
- English (1)
Has Fulltext
- yes (1)
Faculty / Organisational entity
The Monte Carlo complexity of computing integrals depending on a parameter is analyzed for smooth integrands. An optimal algorithm is developed on the basis of a multigrid variance reduction technique. The complexity analysis implies that our algorithm attains a higher convergence rate than any deterministic algorithm. Moreover, because of savings due to computation on multiple grids, this rate is also higher than that of previously developed Monte Carlo algorithms for parametric integration.