Volume 38, Number 5, September-October 2004
|Page(s)||765 - 780|
|Published online||15 October 2004|
Analysis of two-level domain decomposition preconditioners based on aggregation
CMCS/SB/EPFL, 1015 Lausanne, Switzerland. firstname.lastname@example.org.
Revised: 19 April 2004
In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a set of assumptions on the coarse basis functions, to ensure bound for the resulting preconditioned system. These assumptions only involve geometrical quantities associated to the aggregates, namely their diameter and the overlap. A condition number which depends on the product of the relative overlap among the subdomains and the relative overlap among the aggregates is proved. Numerical experiments on a model problem are reported to illustrate the performance of the proposed preconditioners.
Mathematics Subject Classification: 65M55 / 65Y05
Key words: Elliptic equations / domain decomposition / Schwarz methods / aggregation coarse corrections.
© EDP Sciences, SMAI, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.