We provide the presentation of difference operators in a polynomial,
semi-factorized and a nodal form. Running findifs_example();
will demonstrate, how we generate finite difference schemes of linear PDEs
from given approximations.
Theory: The method we use have been developed by V. Levandovskyy and Bernd Martin. The
computation of a finite difference scheme of a given single linear partial
differential equation with constant coefficients with a given approximation
rules boils down to the computation of a Groebner basis of a submodule of
a free module with respect to the ordering, eliminating module components.
Support: SpezialForschungsBereich F1301 of the Austrian FWF