Algorithmic Thomas Decomposition of Algebraic and Differential Systems

Details Algorithmic Thomas Decomposition of Algebraic and Differential Systems Algorithmic Thomas Decomposition of Algebraic and Differential Systems

2011-08-03

arxiv.org/abs/1108.0817v1

Mathematics

Commutative Algebra

arXiv admin note: substantial text overlap with arXiv:1008.3767

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algorithmic Thomas Decomposition of Algebraic and Differential Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic Thomas Decomposition of Algebraic and Differential Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic Thomas Decomposition of Algebraic and Differential Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663882