| Abstract: | A new coarse space for domain decomposition methods is presented for nodal elliptic problems in two dimensions. The coarse space is derived from the novel virtual element methods and therefore can accommodate quite irregular polygonal subdomains. It has the advantage with respect to previous studies that no discrete harmonic extensions are required. The virtual element method allows us to handle polygonal meshes and the algorithm can then be used as a preconditioner for linear systems that arise from a discretization with such triangulations. A bound is obtained for the condition number of the preconditioned system by using a two-level overlapping Schwarz algorithm, but the coarse space can also be used for different substructuring methods. This bound is independent of jumps in the coefficient across the interface between the subdomains. Numerical experiments that verify the result are shown, including some with triangular, square, hexagonal and irregular elements and with irregular subdomains obtained by a mesh partitioner. |
