The orthogonal decomposition theorems for mimetic finite difference methods

Accurate discrete analogs of differential operators that satisfy the identities and theorems of vector and tensor calculus provide reliable finite difference methods for approximating the solutions to a wide class of partial differential equations. These methods mimic many fundamental properties of the underlying physical problem including conservation laws, symmetries in the solution, and the nondivergence of particular vector fields (i.e., they are divergence free) and should satisfy a discrete version of the orthogonal decomposition theorem. This theorem plays a fundamental role in the theory of generalized solutions and in the numerical solution of physical models, including the Navier-Stokes equations and in electrodynamics. We are deriving mimetic finite difference approximations of the divergence, gradient, and curl that satisfy discrete analogs of the integral identities satisfied by the differential operators. We first define the natural discrete divergence, gradient, and curl operators based on coordinate invariant definitions, such as Gauss's theorem, for the divergence. Next we use the formal adjoints of these natural operators to derive compatible divergence, gradient, and curl operators with complementary domains and ranges of values. In this paper we prove that these operators satisfy discrete analogs of the orthogonal decomposition theorem and demonstrate how a discrete vector can be decomposed into two orthogonal vectors in a unique way, satisfying a discrete analog of the formula (A) over right arrow grad phi + curl (B) over right arrow. We also present a numerical example to illustrate the numerical procedure and calculate the convergence rate of the method for a spiral vector field.