Skip navigation
User training | Reference and search service

Library catalog

EDS
b-on
More
resources
Content aggregators
Please use this identifier to cite or link to this item:

acessibilidade

http://hdl.handle.net/10071/13167
acessibilidade
Title: A multigrid-like algorithm for probabilistic domain decomposition
Authors: Bernal, F.
Acebron, J. A.
Keywords: PDD
Domain decomposition
Scalability
High-performance supercomputing
Variance reduction
Feynman–Kac formula
Issue Date: 2016
Publisher: Pergamon/Elsevier
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.
Peer reviewed: yes
URI: http://hdl.handle.net/10071/13167
DOI: 10.1016/j.camwa.2016.07.030
ISSN: 0898-1221
Ciência-IUL: https://ciencia.iscte-iul.pt/id/ci-pub-29745
Accession number: WOS:000384851700003
Appears in Collections:CTI-RI - Artigos em revistas científicas internacionais com arbitragem científica

Files in This Item:
acessibilidade
File Description SizeFormat 
A multigrid-like algorithm for probabilistic.pdfPré-print549.7 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Currículo DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.