Publication:
A multigrid-like algorithm for probabilistic domain decomposition

Thumbnail Image
Identifiers
Publication date
2016-10
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
We present an iterative scheme, reminiscent of the Multigrid method, to solve large boundary value problems with Probabilistic Domain Decomposition (PDD). In it, increasingly accurate approximations to the solution are used as control variates in order to reduce the Monte Carlo error of the following iterates—resulting in an overall acceleration of PDD for a given error tolerance. The key feature of the proposed algorithm is the ability to approximately predict the speedup with little computational overhead and in parallel. Besides, the theoretical framework allows to explore other aspects of PDD, such as stability. One numerical example is worked out, yielding an improvement between one and two orders of magnitude over the previous version of PDD.
Description
Keywords
PDD, Domain decomposition, Scalability, High-performance supercomputing, Variance reduction, Feynman-Kac formula
Bibliographic citation
Bernal, F., Acebrón, J. A. (2016). A multigrid-like algorithm for probabilistic domain decomposition. Computers & Mathematics with Applications, 72(7), 1790–1810.