Thomas Decomposition of Algebraic and Differential Systems
- Cite this paper as:
- Bächler T., Gerdt V., Lange-Hegermann M., Robertz D. (2010) Thomas Decomposition of Algebraic and Differential Systems. In: Gerdt V.P., Koepf W., Mayr E.W., Vorozhtsov E.V. (eds) Computer Algebra in Scientific Computing. CASC 2010. Lecture Notes in Computer Science, vol 6244. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.