A BDDC algorithm for a class of staggered discontinuous Galerkin methods

Hyea Hyun Kim Tsz Shun Eric CHUNG Chak Shing Lee

TBD mathscidoc:1910.43500

Computers & Mathematics with Applications, 67, (7), 1373-1389, 2014.4
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.
No keywords uploaded!
[ Download ] [ 2019-10-20 18:11:21 uploaded by Tsz_Shun_Eric_CHUNG ] [ 215 downloads ] [ 0 comments ]
@inproceedings{hyea2014a,
  title={A BDDC algorithm for a class of staggered discontinuous Galerkin methods},
  author={Hyea Hyun Kim, Tsz Shun Eric CHUNG, and Chak Shing Lee},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191020181121443323029},
  booktitle={Computers & Mathematics with Applications},
  volume={67},
  number={7},
  pages={1373-1389},
  year={2014},
}
Hyea Hyun Kim, Tsz Shun Eric CHUNG, and Chak Shing Lee. A BDDC algorithm for a class of staggered discontinuous Galerkin methods. 2014. Vol. 67. In Computers & Mathematics with Applications. pp.1373-1389. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191020181121443323029.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved