A BDDC algorithm for a class of staggered discontinuous Galerkin methods

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 2014 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Kim, H. H., Chung, E. T., & Lee, C. S. (2014). A BDDC algorithm for a class of staggered discontinuous Galerkin methods. Computers and Mathematics with Applications, 67(7), 1373–1389. https://doi.org/10.1016/j.camwa.2014.02.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free