BDDC preconditioners for divergence free virtual element discretizations of the Stokes equations (Q2161824): Difference between revisions

The balancing domain decomposition by constraints (BDDC) preconditioner is an iterative substructuring method for the solution of partial differential equations (PDEs), that belongs to the class of nonoverlapping domain decomposition algorithms. The virtual element method (VEM) is a new family of numerical methods for the approximation of partial differential equations, where the geometry of the polytopal mesh elements can be very general. The aim of this article is to extend the balancing domain decomposition by constraints preconditioner to the solution of the saddle-point linear system arising from a VEM discretization of the two-dimensional Stokes equations. Under suitable hypothesis on the choice of the primal unknowns, the preconditioned linear system results symmetric and positive definite, thus the preconditioned conjugate gradient method can be used for its solution. They provide a theoretical convergence analysis estimating the condition number of the preconditioned linear system. Several numerical experiments validate the theoretical estimates, showing the scalability and quasi-optimality of the method proposed. Moreover, the solver exhibits a robust behavior with respect to the shape of the polygonal mesh elements. They also show that a faster convergence could be achieved with an easy to implement coarse space, slightly larger than the minimal one covered by the theory.