{ "id": "1703.06323", "version": "v1", "published": "2017-03-18T17:47:49.000Z", "updated": "2017-03-18T17:47:49.000Z", "title": "Robust and scalable domain decomposition solvers for unfitted finite element methods", "authors": [ "Santiago Badia", "Francesc Verdugo" ], "categories": [ "math.NA" ], "abstract": "Unfitted finite element methods have a great potential for large scale simulations, since avoid the generation of body-fitted meshes and the use of graph partitioning techniques, two main bottlenecks for problems with non-trivial geometries. However, the linear systems that arise from these discretizations can be much more ill-conditioned, due to the so-called small cut cell problem. The state-of-the-art approach is to rely on sparse direct methods, which have quadratic complexity and thus, are not well-suited for large scale simulations. In order to solve this situation, in this work we investigate the use of domain decomposition preconditioners (balancing domain decomposition by constraints) for unfitted methods. We observe that a straightforward application of these preconditioners to the unfitted case has a very poor behavior. As a result, we propose an enhancement of the classical BDDC methods based on 1) a modified (stiffness) weighting operator and 2) an improved definition of the coarse degrees of freedom in the definition of the preconditioner . These changes lead to a robust and algorithmically scalable solver able to deal with unfitted grids. A complete set of complex 3D numerical experiments show the good performance of the proposed preconditioners.", "revisions": [ { "version": "v1", "updated": "2017-03-18T17:47:49.000Z" } ], "analyses": { "keywords": [ "unfitted finite element methods", "scalable domain decomposition solvers", "large scale simulations", "small cut cell problem", "preconditioner" ], "note": { "typesetting": "TeX", "pages": 0, "language": "en", "license": "arXiv", "status": "editable" } } }