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

Details:

   
TitleOn selection of nonmultiplicative prolongations in computation of Janet bases.
Author(s) Yuri A. Blinkov, Vladimir P. Gerdt
TypeArticle in Journal
AbstractWe consider three modifications of our basic involutive algorithm for computing polynomial Janet bases. These modifications, which are related to degree-compatible monomial orders, yield specific selection strategies for nonmultiplicative prolongations. Using a standard database of benchmarks designed for testing programs computing Gröbner bases, we compare these algorithmic modifications (in terms of their efficiency) with Faugéres F 4 algorithm, which is built in the Magma computer algebra system.
ISSN0361-7688; 1608-3261/e
URL http://link.springer.com/article/10.1134%2FS0361768807030048
LanguageEnglish
JournalProgram. Comput. Softw.
Volume33
Number3
Pages147--153
PublisherSpringer US, New York, NY; Pleiades Publishing, New York, NY; MAIK ``Nauka/Interperiodica
Year2007
Edition0
Translation No
Refereed No
Webmaster