A BDDC algorithm for a class of staggered discontinuous Galerkin methods

  • Authors:
  • Hyea Hyun Kim;Eric T. Chung;Chak Shing Lee

  • Affiliations:
  • -;-;-

  • Venue:
  • Computers & Mathematics with Applications
  • Year:
  • 2014

Quantified Score

Hi-index 0.09

Visualization

Abstract

A BDDC (Balancing Domain Decomposition by Constraints) algorithm is developed and analyzed for a staggered discontinuous Galerkin (DG) finite element approximation of second order scalar elliptic problems. On a quite irregular subdomain partition, an optimal condition number bound is proved for two-dimensional problems. In addition, a sub-optimal but scalable condition number bound is obtained for three-dimensional problems. These bounds are shown to be independent of coefficient jumps in the subdomain partition. Numerical results are also included to show the performance of the algorithm.