Displaying similar documents to “Analysis of two-level domain decomposition preconditioners based on aggregation”

On a Parallel Implementation of the Mortar Element Method

Gassav S. Abdoulaev, Yves Achdou, Yuri A. Kuznetsov, Christophe Prud'homme (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We discuss a parallel implementation of the domain decomposition method based on the macro-hybrid formulation of a second order elliptic equation and on an approximation by the mortar element method. The discretization leads to an algebraic saddle- point problem. An iterative method with a block- diagonal preconditioner is used for solving the saddle- point problem. A parallel implementation of the method is emphasized. Finally the results of numerical experiments are presented....

New trends in coupled simulations featuring domain decomposition and metacomputing

Philippe d'Anfray, Laurence Halpern, Juliette Ryan (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper we test the feasibility of coupling two heterogeneous mathematical modeling integrated within two different codes residing on distant sites. A prototype is developed using Schwarz type domain decomposition as the mathematical tool for coupling. The computing technology for coupling uses a environment to implement a distributed client-server programming model. Domain decomposition methods are well suited to reducing complex physical phenomena into a sequence of parallel...

Analysis of two-level domain decomposition preconditioners based on aggregation

Marzio Sala (2004)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

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...

Robust domain decomposition preconditioners for abstract symmetric positive definite bilinear forms

Yalchin Efendiev, Juan Galvis, Raytcho Lazarov, Joerg Willems (2012)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

An abstract framework for constructing stable decompositions of the spaces corresponding to general symmetric positive definite problems into “local” subspaces and a global “coarse” space is developed. Particular applications of this abstract framework include practically important problems in porous media applications such as: the scalar elliptic (pressure) equation and the stream function formulation of its mixed form, Stokes’ and Brinkman’s equations. The constant in the corresponding...