Abstract
A BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a deluxe type of weighted average and an adaptive selection of primal constraints developed to deal with coefficients with high contrast even inside individual subdomains. For problems with very many subdomains, a third level of the preconditioner is introduced.
Original language | English (US) |
---|---|
Pages (from-to) | 659-692 |
Number of pages | 34 |
Journal | Mathematics of Computation |
Volume | 87 |
Issue number | 310 |
DOIs | |
State | Published - Jun 13 2017 |