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.
منابع مشابه
Restricted overlapping balancing domain decomposition methods and restricted coarse problems for the Helmholtz problem
Overlapping balancing domain decomposition methods and their combination with restricted additive Schwarz methods are proposed for the Helmholtz equation. These new methods also extend previous work on non-overlapping balancing domain decomposition methods toward simplifying their coarse problems and local solvers. They also extend restricted Schwarz methods, originally designed to overlapping ...
متن کاملNumerical Implementation of Overlapping Balancing Domain Decomposition Methods on Unstructured Meshes
The Overlapping Balancing Domain Decomposition (OBDD) methods can be considered as an extension of the Balancing Domain Decomposition (BDD) methods to the case of overlapping subdomains. This new approach, has been proposed and studied in [4, 3]. In this paper, we will discuss its practical parallel implementation and present numerical experiments on large unstructured meshes.
متن کاملCoupling Methods for Continuum Model with Molecular Model
Coupling methods for continuum models with molecular models are developed. Two methods are studied here: an overlapping domain decomposition method, which has overlapping domain, and an edge-to-edge decomposition method, which has an interface between two models. These two methods enforce the compatibility on the overlapping domain or interface nodes/atoms by the Lagrange multiplier method or t...
متن کاملDomain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions
In this paper we report on a non-overlapping and an overlapping domain decomposition method as preconditioners for the boundary element approximation of an indefinite hypersingular integral equation on a surface. The equation arises from an integral reformulation of the Neumann screen problem with the Helmholtz equation in the exterior of a screen in R. It is well-known that the linear algebrai...
متن کاملOn the Innuence of the Partitioning Schemes on the Eeciency of Overlapping Domain Decomposition Methods on the Innuence of the Partitioning Schemes on the Eeciency of Overlapping Domain Decomposition Methods
One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization of block Jacobi preconditioning. The eeect of the number of blocks and the amount of overlapping between blocks on the convergence rate is well understood. This paper considers the related issue of the eeect of the scheme used to partition the matrix into blocks on the convergence rate of the pr...
متن کامل