Abstract

Currently, there is much interest in the development of geometric integrators, which retain analogues of geometric properties of an approximated system. This paper provides a means of ensuring that finite difference schemes accurately mirror global properties of approximated systems. To this end, we introduce a cohomology theory for lattice varieties, on which finite difference schemes and other difference equations are defined. We do not assume that there is any continuous space, or that a scheme or difference equation has a continuum limit. This distinguishes our approach from theories of “discrete differential forms” built on simplicial approximations and Whitney forms, and from cohomology theories built on cubical complexes. Indeed, whereas cochains on cubical complexes can be mapped injectively to our difference forms, a bijection may not exist. Thus our approach generalizes what can be achieved with cubical cohomology. The fundamental property that we use to prove our results is the natural ordering on the integers. We show that our cohomology can be calculated from a good cover, just as de Rham cohomology can. We postulate that the dimension of solution space of a globally defined linear recurrence relation equals the analogue of the Euler characteristic for the lattice variety. Most of our exposition deals with forward differences, but little modification is needed to treat other finite difference schemes, including Gauss-Legendre and Preissmann schemes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.