Abstract
A comparison is made between the probabilistic domain decomposition (DD) method and a certain deterministic DD method for solving linear elliptic boundary-value problems. Since in the deterministic approach the CPU time is affected by intercommunications among the processors, it turns out that the probabilistic method performs better, especially when the number of subdomains (hence, of processors) is increased. This fact is clearly illustrated by some examples. The probabilistic DD algorithm has been implemented in an MPI environment, in order to exploit distributed computer architectures. Scalability and fault-tolerance of the probabilistic DD algorithm are emphasized.
Chapter PDF
Similar content being viewed by others
References
Acebrón, J.A., Busico, M.P., Lanucara, P., Spigler, R.: Domain decomposition solution of elliptic boundary-value problems via Monte Carlo and quasi-Monte Carlo methods. SIAM J. Sci. Comput. 27, 440–457 (2005)
Acebrón, J.A., Busico, M.P., Lanucara, P., Spigler, R.: Probabilistically induced domain decomposition methods for elliptic boundary-value problems. J. Comput. Phys. 210, 421–438 (2005)
Acebrón, J.A., Spigler, R.: Fast simulations of stochastic dynamical systems. J. Comput. Phys. 208, 106–115 (2005)
Acebrón, J.A., Spigler, R.: A new probabilistic approach to the domain decomposition method. In: Gerbier, A. (ed.) Mes premieres constructions de programmes. LNCS, vol. 55, pp. 475–480. Springer, Heidelberg (2007)
Brenner, S.C.: Lower bounds of two-level additive Schwarz preconditioners with small overlap. SIAM J. Numer. Anal. 21, 1657–1669 (2000)
Caflisch, R.E.: Monte Carlo and quasi Monte Carlo methods. Acta Numerica,1–49 (1998)
Dryja, M., Widlund, O.B.: Domain decomposition algorithms with small overlap. SIAM J. Sci. Comput. 15, 604–620 (1994)
Freidlin, M.: Functional integration and partial differential equations. Annals of Mathematics Studies no. 109, Princeton Univ. Press (1985)
Geist, G.A.: Progress towards Petascale Virtual Machines. In: Dongarra, J.J., Laforenza, D., Orlando, S. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface. LNCS, vol. 2840, pp. 10–14. Springer, Heidelberg (2003)
Jansons, K.M., Lythe, G.D.: Exponential timestepping with boundary test for stochastic differential equations. SIAM J. Sci. Comput. 24, 1809–1822 (2003)
Keyes, D.E.: How scalable is domain decomposition in practice? In: Eleventh International Conference on Domain Decomposition Methods, (London, 1998), pp. 286–297,DDM.org, Augsburg (1999)
Niederreiter, H.: Random number generation and quasi Monte-Carlo methods. SIAM (1992)
Quarteroni, A., Valli, A.: Domain decomposition methods for partial differential equations. Oxford Science Publications, Clarendon Press (1999)
Li, Z., Saad, Y., Sosonkina, M.: pARMS: a parallel version of the algebraic recursive multilevel solver. Numerical Linear Algebra with Applications 10, 485–509 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acebrón, J.A., Spigler, R. (2007). A Fully Scalable Parallel Algorithm for Solving Elliptic Partial Differential Equations. In: Kermarrec, AM., Bougé, L., Priol, T. (eds) Euro-Par 2007 Parallel Processing. Euro-Par 2007. Lecture Notes in Computer Science, vol 4641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74466-5_77
Download citation
DOI: https://doi.org/10.1007/978-3-540-74466-5_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74465-8
Online ISBN: 978-3-540-74466-5
eBook Packages: Computer ScienceComputer Science (R0)