We present an abstract discretization framework and demonstrate that various cell-centered and hybrid finite-volume schemes fit into it. The different schemes considered in this work are then analyzed numerically for an elliptic model problem with respect to the properties consistency, coercivity, extremum principles, and sparsity. The test cases presented comprise of two-and three-dimensional setups, mildly and highly anisotropic tensors and grids of different complexities. The results show that all schemes show a similar convergence behavior, except for the two-point flux approximation scheme, and seem to be coercive. Furthermore, they confirm that linear schemes, in contrast to nonlinear schemes, are in general neither positivity-preserving nor satisfy discrete minimum or maximum principles.
Discretization schemesLet X & R d ; d 2 N Ã , be an open bounded connected polygonal domain with boundary oX, and d-dimensional measure |X|. In the following, we consider the elliptic problem r Á ÀKru ð Þ¼f in X;Here, we assume that f 2 L 2 (X) and K is a symmetric tensor-valued function such that (s.t.) the spectrum of K(x) is contained in [a 0 , b 0 ], with 0 < a 0 < b 0 < +1, for