The Maple package TDDS for computing Thomas decompositions of systems of nonlinear PDEs

DOI10.1016/J.CPC.2018.07.025arXiv1801.09942OpenAlexW2787227876WikidataQ114192795 ScholiaQ114192795MaRDI QIDQ6043324FDOQ6043324

Authors: Vladimir Gerdt, Markus Lange-Hegermann, Daniel Robertz 

Publication date: 5 May 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Abstract: We present the Maple package TDDS (Thomas Decomposition of Differential Systems). Given a polynomially nonlinear differential system, which in addition to equations may contain inequations, this package computes a decomposition of it into a finite set of differentially triangular and algebraically simple subsystems whose subsets of equations are involutive. Usually the decomposed system is substantially easier to investigate and solve both analytically and numerically. The distinctive property of a Thomas decomposition is disjointness of the solution sets of the output subsystems. Thereby, a solution of a well-posed initial problem belongs to one and only one output subsystem. The Thomas decomposition is fully algorithmic. It allows to perform important elements of algebraic analysis of an input differential system such as: verifying consistency, i.e., the existence of solutions; detecting the arbitrariness in the general analytic solution; given an additional equation, checking whether this equation is satisfied by all common solutions of the input system; eliminating a part of dependent variables from the system if such elimination is possible; revealing hidden constraints on dependent variables, etc. Examples illustrating the use of the package are given.

Full work available at URL: https://arxiv.org/abs/1801.09942

zbMATH Keywords

consistencydifferential systemdifferential eliminationThomas decompositionsimple systemcompletion to involution

Mathematics Subject Classification ID

Numerical analysis (65-XX) Systems theory; control (93-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elimination methods
• Classical mechanics. Hamiltonian and Lagrangian formalism.
• Computing representations for radicals of finitely generated differential ideals
• Title not available (Why is that?)
• Coherent, regular and simple systems in zero decompositions of partial differential systems.
• Algorithmic Thomas decomposition of algebraic and differential systems
• Title not available (Why is that?)
• On decomposition of algebraic PDE systems into simple subsystems
• Essential components of an algebraic differential equation
• Formal algorithmic elimination for PDEs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reduction of systems of nonlinear partial differential equations to simplified involutive forms
• The differential counting polynomial
• Title not available (Why is that?)
• Lagrangian constraints and differential Thomas decomposition

Cited In (12)

• Singularities of algebraic differential equations
• Thomas decomposition and nonlinear control systems
• A strongly-consistent difference scheme for 3D nonlinear Navier-Stokes equations
• A logic based approach to finding real singularities of implicit ordinary differential equations
• On boundary conditions parametrized by analytic functions
• Algebraic and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one in several variables
• Title not available (Why is that?)
• On the algorithmic linearizability of nonlinear ordinary differential equations
• Identifying Markov chain models from time-to-event data: an algebraic approach
• Contribution to integral elimination
• Periodic Pólya urns, the density method and asymptotics of Young tableaux
• Surfing on curved surfaces -- the Maple package Surf

This page was built for publication: The Maple package TDDS for computing Thomas decompositions of systems of nonlinear PDEs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043324)