Title  Construction of Janet Bases II.Polynomial Bases 
Author(s)  Yuri A. Blinkov, Vladimir P. Gerdt, Denis A. Yanovich 
Type  Article in Journal 
Abstract  In this paper we give a detailed description of an algorithm for computation of polynomial Janet bases and present its implementation in C, C++ and Reduce. This algorithm extends to polynomial ideals the algorithm for computation of monomial Janet bases presented in the first part of our paper and improves the specialization to Janet division of the general algorithm for computation of involutive polynomial bases. The computational effciency of our codes is compared with that of computer algebra system Singular which provides one of the best implementations of the Buchberger algorithm for computation of Groebner bases. 
Keywords  detailed description of an algorithm for computation of polynomial Janet bases, polynomial ideal, Janet division, involutive polynomial bases, computational effciency 
Length  15 
File 

URL 
http://invo.jinr.ru/papers.phtml 
Language  English 
Journal  Computer Algebra in Scientific Computing / CASC 2001 
Pages  249263 
Publisher  SpringerVerlag, Berlin 
Year  2001 
Editor  V.G.Ganzha, E.W.Mayr, E.V.Vorozhtsov 
Edition  0 
Translation 
No 
Refereed 
No 
Organization 
Saratov State University 
Institution 
JINR (Joint Institute for Nuclear Research) 