A multigrid-like algorithm for probabilistic domain decomposition

From MaRDI portal
Publication:521522

DOI10.1016/J.CAMWA.2016.07.030zbMATH Open1361.65094arXiv1512.02818OpenAlexW2962831939MaRDI QIDQ521522FDOQ521522


Authors: Francisco Bernal, Juan A. Acebrón Edit this on Wikidata


Publication date: 11 April 2017

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

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 ingredient 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 of between one and two orders of magnitude over the previous version of PDD.


Full work available at URL: https://arxiv.org/abs/1512.02818




Recommendations




Cites Work


Cited In (5)

Uses Software





This page was built for publication: A multigrid-like algorithm for probabilistic domain decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521522)