Displaying similar documents to “Schwarz domain decomposition preconditioners for discontinuous Galerkin approximations of elliptic problems: non-overlapping case”

Multiplicative Schwarz Methods for Discontinuous Galerkin Approximations of Elliptic Problems

Paola F. Antonietti, Blanca Ayuso (2008)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper we introduce and analyze some non-overlapping multiplicative Schwarz methods for discontinuous Galerkin (DG) approximations of elliptic problems. The construction of the Schwarz preconditioners is presented in a unified framework for a wide class of DG methods. For symmetric DG approximations we provide optimal convergence bounds for the corresponding error propagation operator, and we show that the resulting methods can be accelerated by using suitable Krylov space solvers....

On discontinuous Galerkin method and semiregular family of triangulations

Aleš Prachař (2006)

Applications of Mathematics

Similarity:

Discretization of second order elliptic partial differential equations by discontinuous Galerkin method often results in numerical schemes with penalties. In this paper we analyze these penalized schemes in the context of quite general triangular meshes satisfying only a semiregularity assumption. A new (modified) penalty term is presented and theoretical properties are proven together with illustrative numerical results.

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

Mimetic finite differences for elliptic problems

Franco Brezzi, Annalisa Buffa, Konstantin Lipnikov (2009)

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

Similarity:

We developed a mimetic finite difference method for solving elliptic equations with tensor coefficients on polyhedral meshes. The first-order convergence estimates in a mesh-dependent H 1 norm are derived.