Top
Back: pIntersectSyz
Forward: linReduceIdeal
FastBack: LETTERPLACE
FastForward: central_lib
Up: bfun_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document
7.7.1.0. linReduce
Procedure from library bfun.lib (see bfun_lib).

Usage:
linReduce(f, I [,s,t,u]); f a poly, I an ideal, s,t,u optional ints

Return:
poly or list, linear reductum (over field) of f by elements from I

Purpose:
reduce a polynomial only by linear reductions (no monomial multiplications)

Note:
If s<>0, a list consisting of the reduced polynomial and the coefficient
vector of the used reductions is returned, otherwise (and by default)
only reduced polynomial is returned.
If t<>0 (and by default) all monomials are reduced (if possible),
otherwise, only leading monomials are reduced.
If u<>0 (and by default), the ideal is linearly pre-reduced, i.e.
instead of the given ideal, the output of linReduceIdeal is used.
If u is set to 0 and the given ideal does not equal the output of
linReduceIdeal, the result might not be as expected.

Display:
If printlevel=1, progress debug messages will be printed,
if printlevel>=2, all the debug messages will be printed.

Example:
 


Top Back: pIntersectSyz Forward: linReduceIdeal FastBack: LETTERPLACE FastForward: central_lib Up: bfun_lib 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.