DOMAIN DECOMPOSITION ALGORITHMS WITH SMALL OVERLAP

Authors
DRYJA M WIDLUND OB
Citation
M. Dryja et Ob. Widlund, DOMAIN DECOMPOSITION ALGORITHMS WITH SMALL OVERLAP, SIAM journal on scientific computing, 15(3), 1994, pp. 604-620
Citations number
62
Categorie Soggetti
Computer Sciences",Mathematics
Journal title
SIAM journal on scientific computing → ACNP
ISSN journal
10648275
Volume
15
Issue
3
Year of publication
1994
Pages
604 - 620
Database
ISI
SICI code
1064-8275(1994)15:3<604:DDAWSO>2.0.ZU;2-#
Abstract
Numerical experiments have shown that two-level Schwarz methods often perform very well even if the overlap between neighboring subregions i s quite small. This is true to an even greater extent for a related al gorithm, due to Barry Smith, where a Schwarz algorithm is applied to t he reduced linear system of equations that remains after the variables interior to the subregions have been eliminated. In this paper, a sup porting theory is developed.