A BDDC algorithm for a class of staggered discontinuous Galerkin methods
Publication in refereed journal

Times Cited
Altmetrics Information

Other information
AbstractA 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. © 2014 Elsevier Ltd. All rights reserved.
All Author(s) ListKim H.H., Chung E.T., Lee C.S.
Journal nameComputers and Mathematics with Applications
Volume Number67
Issue Number7
PublisherPergamon Press Ltd.
Place of PublicationUnited Kingdom
Pages1373 - 1389
LanguagesEnglish-United Kingdom
KeywordsBDDC algorithms, Discontinuous Galerkin methods, Elliptic problems, Irregular subdomains, Preconditioned conjugate gradients

Last updated on 2020-01-06 at 23:51