Multispace and multilevel BDDC

From MaRDI portal
Publication:1006434

DOI10.1007/S00607-008-0014-7zbMATH Open1163.65091arXiv0712.3977OpenAlexW2036019258WikidataQ57863117 ScholiaQ57863117MaRDI QIDQ1006434FDOQ1006434


Authors: Jan Mandel, Bedřich Sousedík, Clark R. Dohrmann Edit this on Wikidata


Publication date: 24 March 2009

Published in: Computing (Search for Journal in Brave)

Abstract: BDDC method is the most advanced method from the Balancing family of iterative substructuring methods for the solution of large systems of linear algebraic equations arising from discretization of elliptic boundary value problems. In the case of many substructures, solving the coarse problem exactly becomes a bottleneck. Since the coarse problem in BDDC has the same structure as the original problem, it is straightforward to apply the BDDC method recursively to solve the coarse problem only approximately. In this paper, we formulate a new family of abstract Multispace BDDC methods and give condition number bounds from the abstract additive Schwarz preconditioning theory. The Multilevel BDDC is then treated as a special case of the Multispace BDDC and abstract multilevel condition number bounds are given. The abstract bounds yield polylogarithmic condition number bounds for an arbitrary fixed number of levels and scalar elliptic problems discretized by finite elements in two and three spatial dimensions. Numerical experiments confirm the theory.


Full work available at URL: https://arxiv.org/abs/0712.3977




Recommendations




Cites Work


Cited In (51)





This page was built for publication: Multispace and multilevel BDDC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006434)