BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields

Duk-Soon Oh, Olof B. Widlund, Stefano Zampini, Clark R. Dohrmann

Research output: Contribution to journalArticlepeer-review

35 Scopus citations

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 languageEnglish (US)
Pages (from-to)659-692
Number of pages34
JournalMathematics of Computation
Volume87
Issue number310
DOIs
StatePublished - Jun 13 2017

Fingerprint

Dive into the research topics of 'BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields'. Together they form a unique fingerprint.

Cite this