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

Ivana Pultarová

Mathematics and Computers in Simulation (MATCOM), 2012, vol. 82, issue 10, 1788-1798

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

Keywords: Domain decomposition; Multilevel methods; Hierarchical methods; Preconditioning; Strengthened CBS inequality (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475411001819
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:82:y:2012:i:10:p:1788-1798

DOI: 10.1016/j.matcom.2011.06.006

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().