Thomas Decomposition of Algebraic and Differential Systems
Preprint
Abstract
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new algorithm. For algebraic systems simplicity means triangularity, squarefreeness and non-vanishing initials. For differential systems the algorithm provides not only algebraic simplicity but also involutivity. The algorithm has been implemented in Maple.Keywords
All Related Versions
- Version 1, 2010-08-23, ArXiv
- Version 1, 2011-08-03, ArXiv (Unconfirmed version)
- Published version: , 31.
This publication has 5 references indexed in Scilit:
- Detecting unnecessary reductions in an involutive basis computationJournal of Symbolic Computation, 2005
- Unmixed-dimensional Decomposition of a Finitely Generated Perfect Differential IdealJournal of Symbolic Computation, 2001
- Fast Search for the Janet DivisorProgramming and Computer Software, 2001
- Decomposing Polynomial Systems into Simple SystemsJournal of Symbolic Computation, 1998
- Representation for the radical of a finitely generated differential ideal1995