![]() |
ETNA - Electronic Transactions on Numerical Analysis
|
![]() |
Verlag der Österreichischen Akademie der Wissenschaften Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400 https://verlag.oeaw.ac.at, e-mail: verlag@oeaw.ac.at |
|
||||||||||||||||||||
|
DATUM, UNTERSCHRIFT / DATE, SIGNATURE
BANK AUSTRIA CREDITANSTALT, WIEN (IBAN AT04 1100 0006 2280 0100, BIC BKAUATWW), DEUTSCHE BANK MÜNCHEN (IBAN DE16 7007 0024 0238 8270 00, BIC DEUTDEDBMUC)
|

ETNA - Electronic Transactions on Numerical Analysis, pp. 64-80, 2018/04/25
BDDC (Balancing Domain Decomposition by Constraints) and FETI-DP (Dual-Primal Finite Element Tearing and Interconnecting) algorithms with adaptively enriched primal constraints are considered. The coarse component of the two algorithms is built on the set of primal unknowns consisting of those at subdomain vertices and those from the adaptive primal constraints after a change of basis. For the FETI-DP algorithm, a more general form of a preconditioner is proposed to extend the algorithm to the set of primal unknowns including those from the adaptive primal constraints. In addition, it can be shown that the two algorithms share the same spectra except those equal to one or zero when the same set of adaptive primal constraints are employed. Numerical results are included for both two and three dimensional model problems.
Keywords: FETI-DP, BDDC, adaptive primal constraints, change of basis, condition numbers