Algorithmic Thomas decomposition of algebraic and differential systems
From MaRDI portal
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.
Recommendations
- Thomas decomposition of algebraic and differential systems
- On decomposition of algebraic PDE systems into simple subsystems
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- Formal algorithmic elimination for PDEs
- Gauss-Bruhat decomposition as an example of Thomas decomposition
Cites work
- scientific article; zbMATH DE number 1601215 (Why is no real title available?)
- scientific article; zbMATH DE number 2125581 (Why is no real title available?)
- scientific article; zbMATH DE number 1254247 (Why is no real title available?)
- scientific article; zbMATH DE number 1274701 (Why is no real title available?)
- scientific article; zbMATH DE number 517393 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 1979252 (Why is no real title available?)
- scientific article; zbMATH DE number 2110642 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- scientific article; zbMATH DE number 5052246 (Why is no real title available?)
- scientific article; zbMATH DE number 3280051 (Why is no real title available?)
- scientific article; zbMATH DE number 3304265 (Why is no real title available?)
- scientific article; zbMATH DE number 3415973 (Why is no real title available?)
- scientific article; zbMATH DE number 967945 (Why is no real title available?)
- scientific article; zbMATH DE number 3056446 (Why is no real title available?)
- Abstract Differential Algebra and the Analytic Case
- Abstract Differential Algebra and the Analytic Case. II
- Coherent, regular and simple systems in zero decompositions of partial differential systems.
- Comprehensive Triangular Decomposition
- Computing representations for radicals of finitely generated differential ideals
- Counting solutions of polynomial systems via iterated fibrations
- Counting with groups and rings.
- Decomposing polynomial systems into simple systems
- Detecting unnecessary reductions in an involutive basis computation
- Differential elimination and biological modelling
- Effectiveness of involutive criteria in computation of polynomial Janet bases
- Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
- Elimination methods
- Fast search for the Janet divisor
- Gauss-Bruhat decomposition as an example of Thomas decomposition
- Involution. The formal theory of differential equations and its applications in computer algebra
- Involutive bases of polynomial ideals
- Minimal involutive bases
- On an algorithmic optimization in computation of involutive bases
- On decomposition of algebraic PDE systems into simple subsystems
- On the theories of triangular sets
- Parallel sparse polynomial multiplication using heaps
- Specializations in Differential Algebra
- Thomas decomposition of algebraic and differential systems
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
Cited in
(40)- Thomas decomposition and nonlinear control systems
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- On symbolic approaches to integro-differential equations
- Formal algorithmic elimination for PDEs
- The differential dimension polynomial for characterizable differential ideals
- Characteristic decomposition: from regular sets to normal sets
- Gauss-Bruhat decomposition as an example of Thomas decomposition
- Une note sur les algorithmes de décomposition en algèbre différentielle
- From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work
- Noetherian quotients of the algebra of partial difference polynomials and Gröbner bases of symmetric ideals
- Chordal graphs in triangular decomposition in top-down style
- On the numerical analysis and visualisation of implicit ordinary differential equations
- Singularities of algebraic differential equations
- Algorithms yield upper bounds in differential algebra
- On boundary conditions parametrized by analytic functions
- An equivalence theorem for regular differential chains
- A logic based approach to finding real singularities of implicit ordinary differential equations
- Computing strong regular characteristic pairs with Gröbner bases
- Rational general solutions of systems of first-order algebraic partial differential equations
- Algebraic and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one in several variables
- Lagrangian constraints and differential Thomas decomposition
- The differential counting polynomial
- On the consistency analysis of finite difference approximations
- On the general analytical solution of the kinematic Cosserat equations
- Some control observation problems and their differential algebraic partial solutions
- Thomas decomposition of algebraic and differential systems
- On decomposition of algebraic PDE systems into simple subsystems
- On the Chordality of Simple Decomposition in Top-Down Style
- Formal algorithmic elimination for PDEs
- Identifying Markov chain models from time-to-event data: an algebraic approach
- Decomposition of polynomial sets into characteristic pairs
- The Maple package TDDS for computing Thomas decompositions of systems of nonlinear PDEs
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Algebraic construction and numerical behavior of a new s-consistent difference scheme for the 2D Navier-Stokes equations
- A test for monomial containment
- On rational recursion for holonomic sequences
- scientific article; zbMATH DE number 7579747 (Why is no real title available?)
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
- Comprehensive characteristic decomposition of parametric polynomial systems
- On the algorithmic linearizability of nonlinear ordinary differential equations
Describes a project that uses
Uses Software
This page was built for publication: Algorithmic Thomas decomposition of algebraic and differential systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q432753)
