Balancing Domain Decomposition (1993)
| Venue: | Comm. Numer. Meth. Engrg |
| Citations: | 91 - 9 self |
BibTeX
@ARTICLE{Mandel93balancingdomain,
author = {Jan Mandel},
title = {Balancing Domain Decomposition},
journal = {Comm. Numer. Meth. Engrg},
year = {1993},
volume = {9},
pages = {233--241}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with unstructured subdomains for iterative solution of finite element discretizations of difficult problems with strongly discontinuous coefficients [6]. However, this algorithm suffers from the need to solve in each iteration an inconsistent singular problem for every subdomain, and its convergence deteriorates with increasing number of subdomains due to the lack of a coarse problem to propagate the error globally. We show that the equilibrium conditions for the singular problems on subdomains lead to a simple and natural construction of a coarse problem. The construction is purely algebraic and applies also to systems, such as those that arize in elasticity. A convergence bound independent on the number of subdomains is proved and results of computational tests are reported.
