Domain Decomposition Solution of Elliptic Boundary-Value Problems via Monte Carlo and Quasi-Monte Carlo Methods

Authors:
Juan A. Acebrón;Maria Pia Busico;Piero Lanucara;Renato Spigler
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2005

Citing 0
Cited 11

Probabilistically induced domain decomposition methods for elliptic boundary-value problems

Journal of Computational Physics
Supercomputing applications to the numerical modeling of industrial and applied mathematics problems

The Journal of Supercomputing
Domain decomposition solution of nonlinear two-dimensional parabolic problems by random trees

Journal of Computational Physics
Efficient Parallel Solution of Nonlinear Parabolic Partial Differential Equations by a Probabilistic Domain Decomposition

Journal of Scientific Computing
A new domain decomposition approach suited for grid computing

PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Scalability and performance analysis of a probabilistic domain decomposition method

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
On the performance of a new parallel algorithm for large-scale simulations of nonlinear partial differential equations

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
A new parallel solver suited for arbitrary semilinear parabolic partial differential equations based on generalized random trees

Journal of Computational Physics
A fully scalable parallel algorithm for solving elliptic partial differential equations

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A stochastic approach to the solution of magnetohydrodynamic equations

Journal of Computational Physics
Highly efficient numerical algorithm based on random trees for accelerating parallel Vlasov-Poisson simulations

Journal of Computational Physics

Quantified Score

Hi-index	0.03

Visualization

Abstract

Domain decomposition of two-dimensional domains on which boundary-value elliptic problems are formulated is accomplished by probabilistic (Monte Carlo) as well as by quasi-Monte Carlo methods, generating only a few interfacial values and interpolating on them. Continuous approximations for the trace of solution are thus obtained, to be used as boundary data for the subproblems. The numerical treatment can then proceed by standard deterministic algorithms, separately in each of the so obtained subdomains. Monte Carlo and quasi-Monte Carlo simulations may naturally exploit multiprocessor architectures, leading to parallel computing, as well as the ensuing domain decomposition does. The advantages such as scalability obtained by increasing the number of processors are shown, both theoretically and experimentally, in a number of test examples, and the possibility of using clusters of computers (grid computing) is emphasized.