Overlapping Domain Decomposition Methods
Overlapping domain decomposition methods are efficient and flexible. It is also important that such methods are inherently suitable for parallel computing. In this chapter, we will first explain the mathematical formulation and algorithmic composition of the overlapping domain decomposition methods. Afterwards, we will focus on a generic implementation framework and its applications within Diffpack.
KeywordsCoarse Grid Implementation Framework Schwarz Method Member Function Virtual Void
Unable to display preview. Download preview PDF.
- 1.A. M. Bruaset, X. Cai, H. P. Langtangen, and A. Tveito. Numerical solution of PDEs on parallel computers utilizing sequential simulators. In Y. Ishikawa et al., editor, Scientific Computing in Object-Oriented Parallel Environment, Springer-Verlag Lecture Notes in Computer Science 1343, pages 161–168. Springer-Verlag, 1997.Google Scholar
- 2.X. Cai, E. Acklam, H. P. Langtangen, and A. Tveito. Parallel computing in Diffpack. In H. P. Langtangen and A. Tveito], editors, Advanced Topics in Computational Partial Differential Equations-Numerical Methods and Diffpack Programming. Springer, 20Google Scholar
- 3.T. F. Chan and T. P. Mathew. Domain decomposition algorithms. In Acta Numerica 1994, pages 61–143. Cambridge University Press, 1994.Google Scholar
- 5.W. Hackbusch. Multigrid Methods and Applications. Springer, Berlin, 1985.Google Scholar
- 6.K.-A. Mardal, H. P. Langtangen, and G. Zumbusch. Multigrid methods. In H. P. Langtangen and A. Tveito, editors, Advanced Topics in Computational Partial Differential Equations-Numerical Methods and Diffpack Programming. Springer, 2003.Google Scholar
- 8.B. F. Smith, P. E. Bjørstad, and W. Gropp. Domain Decomposition: Paral-lel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, 1996.Google Scholar