domain decomposition; interface weights; scaling; averaging; preconditioner; conjugate gradient methods; Poisson equation
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 problems on subdomains instead of one large problem on the whole domain. In primal methods, it has to be specified how to distribute interface residuals among subdomains and how to obtain global, interface values of solution from local values on adjacent subdomains. Usually a weighted average is used with some simple choice of weights. In our paper we present numerical comparison of three different choices of interface weights on test problem of 2D Poisson equation, with and without jumps in coefficients.