The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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...
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...
Download Results (CSV)