Publication:
An Efficient Algorithm for Accelerating Monte Carlo Approximations of the Solution to Boundary Value Problems

Thumbnail Image
Identifiers
URI: https://hdl.handle.net/10016/32112
ISSN: 0885-7474
DOI: https://doi.org/10.1007/s10915-015-0033-4
UXXI: AR/0000026518
Files
Efficient_JSC_2016_ps.pdf (570.32 KB)
Publication date
2016-02
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Nature
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
The numerical approximation of boundary value problems by means of a probabilistic representations often has the drawback that the Monte Carlo estimate of the solution is substantially biased due to the presence of the domain boundary. We introduce a scheme, which we have called the leading-term Monte Carlo regression, which seeks to remove that bias by replacing a ’cloud’ of Monte Carlo estimates—carried out at different discretization levels—for the usual single Monte Carlo estimate. The practical result of our scheme is an acceleration of the Monte Carlo method. Theoretical analysis of the proposed scheme, confirmed by numerical experiments, shows that the achieved speedup can be well over 100.
Description
Keywords
Monte Carlo method, Romberg extrapolation, Bounded difusión, Feynman-Kac formula, First exit time, Parallel computing
Bibliographic citation
Mancini, S., Bernal, F., Acebrón, J. A. (2016). An Efficient Algorithm for Accelerating Monte Carlo Approximations of the Solution to Boundary Value Problems. Journal of Scientific Computing, 66(2), 577–597.
Collections
DM - Artículos de Revistas