A bound is obtained for the condition number of a BDDC algorithm for problems posed in H(curl) in two dimensions, where the subdomains are only assumed to be uniform in the sense of Peter Jones. For the primal variable ...

An adaptive choice for primal spaces based on parallel sums is developed for BDDC deluxe methods and elliptic problems in three dimensions. The primal space, which forms the global, coarse part of the domain decomposition ...

An adaptive choice for primal spaces based on parallel sums is developed for BDDC deluxe methods and elliptic problems in three dimensions. The primal space, which forms the global, coarse part of the domain decomposition ...

There has recently been a considerable activity in developing adaptive methods for the selection of primal constraints for BDDC algorithms and, in particular, for BDDC deluxe variants. The primal constraints of a BDDC or ...

Two domain decomposition methods for solving vector field problems posed in H(curl) and discretized with Nedelec finite elements are considered. These finite elements are conforming in H(curl). A two-level overlapping ...

Two domain decomposition methods for solving vector field problems posed in H(curl) and discretized with Nedelec finite elements are considered. These finite elements are conforming in H(curl). A two-level overlapping ...