BDDC for a Saddle Point Problem with an HDG Discretization

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].