Algorithmic Thomas decomposition of algebraic and differential systems

  title={Algorithmic Thomas decomposition of algebraic and differential systems},
  author={Thomas B{\"a}chler and Vladimir P. Gerdt and Markus Lange-Hegermann and Daniel Robertz},
  journal={J. Symb. Comput.},

Tables from this paper

Formal Algorithmic Elimination for PDEs

This tutorial discusses aspects of this correspondence between radical differential ideals and their analytic solution sets in differential algebra involving symbolic computation, and an introduction to the Thomas decomposition method is given.

Singularities of algebraic differential equations

Strong Consistency and Thomas Decomposition of Finite Difference Approximations to Systems of Partial Differential Equations

An algorithmic approach that combines differential and difference algebra to analyze s(trong)-consistency of finite difference approximations of regular solution grids is suggested, which generalizes the definition given earlier for Cartesian grids.

Applying Thomas decomposition and algebraic analysis to certain nonlinear PDE systems

This talk is about work in progress in collaboration with Thomas Cluzeau, Universite de Limoges, and Alban Quadrat, Inria Saclay. We report on first steps of a study of certain systems of nonlinear

Counting solutions of algebraic systems via triangular decomposition

The goal of this thesis is to analyze the solution sets of systems of polynomial equations and inequations over algebraically closed fields algorithmically, and defines a polynometric, which is used as a generalization of the cardinality of a finite set, to give a measure for the size of such a set.

Algebraic and Geometric Analysis of Singularities of Implicit Differential Equations (Invited Talk)

An algorithm for detecting all singularities of an algebraic differential equation over the complex numbers and how geometric methods allow us to determine the local solution behaviour in the neighbourhood of a singularity including the regularity of the solution is presented.

Thomas Decomposition and Nonlinear Control Systems

The paper gives an introduction to the Thomas decomposition method and shows how notions such as invertibility, observability and flat outputs can be studied.



Thomas Decomposition of Algebraic and Differential Systems

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

On Decomposition of Algebraic PDE Systems into Simple Subsystems

  • V. Gerdt
  • Mathematics, Computer Science
  • 2008
An algorithmization of the Thomas method for splitting a system of partial differential equations and (possibly) inequalities into triangular subsystems whose Thomas called simple is presented.


This paper studies triangular differential systems arising from various decompositions of partial differential polynomial systems. In theoretical aspects, we emphasizeon translating differential

Completion of Linear Differential Systems to Involution

This paper considers posing of an initial value problem for a linear differential system providing uniqueness of its solution and Lie symmetry analysis of nonlinear differential equations to determine the structure of arbitrariness in general solution of linear systems and thereby to find the size of symmetry group.

Completion of Linear Differential Systems to Involution

. In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential

Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra

  • W. Seiler
  • Mathematics
    Algorithms and computation in mathematics
  • 2010
The book provides a self-contained account of the formal theory of general, i.e. also under- and overdetermined, systems of differential equations which in its central notion of involution combines

Gauss-Bruhat decomposition as an example of Thomas decomposition

Abstract.Both the Gauss-Bruhat decomposition and the LU-decomposition of the general linear group over a field are examples of a Thomas decomposition of systems of polynomial equations and

Computing representations for radicals of finitely generated differential ideals

This paper deals with systems of polynomial differential equations, ordinary or with partial derivatives. The embedding theory is the differential algebra of Ritt and Kolchin. We describe an

Unmixed-dimensional Decomposition of a Finitely Generated Perfect Differential Ideal

Some of the main problems in polynomial ideal theory can be solved by means of this decomposition: it is shown how the radical membership can be decided, a characteristic set of a prime differential ideal can be selected, and the differential dimension with a parametricSet of a differential Ideal can be read.

Notes on Triangular Sets and Triangulation-Decomposition Algorithms II: Differential Systems

  • E. Hubert
  • Mathematics, Computer Science
  • 2001
This is the second in a series of two tutorial articles devoted to triangulation-decomposition algorithms and uses results presented in the first article on polynomial systems but can be read independently.