BDDC Algorithms for Oseen problems with HDG Discretizations

Abstract

Abstract The balancing domain decomposition by constraints (BDDC) methods are applied to the linear system arising from the hybridizable discontinuous Galerkin (HDG) discretization of the Oseen equation of incompressible flow. The generalized minimal residual method (GMRES) is used to accelerate the convergence. The original system is first reduced to a subdomain interface problem that is asymmetric indefinite, but can be positive definite in a special subspace. Edge/face average constraints can ensure all BDDC-preconditioned GMRES iterates stay in this special subspace. The convergence of the algorithm is analyzed, and additional edge/face constraints are used to improve the convergence. If the subdomain size is small enough, the number of iterations is independent of the number of subdomains, and depends only slightly on the subdomain problem size when the viscosity is large. When the viscosity is small, the convergence deteriorates. However, the numerical examples can give satisfactory results for the linear HDG discretization even with a small viscosity.