Balancing domain decomposition for problems with large jumps in coefficients (1996)
| Venue: | Math. Comp |
| Citations: | 40 - 8 self |
BibTeX
@ARTICLE{Mandel96balancingdomain,
author = {Jan Mandel and Marian Brezina},
title = {Balancing domain decomposition for problems with large jumps in coefficients},
journal = {Math. Comp},
year = {1996},
volume = {65},
pages = {1387--1401}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. The Balancing Domain Decomposition algorithm uses in each iteration solution of local problems on the subdomains coupled with a coarse problem that is used to propagate the error globally and to guarantee that the possibly singular local problems are consistent. The abstract theory introduced recently by the first-named author is used to develop condition number bounds for conforming linear elements in two and three dimensions. The bounds are independent of arbitrary coefficient jumps between subdomains and of the number of subdomains, and grow only as the squared logarithm of the mesh size h. Computational experiments for two- and three-dimensional problems confirm the theory. 1.
