A balancing Neumann–Neumann method for a mortar finite element discretization of a fourth order elliptic problem

Abstract

In the paper a balanced Neumann–Neumann algorithm for the reduced HCT finite element discretization on nonmatching meshes is discussed. The overall discretization is done using a mortar technique which is based on the application of an approximate matching condition for the discrete functions. The algorithms are analyzed using the abstract Schwarz framework, proving an almost optimal condition bound which is independent of the parameters of the problem, and depends only logarithmically on the ratio between the subdomain size and the mesh size.