2001 | OriginalPaper | Chapter
Construction of Janet Bases II. Polynomial Bases
Authors : Vladimir P. Gerdt, Yuri A. Blinkov, Denis A. Yanovich
Published in: Computer Algebra in Scientific Computing CASC 2001
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 efficiency 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 Gröbner bases.