Preconditioning of the coarse problem in the method of balanced domain decomposition by constraints

The method of balanced domain decomposition by constraints is an iterative algorithm for numerical solution of partial differential equations which exploits a non-overlapping partition of a domain. As an essential part of each step, restricted problems are solved on every subdomain and a certain coa...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics and computers in simulation 2012-06, Vol.82 (10), p.1788-1798
Main Author: Pultarová, Ivana
Format: Article
Language:English
Subjects:
Domain decomposition
Hierarchical methods
Multilevel methods
Preconditioning
Strengthened CBS inequality
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The method of balanced domain decomposition by constraints is an iterative algorithm for numerical solution of partial differential equations which exploits a non-overlapping partition of a domain. As an essential part of each step, restricted problems are solved on every subdomain and a certain coarse grid solution is found. In this paper we present a new strategy of preconditioning of the coarse problem. This is based on the algebraic multilevel preconditioning technique. We present numerical estimates of constants defining the condition numbers of the preconditioned coarse problems for several two- and three-dimensional elliptic equations.
ISSN:0378-4754
1872-7166
DOI:10.1016/j.matcom.2011.06.006