ScaLAPACK user's guide
Divide and Conquer for the Solution of Banded Linear Systems of Equations
PDP '96 Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)
SIAM Journal on Scientific Computing
Multiplicative cascades applied to PDEs (two numerical examples)
Journal of Computational Physics
An Exit Probability Approach to Solving High Dimensional Dirichlet Problems
SIAM Journal on Scientific Computing
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
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
Journal of Scientific Computing
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Journal of Computational Physics
A stochastic approach to the solution of magnetohydrodynamic equations
Journal of Computational Physics
Journal of Computational Physics
Hi-index | 31.46 |
A domain decomposition method is developed for the numerical solution of nonlinear parabolic partial differential equations in any space dimension, based on the probabilistic representation of solutions as an average of suitable multiplicative functionals. Such a direct probabilistic representation requires generating a number of random trees, whose role is that of the realizations of stochastic processes used in the linear problems. First, only few values of the sought solution inside the space-time domain are computed (by a Monte Carlo method on the trees). An interpolation is then carried out, in order to approximate interfacial values of the solution inside the domain. Thus, a fully decoupled set of sub-problems is obtained. The algorithm is suited to massively parallel implementation, enjoying arbitrary scalability and fault tolerance properties. Pruning the trees is shown to increase appreciably the efficiency of the algorithm. Numerical examples conducted in 2D, including some for the KPP equation, are given.