Top
Back: linReduce
Forward: linSyzSolve
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. linReduceIdeal
Procedure from library bfun.lib (see bfun_lib).

Usage:
linReduceIdeal(I [,s,t,u]); I an ideal, s,t,u optional ints

Return:
ideal or list, linear reductum (over field) of I by its elements

Purpose:
reduces a list of polys only by linear reductions (no monomial
multiplications)

Note:
If s<>0, a list consisting of the reduced ideal and the coefficient
vectors of the used reductions given as module is returned.
Otherwise (and by default), only the reduced ideal 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 first sorted in increasing order.
If u is set to 0 and the given ideal is not sorted in the way described,
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: linReduce Forward: linSyzSolve 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.