Domain decomposition techniques

8Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce some parallel domain decomposition preconditioners for iterative solution of sparse linear systems like those arising from the approximation of partial differential equations by finite elements or finite volumes. We first give an overview of algebraic domain decomposition techniques. We then introduce a preconditioner based on a multilevel approximate Schur complement system. Then we present a Schwarz-based preconditioner augmented by an algebraic coarse correction operator. Being the definition of a coarse grid a difficult task on unstructured meshes, we propose a general framework to build a coarse operator by using an agglomeration procedure that operates directly on the matrix entries. Numerical results are presented aimed at assessing and comparing the effectiveness of the two methodologies. The main application will concern computational fluid dynamics (CFD), and in particular the simulation of compressible flow around aeronautical configurations. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Formaggia, L., Sala, M., & Saleri, F. (2006). Domain decomposition techniques. Lecture Notes in Computational Science and Engineering, 51, 135–163. https://doi.org/10.1007/3-540-31619-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free