BDDC Deluxe Domain Decomposition
We will consider BDDC domain decomposition algorithms for finite element approximations of a variety of elliptic problems. The BDDC (Balancing Domain Decomposition by Constraints) algorithms were introduced by Dohrmann , following the introduction of FETI-DP by Farhat et al. . These two families are closely related algorithmically and have a common theory. The design of a BDDC algorithm involves the choice of a set of primal degrees of freedom and the choice of an averaging operator, which restores the continuity of the approximate solution across the interface between the subdomains into which the domain of the given problem has been partitioned. We will also refer to these operators as scalings.
KeywordsDomain Decomposition Isogeometric Analysis Primal Space Preconditioned Conjugate Gradient Method Nodal Finite Element
The first author was supported in part by the National Science Foundation Grant DMS-1216564 and in part by the U.S. Department of Energy under contract DE-FE02-06ER25718. The second author is a member of the Computational Solid Mechanics and Structural Dynamics Department, Sandia National Laboratories, Albuquerque, New Mexico. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000.
- 1.L. Beirão da Veiga, L.F. Pavarino, S. Scacchi, O.B. Widlund, S. Zampini, Isogeometric BDDC preconditioners with deluxe scaling. SIAM J. Sci. Comput. 36(3), A1118–A1139 (2014a)Google Scholar
- 2.L. Beirão da Veiga, L.F. Pavarino, S. Scacchi, O.B. Widlund, S. Zampini, BDDC deluxe for isogeometric analysis, in These Proceedings (2014b)Google Scholar
- 3.J.G. Calvo, A BDDC algorithm with deluxe scaling for H(curl) in two dimensions with irregular domains. Technical report TR2014-965, Courant Institute of Mathematical Sciences, 2014. Math. Comput. (to appear)Google Scholar
- 6.C.R. Dohrmann, O.B. Widlund, Some recent tools and a BDDC algorithm for 3D problems in H(curl), in Domain Decomposition Methods in Science and Engineering XX, ed. by R. Bank, M. Holst, O. Widlund, J. Xu. Proceedings of the Twentieth International Conference on Domain Decomposition Methods held at the University of California at San Diego, 9–13 February 2011. Lecture Notes in Computational Science and Engineering, vol. 91 (Springer, Heidelberg–Berlin, 2013), pp. 15–26Google Scholar
- 7.C.R. Dohrmann, O.B. Widlund, A BDDC algorithm with deluxe scaling for three-dimensional H(curl) problems. Technical report TR2014-964, Courant Institute, New York University, March 2014. Appeared electronically in Comm. Pure Appl. Math. (April 2015)Google Scholar
- 10.R. Hiptmair, J. Xu, Nodal auxiliary space preconditioning in H(curl) and H(div) spaces. SIAM J. Numer. Anal. 45(6), 2483–2509 (electronic) (2007)Google Scholar
- 13.D.-S. Oh, A BDDC preconditioner for problems posed in H(div) with deluxe scaling, in These Proceedings, 2014Google Scholar
- 14.D.-S. Oh, O.B. Widlund, C.R. Dohrmann, A BDDC algorithm for Raviart-Thomas vector fields. Technical report TR2013-951, Courant Institute, New York University, February 2013Google Scholar
- 16.A. Toselli, O. Widlund, Domain Decomposition Methods - Algorithms and Theory. Springer Series in Computational Mathematics, vol. 34 (Springer, Berlin 2005)Google Scholar
- 17.S. Zampini (2013). http://www.mcs.anl.gov/petsc/petsc-dev/docs/manualpages/PC/PCBDDC.html