Multispace and multilevel BDDC

Thumbnail Image

Files

0712.3977.pdf (273.39 KB)

Links to Files

https://link.springer.com/article/10.1007/s00607-008-0014-7

Permanent Link

http://hdl.handle.net/11603/23372

Collections

UMBC Mathematics and Statistics Department

Author/Creator

Author/Creator ORCID

https://orcid.org/0000-0002-8053-8956

Date

2008-09-25

Type of Work

journal articles
postprints
Text

Department

Program

Citation of Original Publication

Mandel, J., Sousedík, B. & Dohrmann, C.R. Multispace and multilevel BDDC. Computing 83, 55–85 (2008). https://doi.org/10.1007/s00607-008-0014-7

Rights

This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.

Subjects

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.