Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-11T01:35:01.638Z Has data issue: false hasContentIssue false

Analysis of two-level domain decomposition preconditioners based on aggregation

Published online by Cambridge University Press:  15 October 2004

Marzio Sala*
Affiliation:
CMCS/SB/EPFL, 1015 Lausanne, Switzerland. msala@sandia.gov.
Get access

Abstract

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.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable