BDDC preconditioners for isogeometric analysis

A Balancing Domain Decomposition by Constraints (BDDC) preconditioner for Isogeometric Analysis of scalar elliptic problems is constructed and analyzed by introducing appropriate discrete norms. A main result of this work is the proof that the proposed isogeometric BDDC preconditioner is scalable in the number of subdomains and quasi-optimal in the ratio of subdomain and element sizes. Another main result is the numerical validation of the theoretical convergence rate estimates by carrying out several two-and three-dimensional tests on serial and parallel computers. These numerical experiments also illustrate the preconditioner performance with respect to the polynomial degree and the regularity of the NURBS basis functions, as well as its robustness with respect to discontinuities of the coefficient of the elliptic problem across subdomain boundaries.