Mesh optimization for the virtual element method: How small can an agglomerated mesh become?

Abstract

We present an optimization procedure for generic polygonal or polyhedral meshes, tailored for the Virtual Element Method (VEM). Once the local quality of the mesh elements is analyzed through a quality indicator specific to the VEM, groups of elements are agglomerated to optimize the global mesh quality. A user-set parameter regulates the percentage of mesh elements, and consequently of faces, edges, and vertices, to be removed. This significantly reduces the total number of degrees of freedom associated with a discrete problem defined over the mesh with the VEM, particularly for high-order formulations. We show how the VEM convergence rate is preserved in the optimized meshes, and the approximation errors are comparable with those obtained with the original ones. We observe that the optimization has a regularization effect over low-quality meshes, removing the most pathological elements. In such cases, these “badly-shaped” elements yield a system matrix with very large condition number, which may cause the VEM to diverge, while the optimized meshes lead to convergence. We conclude by showing how the optimization of a real CAD model can be used effectively in the simulation of a time-dependent problem.