Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleInvolutive Division Technique: Some Generalizations and Optimizations
Author(s) Vladimir P. Gerdt
TypeArticle in Journal
AbstractIn 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 Groebner basis of a polynomial ideal by se­quentially 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 nonmultiplica­tive variables in the course of the algorithm.
Keywordsinvolutive division, involutive Groebner basis, involutive algorithms,
Length19
File
URL http://invo.jinr.ru/papers.phtml
LanguageEnglish
Year1998
Edition0
Translation No
Refereed No
Institution JINR (Joint Institute for Nuclear Research)
Webmaster