A unified framework for adaptive BDDC. (English) Zbl 1368.65043
Summary: In this theoretical study, we explore how to automate the selection of weights and primal constraints in BDDC methods for general SPD problems. In particular, we address the three-dimensional case and non-diagonal weight matrices such as the deluxe scaling. We provide an overview of existing approaches, show connections between them, and present new theoretical results: A localization of the global BDDC estimate leads to a reliable condition number bound and to a local generalized eigenproblem on each glob, i.e., each subdomain face, edge, and possibly vertex. We discuss how the eigenvectors corresponding to the smallest eigenvalues can be turned into generalized primal constraints. These can be either treated as they are or (which is much simpler to implement) be enforced by (possibly stronger) classical primal constraints. We show that the second option is the better one. Furthermore, we discuss equivalent versions of the face and edge eigenproblem which match with previous works and show an optimality property of the deluxe scaling. Lastly, we give a localized algorithm which guarantees the definiteness of the matrix \(\widetilde{S}\) underlying the BDDC preconditioner under mild assumptions on the subdomain matrices.
MSC:
65F08 | Preconditioners for iterative methods |
65N30 | Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs |
65N35 | Spectral, collocation and related methods for boundary value problems involving PDEs |
65N55 | Multigrid methods; domain decomposition for boundary value problems involving PDEs |