Displaying similar documents to “Domain decomposition methods for solving the Burgers equation”

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

Composite grid finite element method: Implementation and iterative solution with inexact subproblems

Radim Blaheta, P. Byczanski, Roman Kohut (2002)

Applications of Mathematics

Similarity:

This paper concerns the composite grid finite element (FE) method for solving boundary value problems in the cases which require local grid refinement for enhancing the approximating properties of the corresponding FE space. A special interest is given to iterative methods based on natural decomposition of the space of unknowns and to the implementation of both the composite grid FEM and the iterative procedures for its solution. The implementation is important for gaining all benefits...

A new finite element approach for problems containing small geometric details

Wolfgang Hackbusch, Stefan A. Sauter (1998)

Archivum Mathematicum

Similarity:

In this paper a new finite element approach is presented which allows the discretization of PDEs on domains containing small micro-structures with extremely few degrees of freedom. The applications of these so-called Composite Finite Elements are two-fold. They allow the efficient use of multi-grid methods to problems on complicated domains where, otherwise, it is not possible to obtain very coarse discretizations with standard finite elements. Furthermore, they provide a tool for discrete...

Numerical study of two sparse AMG-methods

Janne Martikainen (2003)

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

Similarity:

A sparse algebraic multigrid method is studied as a cheap and accurate way to compute approximations of Schur complements of matrices arising from the discretization of some symmetric and positive definite partial differential operators. The construction of such a multigrid is discussed and numerical experiments are used to verify the properties of the method.