RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 1999 Volume 258, Pages 185–207 (Mi znsl1038)

This article is cited in 14 papers

Involutive division technique: some generalizations and optimizations

V. P. Gerdt

Joint Institute for Nuclear Research

Abstract: In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them allows one to compute an involutive Gröbner basis of a polynomial ideal by sequentially examining multiplicative reductions of nonmultiplicative prolongations. We study dependence of involutive algorithms on the completion ordering. Based on properties of particular involutive divisions two computational optimizations are suggested. One of them consists in a special choice of the completion ordering. Another optimization is related to recomputing multiplicative and nonmultiplicative variables in the course of the algorithm.

UDC: 512.2+681.3

Received: 15.05.1999

Language: English


 English version:
Journal of Mathematical Sciences (New York), 2002, 108:6, 1034–1051

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024