Abstract
The Balancing Domain Decomposition by Constraints (BDDC) algorithms, introduced in [4], are nonoverlapping domain decomposition methods. The coarse problems in the BDDC algorithms are given in terms of a set of primal constraints. An important advantage with such a coarse problem is that the Schur complements that arise in the computation will all be invertible. The BDDC algorithms have been extended to many different applications with different discretizations such as [9, 10, 13, 14, 2] and [11, 12].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Tu, X., Wang, B. (2020). BDDC for a Saddle Point Problem with an HDG Discretization. In: Haynes, R., et al. Domain Decomposition Methods in Science and Engineering XXV. DD 2018. Lecture Notes in Computational Science and Engineering, vol 138. Springer, Cham. https://doi.org/10.1007/978-3-030-56750-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-56750-7_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-56749-1
Online ISBN: 978-3-030-56750-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)