This page is our central repository for determining systems for PDE and PDE systems.
The focus of this page is to make available several pre-computed determining systems, and some timing results for simplification of these systems through use of differential elimination.
First a few words about symmetry determining systems.
Consider a single PDE having one dependent variable phi, and n + 1 dependent variables and t (here = (x_{1},..., x_{n})). To find the determining system for the Lie symmetry generators of the PDE, we consider the expansion of a general transformation about the identity transformation, or mathematically, a transformation of the form:
where ,T, and are all unknown functions of ,t, and , and are called the infinitesimals.
Application of this transformation to the original PDE, enforcement of the symmetry condition (i.e. that the transformed PDE is of the same form as the original PDE), and retaining only up to the () terms gives us a linear determining system of PDE for the infinitesimals.
It should be noted that although the determining system is linear in the infinitesimals, the original PDE can contain unknowns (or so-called classifying functions), which makes the overall problem of simplification of these equations a nonlinear one. In this way, determination of the form of the symmetries can proceed with an entire class of PDE.
Now to discuss a few details.
All downloadable systems are stored in tarred gzipped archives. Each archive (unless noted otherwise) contains all the systems for that form of the input PDE. The determining system is stored in the files as a Maple list of differential expressions. Once downloaded and unpacked, the files can easily be read into Maple V3-Maple 6.01 using a read command. Once read, the determining system will be in the list U, and can be further manipulated from that point. Any assumptions on expressions that do not vanish are present in the N list, and a ranking, if the default is not being used, is present in the Janet list. Either N or Janet may not be present.
It should be noted that the available systems are in completely unsimplified form. This means that there may be duplicate equations, or equations that easily reduce to zero with respect to others. The SYMMETRY package, written by Dr. Mark Hickman was used to create the defining systems from the original PDE.
The PureElim algorithm running in the DiffElim environment has some similarities to the RifSimp and Standard Form algorithms. The system is brought into simplified form with respect to a ranking of the derivatives. This allows the code to determine the leading derivative of an equation and determine the leading term of that equation. By default PureElim ranks indeterminates in the following way:
The Janet variable alters the ranking by adding criteria before the default ranking. It is in list form, and can specify any of the above type of criteria. For a sample problem involving dependent variables Phi,X, and T, independent variables phi,x, and t, and constant c it is specified as:
Janet : = [[Phi, X, T],[phi, x, t], phi, x, t, Phi, X, T, c]. | (1) |
Now that the extremely brief background is done, the systems and their timings are available through the links below.