Thomas Decomposition of Algebraic and Differential Systems
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.
- Publication:
-
Lecture Notes in Computer Science
- Pub Date:
- 2010
- DOI:
- 10.1007/978-3-642-15274-0_4
- arXiv:
- arXiv:1008.3767
- Bibcode:
- 2010LNCS.6244...31B
- Keywords:
-
- Mathematics - Commutative Algebra;
- Mathematics - Analysis of PDEs;
- 13-04;
- 13P15;
- 13N99;
- 35-04
- E-Print:
- doi:10.1007/978-3-642-15274-0_4