Mathematics – Commutative Algebra
Scientific paper
1999-12-05
Mathematics and Computers in Simulation 45 (1998) 543-560
Mathematics
Commutative Algebra
22 pages
Scientific paper
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division which leads to partition of variables into multiplicative and non-multiplicative. This partition gives thereby the self-consistent computational procedure for constructing an involutive basis by performing non-multiplicative prolongations and multiplicative reductions. Every specific involutive division generates a particular form of involutive computational procedure. In addition to three involutive divisions used by Thomas, Janet and Pommaret for analysis of partial differential equations we define two new ones. These two divisions, as well as Thomas division, do not depend on the order of variables. We prove noetherity, continuity and constructivity of the new divisions that provides correctness and termination of involutive algorithms for any finite set of input polynomials and any admissible monomial ordering. We show that, given an admissible monomial ordering, a monic minimal involutive basis is uniquely defined and thereby can be considered as canonical much like the reduced Groebner basis.
Blinkov Yuri A.
Gerdt Vladimir P.
No associations
LandOfFree
Minimal Involutive Bases 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 Minimal Involutive Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal Involutive Bases will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-386034