Adaptive BDDC and FETI-DP Methods with Change of Basis Formulation
In this paper, BDDC (Balancing Domain Decomposition by Constraints) and FETI-DP (Dual-Primal Finite Element Tearing and Interconnecting) algorithms with a change of basis for adaptive primal constraints are analyzed.
The first author was supported by the National Research Foundation of Korea(NRF) grants funded by NRF20151009350, the second author was supported by the Hong Kong RGC General Research Fund (Project 14317516) and the CUHK Direct Grant for Research 2016–2017, and the third author was supported by the National Natural Science Foundation of China (Grant No. 11201398) and Open Foundation of Guangdong Provincial Engineering Technology Research Center for Data Science(2016KF07).
- 3.C.R. Dohrmann, C. Pechstein, Modern domain decomposition solvers: BDDC, deluxe scaling, and an algebraic approach, 2013. http://people.ricam.oeaw.ac.at/c.pechstein/pechstein-bddc2013.pdf
- 6.H.H. Kim, E. Chung, J. Wang, BDDC and FETI-DP mathods with enriched coarse spaces for elliptic problems with oscillatory and high contrast coefficients, in Domain Decomposition Methods in Science and Engineering XXIII. Lecture Notes in Computer Science and Engineering, vol. 116 (Springer, Heidelberg, 2017), pp. 179–186Google Scholar