Top
Back: solve_IP
Forward: modStd
FastBack: intprog_lib
FastForward: monomialideal_lib
Up: Commutative algebra
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.4.10 modstd_lib

Library:
modstd.lib
Purpose:
Groebner basis of ideals

Authors:
A. Hashemi Amir.Hashemi@lip6.fr
G. Pfister pfister@mathematik.uni-kl.de
H. Schoenemann hannes@mathematik.uni-kl.de
A. Steenpass steenpass@mathematik.uni-kl.de
S. Steidel steidel@mathematik.uni-kl.de

Overview:
A library for computing the Groebner 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 35, 403-419 (2003).

Procedures:

D.4.10.1 modStd  standard basis of I using modular methods (chinese remainder)
D.4.10.2 modS  liftings to Q of standard bases of I mod p for p in L
D.4.10.3 modHenselStd  standard basis of I using modular methods (hensel lifting)


Top Back: solve_IP Forward: modStd FastBack: intprog_lib FastForward: monomialideal_lib Up: Commutative algebra Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-1-6, Dec 2012, generated by texi2html.