Balancing Domain Decomposition by Constraints (BDDC) belongs to the class of primal substructuring Domain Decomposition (DD) methods. DD methods are iterative methods successfully used in engineering to parallelize solution of large linear systems arising from discretization of second order elliptic problems. Substructuring DD methods represent an important class of DD methods. Their main idea is to divide the underlying domain into nonoverlapping subdomains and solve many relatively small, local...
Different choices of the averaging operator within the BDDC method are compared on a series of 2D experiments.
Subdomains with irregular interface and with jumps in material coefficients are included into the study. Two new approaches are studied along three standard choices. No approach is shown to be universally superior to others, and the resulting recommendation is that an actual method should be chosen based on properties of the problem.
In this paper, we discuss the choice of weights in averaging of local (subdomain) solutions on the interface for the BDDC method (Balancing Domain Decomposition by Constraints). We try to find relations among different choices of the interface weights and compare them numerically on model problems of the Poisson equation and linear elasticity in 3D. Problems with jumps in coefficients of material properties are considered and both regular and irregular interfaces between subdomains are tested.
In this paper, we introduce a general framework for derivation of the averaging operator, from which the standard choices are recovered by simplifications. Then, an alternative approach derived by another simplification is proposed and tested on a 2D example.
Download Results (CSV)