Algorithmic Thomas Decomposition of Algebraic and Differential Systems
Abstract
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems, simplicity means triangularity, square-freeness and non-vanishing initials. Differential simplicity extends algebraic simplicity with involutivity. We build upon the constructive ideas of J. M. Thomas and develop them into a new algorithm for disjoint decomposition. The given paper is a revised version of a previous paper and includes the proofs of correctness and termination of our decomposition algorithm. In addition, we illustrate the algorithm with further instructive examples and describe its Maple implementation together with an experimental comparison to some other triangular decomposition algorithms.
Cite
@article{arxiv.1108.0817,
title = {Algorithmic Thomas Decomposition of Algebraic and Differential Systems},
author = {Thomas Bächler and Vladimir Gerdt and Markus Lange-Hegermann and Daniel Robertz},
journal= {arXiv preprint arXiv:1108.0817},
year = {2012}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1008.3767