A BDDC algorithm for a class of staggered discontinuous Galerkin methods

详细信息    查看全文

• 作者：Hyea Hyun Kim ; Eric T. Chung ; ^{tschung@math.cuhk.edu.hk" class="auth_mail} ; Chak Shing Lee
• 关键词：BDDC algorithms ; Elliptic problems ; Preconditioned conjugate gradients ; Discontinuous Galerkin methods ; Irregular subdomains
• 刊名：Computers and Mathematics with Applications
• 出版年：April, 2014
• 年：2014
• 卷：67
• 期：7
• 页码：1373-1389
• 全文大小：1613 K

文摘

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.