Top
Back: annfsParamBM
Forward: checkRoot
FastBack: central_lib
FastForward: dmodapp_lib
Up: dmod_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document
7.7.3.0. annfsBMI
Procedure from library dmod.lib (see dmod_lib).

Usage:
annfsBMI(F [,eng,met,us]); F an ideal, eng, met, us optional ints

Return:
ring

Purpose:
compute two kinds of Bernstein-Sato ideals, associated to
f = F[1]*..*F[P], with the multivariate algorithm by Briancon and Maisonobe.

Note:
activate the output ring with the setring command. In this ring,
- the ideal LD is the annihilator of F[1]^s_1*..*F[P]^s_p,
- the list or ideal BS is a Bernstein-Sato ideal of a polynomial f = F[1]*..*F[P].
If eng <>0, std is used for Groebner basis computations,
otherwise, and by default slimgb is used.
If met <0, the B-Sigma ideal (cf. Castro and Ucha,
'On the computation of Bernstein-Sato ideals', 2005) is computed.
If 0 < met < P, then the ideal B_P (cf. the paper) is computed.
Otherwise, and by default, the ideal B (cf. the paper) is computed.
If us<>0, then syzygies-driven method is used.
If the output ideal happens to be principal, the list of factors
with their multiplicities is returned instead of the ideal.
If printlevel=1, progress debug messages will be printed,
if printlevel>=2, all the debug messages will be printed.

Example:
 


Top Back: annfsParamBM Forward: checkRoot FastBack: central_lib FastForward: dmodapp_lib Up: dmod_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.