A Comparison of Consistent Discretizations for Elliptic Problems on Polyhedral Grids

Abstract

In this work, we review a set of consistent discretizations for second-order elliptic equations, and compare and contrast them with respect to accuracy, monotonicity, and factors affecting their computational cost (degrees of freedom, sparsity, and condition numbers). Our comparisons include the linear and nonlinear TPFA method, multipoint flux-approximation (MPFA-O), mimetic methods, and virtual element methods. We focus on incompressible flow and study the effects of deformed cell geometries and anisotropic permeability.