In this chapter, we discuss several computational issues that arise with the implementation of domain decomposition algorithms. The first issue concerns the choice of a decomposition of a domain into non-overlapping or overlapping subdomains. When an algorithm is implemented using multiple processors, the number of interior unknowns per subdomain must be approximately the same, to ensure load balancing, while the number of boundary unknowns must be minimized to reduce inter-subdomain communication. We describe graph partitioning algorithms which partition a grid. The second issue concerns the expected parallel computation time and speed up when implementing a domain decomposition preconditioner on an idealized parallel computer architecture. We outline heuristic estimate for this using idealized models for the computational time and inter-processor data transfer times.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Computational Issues and Parallelization. In: Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations. Lecture Notes in Computational Science and Engineering, vol 61. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77209-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-77209-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77205-7
Online ISBN: 978-3-540-77209-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)