Top
Back: LLL
Forward: modStd
FastBack: lll_lib
FastForward: mprimdec_lib
Up: Commutative algebra
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.4.9 modstd_lib

Library:
modstd.lib
Purpose:
Grobner basis of ideals
Authors:
A. Hashemi, Amir.Hashemi@lip6.fr
G. Pfister pfister@mathematik.uni-kl.de
H. Schoenemann hannes@mathematik.uni-kl.de

Note:
A library for computing the Grobner basis of an ideal in the polynomial ring over the rational numbers using modular methods. The procedures are inspired by the following paper:
Elizabeth A. Arnold:
Modular Algorithms for Computing Groebner Bases , Journal of Symbolic Computation , April 2003, Volume 35, (4), p. 403-419.

Procedures:

D.4.9.1 modStd  compute a standard basis of I using modular methods
D.4.9.2 modS  liftings to Q of standard bases of I mod p for p in L
D.4.9.3 primeList  intvec of n primes <= 2134567879 in decreasing order


Top Back: LLL Forward: modStd FastBack: lll_lib FastForward: mprimdec_lib Up: Commutative algebra Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-0-3, May 2007, generated by texi2html.