A BDDC algorithm with adaptive primal constraints for staggered discontinuous Galerkin approximation of elliptic problems with highly oscillating coefficients
Publication in refereed journal

Times Cited
Altmetrics Information

Other information
AbstractA BDDC (Balancing Domain Decomposition by Constraints) algorithm for a staggered discontinuous Galerkin approximation is considered. After applying domain decomposition method, a global linear system on the subdomain interface unknowns is obtained and solved by the conjugate gradient method combined with a preconditioner. To construct a preconditioner that is robust to the coefficient variations, a generalized eigenvalue problem on each subdomain interface is solved and primal unknowns are selected from the eigenvectors using a predetermined tolerance. By the construction of the staggered discontinuous Galerkin methods, the degrees of freedom on subdomain interfaces are shared by only two subdomains, and hence the construction of primal unknowns are simplified. The resulting BDDC algorithm is shown to have the condition number bounded by the predetermined tolerance. A modified algorithm for parameter dependent problems is also introduced, where the primal unknowns are only computed in an offline stage. Numerical results are included to show the performance of the proposed method and to verify the theoretical estimate.
All Author(s) ListHyea Hyun Kim, Eric T. Chung, Chenxiao Xu
Journal nameJournal of Computational and Applied Mathematics
Volume Number311
Pages599 - 617
LanguagesEnglish-United States

Last updated on 2020-06-08 at 02:21