Mimetic finite difference discretizations



Principle ideas of our methodology

Mimetic finite difference discretizations
An algorithm for deriving mimetic discretizations will be described for the elliptic equation in the mixed form:
subject to the homogeneous Dirichlet boundary condition. The solution p and the flux f satisfy the Green formula:
The general steps of the SO methodology are as follows:

Properties of the discretization.


Example I: Polygonal meshes
Let p(x, y) = x3 y2 + x cos(xy) sin(x) be the exact solution and the diffusion tensor be given by
Let &Omega be the unit square. We consider the sequence of polygonal median meshes.
The right figure below shows the superconvergence for both the pressure and the flux.

o       o

Example II: Locally refined meshes
Let p(x, y) , K and &Omega be as in Example I. We consider the sequence of locally refined quadrilateral meshes.
The right figure below shows the superconvergence for both the pressure and the flux.

o      o

Example III: Locally refined meshes (strong refinement)
Let p(x, y) , K and &Omega be as in Example I.
We consider the sequence of meshes with strong refinement in the middle subdomain (see the left figure below).

o      o

Example IV: Non-matching meshes
Let K be piecewise constant and the exact solution be
where K1 and K2 are positive constants. We consider the sequence of non-matching random meshes.
The second figure below corresponds to K1 = K2 = 1. The third figure corresponds to K1 = 1 and K2 = 106.

o    o    o

Example V: Meshes with non-convex polygons
Let p(x, y) , K and &Omega be as in Example I. We consider the sequence of random meshes.
Each mesh in the sequence has a fixed amount of non-convex polygons.
o    o

References.


o